Parsing with Lexicalized Tree Adjoining Grammar

Most current linguistic theories give lexical accounts of several phenomena that used to be considered purely syntactic. The information put in the lexicon is thereby increased in both amount and complexity: see, for example, lexical rules in LFG (Kaplan & Bresnan, 1983), GPSG (Gazdar, Klein, Pullum, & Sag, 1985), HPSG (Pollard & Sag, 1987), Combinatory Categorial Grammars (Steedman, 1987), Karttunen’s version of Categorial Grammar (Karttunen, 1986, 1988), some versions of GB theory (Chomsky, 1981), and Lexicon-Grammars (Gross, 1984).

[1]  Anne Abeillé,et al.  Parsing French with Tree Adjoining Grammar: some linguistic accounts , 1988, COLING.

[2]  M. Baltin,et al.  Alternative conceptions of phrase structure , 1990 .

[3]  Joseph A. Goguen,et al.  Discrete-Time Machines in Closed Monoidal Categories. I , 1975, J. Comput. Syst. Sci..

[4]  Aravind K. Joshi.  Properties of Formal Grammars with mixed Type of Rules and their Linguistic Relevance , 1969, COLING.

[5]  Anne Abeillé,et al.  Lexical and Syntactic Rules in a Tree Adjoining Grammar , 1990, ACL.

[6]  Maurice Gross,et al.  Lexicon-Grammar and the Syntactic Analysis of French , 1984, ACL.

[7]  Anne Abeillé,et al.  A Lexicalized Tree Adjoining Grammar for French: The General Framework , 1988 .

[8]  Stuart M. Shieber,et al.  Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[9]  Aravind K. Joshi,et al.  An Introduction to Tree Adjoining Grammar , 1987 .

[10]  Stuart M. Shieber,et al.  An Introduction to Unification-Based Approaches to Grammar , 1986, CSLI Lecture Notes.

[11]  Ivan A. Sag,et al.  Information-based syntax and semantics , 1987 .

[12]  K. Vijay-Shankar,et al.  SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS , 1985, ACL 1985.

[13]  K. Vijay-Shanker,et al.  Deterministic Left to Right Parsing of Tree Adjoining Languages , 1990, ACL.

[14]  Aravind K. Joshi,et al.  A Class Of Transformational Grammars , 1973 .

[15]  Ivan A. Sag,et al.  Information-Based Syntax and Semantics: Volume 1, Fundamentals , 1987 .

[16]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[17]  Anne Abeillé,et al.  Parsing Idioms in Lexicalized TAGs , 1989, EACL.

[18]  Bernard Lang,et al.  Towards a Uniform Formal Framework for Parsing , 1991 .

[19]  Masaru Tomita.  Current Issues in Parsing Technology , 1990 .

[20]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[21]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, ACL.

[22]  Aravind K. Joshi,et al.  Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.

[23]  Anthony S. Kroch,et al.  The Linguistic Relevance of Tree Adjoining Grammar , 1985 .

[24]  Anne Abeillé,et al.  A Lexicalized Tree Adjoining Grammar for English , 1990 .

[25]  Aravind K. Joshi,et al.  Feature Structures Based Tree Adjoining Grammars , 1988, COLING.

[26]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[27]  CurteanuNeculai.  Review of "Lecture on contemporary syntactic theories , 1987 .

[28]  Aravind K. Joshi,et al.  An Earley-Type Parsing Algorithm for Tree Adjoining Grammars , 1988, ACL.

[29]  Stuart M. Shieber.  The design of a computer language for linguistic information , 1984 .

[30]  Noam Chomsky,et al.  Lectures on Government and Binding , 1981 .

[31]  Aravind K. Joshi,et al.  Mathematical and computational aspects of lexicalized grammars , 1990 .

[32]  Mark Steedman,et al.  Combinatory grammars and parasitic gaps , 1987 .