Alphabetical List of Papers, By Author

• Anne Abeille, Yves Schabes, Aravind K. Joshi 1990. Using Lexicalized Tags for Machine Translation.
• Berger 1996. A Maximum Entropy Approach to Natural Language Processing.
• Berger 1997. The Improved Iterative Scaling Algorithm: A Gentle Introduction.
• Bikel, Schwartz, Weischedel 1999. An Algorithm that Learns What's in a Name.
• Daniel Bikel 2004. Intricacies of Collins' Parsing Model.
• Steven Bird and Mark Liberman 2000. A Formal Framework for Linguistic Annotation.
• Blei, Bagnell, McCallum 2002. Learning with Scope, with Application to Information Extraction and Classification.
• Borthwick, Sterling, Agichtein, Grishman 1998. NYU: Description of the MENE Named Entity System as Used in MUC-7.
• Carroll, Minnen 1998. Can Subcategorisation Probabilities Help a Statistical Parser?.
• Chomsky 1995. A Minimalist Program for Linguistic Theory.
• Collins, Singer 1999. Unsupervised Models for Named Entity Classification.
• Michael Collins 1999. Head-Driven Statistical Models for Natural Language Processing.
• Dalrymple, Lamping, Pereira, Saraswat 1995. Linear Logic for Meaning Assembly.
• Dell 1995. Speaking and Misspeaking.
• Embick 2001. Unaccusative Syntax and Verbal Alternations.
• Frank, Kroch 1995. Generalized Transformations and the Theory of Grammar.
• Hale, Keyser 1993. On Argument Structure and the Lexical Expression of Syntactic Relations.
• Harley 2000. Possession and the double object construction.
• Hobbs, Appelt, Bear, Israel, Kameyama, Stickel, Tyson 1996. FAUSTUS: A Cascaded Finite-State Transducer for Extracting Information from Natural-Langauge Text.
• Hobbs, Stickel, Martin, Edwards 1988. Interpolation as Abduction.
• Jacobs, Rau 1993. Innovations in Text Interpolation.
• Gerhard Jager, Reinhard Blutner 2006. Against Lexical Decomposition in Syntax.
• Mark Johnson 1998. PCFG Models of Linguistic Tree Representations.
• Klein & Manning 2003a. Fast Exact Inference with a Factored Model for Natural Language Parsing.
• Klein & Manning 2003b. Factored A* Search for Models over Sequences and Trees.
• Klein & Manning 2003c. Accurate Unlexicalized Parsing.
• Lafferty, McCallum, Pereira 2001. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data.
• Lakoff, Ross 1976. Why You Can't Do So Into The Sink.
• Lewis 1998. Naive (Bayes) at Forty: The Independence Assumption in Information Retrieval.
• Matsuzaki, Miyao, Tsujii 2005. Probabilistic CFG with Latent Annotations (PCFG-LA).
• McCallum & Nigam 1998. A Comparison of Event Models for Naive Bayes Text Classification.
• Meyers, Macleod, Grishman 1994. Standardization of the Complement Adjunct Distinciton.
• Miller, Fox, Ramshaw, Weishcedel 2000. A Novel Use of Statistical Parsing to Extract Information from Text.
• Nigam, Lafferty, McCallum 1999. Using Maximum Entropy for Text Classification.
• Nilsson, Nivre, Hall 2006. Graph Transformations in Data-Driven Dependency Parsing.
• Palmer, Han, Xia, Egedi, & Rosenzweig 1998. Constraining Lexical Selection Across Languages Using Tree Adjoining Grammars.
• Petrov, Barrett, Thibaux, Klein 2006. Learning Accurate, Compact, and Interpretable Tree Annotation.
• Ratnaparkhi 1994. A Maximum Entropy Model for Prepositional Phrase Attachment.
• Ratnaparkhi 1997. A Simple Introduction to Maximum Entropy Models for Natural Language Processing.
• Reid 2000. Complex Verb Collocations in Ngan'gityemerri: A Non-Derivational Strategy for Encoding Valency Alternations.
• Reinhart, Siloni 1999. Against the Unaccusative Analysis of Reflexives.
• Riloff 1996. Automatically Generating Extraction Patterns from Untagged Text.
• Riloff, Jones 1999. Learning Dictionaries for Information Extraction by Multi-Level Bootstrapping.
• Rizzi 1992. Argument/Adjunct (A)symmetries.
• Josef Ruppenhofer 2005. Regularities in Null Instantiation.
• Sang & Veenstra 1999. Representing Text Chunks.
• Schaeffer 2000. The Games Computers (and People) Play.
• Fei Sha & Pereira 2003. Shallow Parsing with Conditional Random Fields.
• Shen & Sakar 2005. Voting between Multiple Data Representations for Text Chunking.
• Smiecinska 2001. Towards a Minimalist Analysis of the Argument-Adjunct Asymmetries in English.
• Harold Somers 2001. Machine Translation (Chapter 13).
• Sutton and McCallum 2006. An Introduction to Conditional Random Fields for Relational Learning.
• Tsochantaridis et al, 2004. Support Vector Machine Learning for Interdependent and Structured Output Spaces.
• Wallach 2004. Conditional Random Fields: An Introduction.
• Wang, Sagae, & Mitamura 2006. A Fast, Accurate Deterministic Parser for Chinese.
• Xia, Palmer, Vijay-Shanker, Rosenzweig 1998. Consistent Grammar Development Using Partial-Tree Descriptions for Lexicalized Tree-Adjoining Grammars.
• Yangarber, Grishman 1998. NYU: Description of the Proteus/PET System as Used for MUC-7 ST.
• David Yarowsky 1994. A Comparison Of Corpus-Based Techniques For Restoring Accents In Spanish And French Text.
• Zeman 2002. Can Subcategorization Help a Statistical Dependency Parser?.