Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abeillé, A. (1988a). A lexicalized Tree Adjoining Grammar for French: The general framework (Tech. Rep. No. MS-CIS-88–64). University of Pennsylvania.
Abeillé, A. (1988b). Light verb constructions and extraction out of NP in Tree Adjoining Grammar. Papers from the 24th Regional Meeting of the Chicago Linguistic Society. Chicago.
Abeillé, A. (1988c). Parsing French with Tree Adjoining Grammar: Some linguistic accounts. Proceedings of the 12th International Conference on Computational Linguistics (COLING’88). Budapest.
Abeillé, A. (1990). Lexical constraints on syntactic rules in a Tree Adjoining Grammar. Proceedings of the 28th Meeting of the Association for Computational Linguistics (ACL’90).
Abeillé, A., Bishop Kathleen, M., Cote, S, & Schabes, Y. (1990). A lexicalized Tree Adjoining Grammar for English (Tech. Rep. No. MS-CIS-90–24). University of Pennsylvania: Department of Computer and Information Science.
Abeillé, A., & Schabes, Y. (1989). Parsing idioms in Tree Adjoining Grammars. Fourth Conference of the European Chapter of the Association for Computational Linguistics (EACL’89). Manchester.
Abeillé, A., & and Schabes, Y. (1990). Non compositional discontinuous constituents in Tree Adjoining Grammar. Proceedings of the Symposium on Discontinuous Constituents. Tilburg, Holland.
Chomsky, N. (1981). Lectures on government and binding. Foris, Dordrecht.
Gazdar, G., Klein, E., Pullum, G. K., & Sag, I. A. (1985). Generalized phrase structure grammars. Oxford: Blackwell Publishing. Also published by Harvard University Press, Cambridge, MA.
Gross, M. (1984). Lexicon-grammar and the syntactic analysis of French. Proceedings of the 10th International Conference on Computational Linguistics (COLING’84). Stanford, CA.
Joshi, A. K. (1969). Properties of formal grammars with mixed type of rules and their linguistic relevance. Proceedings of the International Conference on Computational Linguistics. Sanga Saby.
Joshi, A. K. (1973). A class of transformational grammars. In M. Gross, M. Halle, & M. P. Schutzenberger (Eds.), The formal analysis of natural languages. Mouton, La Hague.
Joshi, A. K. (1985). How much context-sensitivity is necessary for characterizing structural descriptions — Tree Adjoining Grammars. In D. Dowty, L. Karttunen, & A. Zwicky (Eds.), Natural language processing — Theoretical, computational and psychological perspectives. New York: Cambridge University Press. Originally presented in a Workshop on Natural Language Parsing at Ohio State University, Columbus, May 1983.
Joshi, A. K. (1988). An introduction to Tree Adjoining Grammars. In A. Manaster-Ramer (Ed.), Mathematics of language. Amsterdam: John Benjamins.
Joshi, A. K., Levy, L. S., & Takahashi, M. (1975). Tree adjunct grammars. J. Comput. Syst. Sci., 10, 1.
Karttunen, L. (1986). Radical lexicalism (Tech. Rep. No. CSLI-86–68). CSLI, Stanford University. Also in (1989) M. Baltin & A. Kroch (Eds.), Alternative conceptions of phrase structure. Chicago, University of Chicago Press.
Kroch, A. (1989). Asymmetries in long distance extraction in a TAG grammar. In M. Baltin & A. Kroch (Eds.), Alternative conceptions of phrase structure. University of Chicago Press.
Kroch, A., & Joshi, A. K. (1985). Linguistic relevance of Tree Adjoining Grammars (Tech. Rep. No. MS-CIS-85–18). University of Pennsylvania, Department of Computer and Information Science.
Lang, B. (1990). Towards a uniform formal framework for parsing. In M. Tomita (Ed.), Current issues in parsing technologies. Kluwer Academic.
Pollard, C., & Sag, I. A. (1987). Information-based syntax and semantics: Fundamentals (Vol. 1). CSLI.
Schabes, Y. (1990). Mathematical and computational aspects of lexicalized grammars (Tech. Rep. No. MS-CIS-90-48 LINC LAB 179). Unpublished doctoral dissertation. University of Pennsylvania, Department of Computer and Information Science.
Schabes, Y., Abeillé, A., & Joshi, A. K. (1988). Parsing strategies with `lexicalized’ grammars: Application to Tree Adjoining Grammars. Proceedings of the 12th International Conference on Computational Linguistics (COLING’88). Budapest.
Schabes, Y., & Joshi, A. K. (1988). An Earley-type parsing algorithm for Tree Adjoining Grammars. 26th Meeting of the Association for Computational Linguistics (ACL’88). Buffalo.
Schabes, Y., & Vijay-Shanker, K. (1990). Deterministic left to right parsing of Tree Adjoining Languages. Proceedings of the 28th Meeting of the Association for Computational Linguistics (ACL’90).
Shieber, S. M. (1984). The design of a computer language for linguistic information. 22nd Meeting of the Association for Computational Linguistics (ACL’84). Stanford.
Shieber, S. M. (1985). Using restriction to extend parsing algorithms for complex-feature-based formalisms. 23rd Meeting of the Association for Computational Linguistics (ACL’85). Chicago.
Shieber, S. M. (1986). An introduction to unification-based approaches to grammar. Stanford, CA: Center for the Study of Language and Information.
Steedman, M. (1987). Combinatory grammars and parasitic gaps. Natural Language and Linguistic Theory, 5, 403–439.
Vijay-Shanker, K. (1987). A study of Tree Adjoining Grammars. Unpublished doctoral dissertation. University of Pennsylvania, Department of Computer and Information Science.
Vijay-Shanker, K., & Joshi, A. K. (1985). Some computational properties of Tree Adjoining Grammars. 23rd Meeting of the Association for Computational Linguistics (pp. 82–93).
Vijay-Shanker, K., & Joshi, A. K. (1988). Feature structure based Tree Adjoining Grammars. Proceedings of the 12th International Conference on Computational Linguistics (COLING’88). Budapest.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Schabes, Y., Joshi, A.K. (1991). Parsing with Lexicalized Tree Adjoining Grammar. In: Tomita, M. (eds) Current Issues in Parsing Technology. The Springer International Series in Engineering and Computer Science, vol 126. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3986-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3986-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6781-9
Online ISBN: 978-1-4615-3986-5
eBook Packages: Springer Book Archive