Abstract
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in formal languages and automata, including those interested in tree grammars and tree automata.
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
Anne Abeillé, Kathleen M. Bishop, Sharon Cote, and Yves Schabes. 1990. A lexicalized tree adjoining grammar for English. Technical Report MS-CIS-90–24, Department of Computer and Information Science, University of Pennsylvania.
Anne Abeillé. 1988. Parsing french with tree adjoining grammar: some linguistic accounts. In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, August.
N. Chomsky. 1981. Lectures on Government and Binding. Foris, Dordrecht.
Special issue of Computational Intelligence, November 1994, 10(4). Devoted to Tree-Adjoining Grammars.
Jay C. Earley. 1968. An Efficient Context-Free Parsing Algorithm. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA.
G. Gazdar, E. Klein, G. K. Pullum, and I. A. Sag. 1985. Generalized Phrase Structure Grammars. Blackwell Publishing, Oxford. Also published by Harvard University Press, Cambridge, MA.
Maurice Gross. 1984. Lexicon-grammar and the syntactic analysis of french. In Proceedings of the 10th International Conference on Computational Linguistics (COLING’84), Stanford, 2–6 July.
Aravind K. Joshi and Yves Schabes. 1992. Tree-adjoining grammars and lexicalized grammars. In Maurice Nivat and Andreas Podelski (editors), Tree Automata and Languages. Elsevier Science.
Aravind K. Joshi and B. Srinivas. 1994. Disambiguation of super parts of speech (Supertags): almost parsing. In Proceedings of the 17th International Conference on Computational Linguistics (COLING’94), Kyoto, Japan, August.
Aravind K. Joshi, L. S. Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Computer and System Sciences,10(1).
Aravind K. Joshi, K. Vijay-Shanker, and David Weir. 1991. The convergence of mildly context-sensitive grammatical formalisms. In Peter Sells, Stuart Shieber, and Tom Wasow (editors), Foundational Issues in Natural Language Processing. MIT Press, Cambridge MA.
Aravind K. Joshi. 1985. How much context-sensitivity is necessary for characterizing structural descriptions - Tree Adjoining Grammars. In D. Dowty, L. Karttunen, and A. Zwicky (editors), Natural Language Processing - Theoretical, Computational and Psychological Perspectives. Cambridge University Press, New York. Originally presented in a Workshop on Natural Language Parsing at Ohio State University, Columbus, Ohio, May 1983.
Aravind K. Joshi. 1987. An Introduction to Tree Adjoining Grammars. In A. Manaster-Ramer (editor), Mathematics of Language. John Benjamins, Amsterdam.
R. Kaplan and J. Bresnan. 1983. Lexical-functional grammar: A formal system for grammatical representation. In J. Bresnan (editor), The Mental Representation of Grammatical Relations. MIT Press, Cambridge MA.
Lauri Karttunen. 1986. Radical lexicalism. Technical Report CSLI-86–68, CSLI, Stanford University. Also in Alternative Conceptions of Phrase Structure, University of Chicago Press, Baltin, M. and Kroch A., Chicago, 1989.
T. Kasami. 1965. An efficient recognition and syntax algorithm for context-free languages. Technical Report AF-CRL-65–758, Air Force Cambridge Research Laboratory, Bedford, MA.
Anthony Kroch and Aravind K. Joshi. 1985. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85–18, Department of Computer and Information Science, University of Pennsylvania, April.
Anthony Kroch. 1987. Unbounded dependencies and subjacency in a tree adjoining grammar In A. Manaster-Ramer (editor), Mathematics of Language. John Benjamins, Amsterdam.
Joachim Lambek. 1958. The mathematics of sentence structure. American Mathematical Monthly, 65:154–170.
Bernard Lang. 1988. The systematic constructions of Earley parsers: Application to the production of O(n 6) Earley parsers for Tree Adjoining Grammars. Unpublished manuscript, December 30.
]Alberto Lavelli and Giorgio Satta. 1991. Bidirectional parsing of lexicalized tree adjoining grammars InFifth Conference of the European Chapter of the Association for Computational Linguistics (EACL ‘81), Berlin.
Carl Pollard and Ivan A. Sag. 1987. Information-Based Syntax and Semantics. Vol 1: Fundamentals. CSLI.
Owen Rambow, K. Vijay-Shanker, and David Weir. 1995. D-tree grammars In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL), Cambridge, MA, June, pp 151–158.
Owen Rambow. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
P. Resnick. 1992. Probabilistic tree-adjoining grammars as framework for statistical natural language processing. In Proceedings of the 15th International Conference on Computational Linguistics (COLING’92), Nantes, France, August.
Giorgio Satta. 1994. Tree adjoining grammar parsing and boolean matrix multiplication. Computational Linguistics, 20(2), 173–192.
Yves Schabes and Aravind K. Joshi. 1988. An Earley-type parsing algorithm for Tree Adjoining Grammars. In 26th Meeting of the Association for Computational Linguistics (ACL’88), Buffalo, June.
Yves Schabes and Aravind K. Joshi. 1989. The relevance of lexicalization to parsing In Proceedings of the International Workshop on Parsing Technologies, Pittsburgh, August. Also appeared under the title Parsing with Lexicalized Tree adjoining Grammar in Current Issues in Parsing Technologies, MIT Press.
Yves Schabes and Stuart Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics,20(1), 91–124.
Yves Schabes and K. Vijay-Shanker. 1990. De-terministic left to right parsing of Tree Adjoining Languages. In 28th Meeting of the Association for Computational Linguistics (ACL’90), Pittsburgh.
Yves Schabes and Richard C. Waters. 1995. Tree-Insertion Grammars: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced. Computational Linguistics, 21(4), pp 479–514.
Yves Schabes, Anne Abeillé, and Aravind K. Joshi. 1988. Parsing strategies with `lexicalized’ grammars: Application to tree adjoining grammars. In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, Hungary, August.
Yves Schabes. 1990. Mathematical and Computational Aspects of Lexicalized Grammars. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, August. Available as technical report (MS-CIS-90–48, LINC LAB179) from the Department of Computer Science.
Yves Schabes. 1991. Left to right parsing of tree-adjoining grammars. Computational Intelligence, 10(4), 506–524.
Yves Schabes. 1992. Stochastic tree-adjoining grammars. In Proceedings of the 15th International Conference on Computational Linguistics (COLING’92), Nantes, France, August.
K. M. Schimpf and J. H. Gallier. 1985. Tree pushdown automata. Journal of Computer and System Sciences,30:25–39.
Stuart Shieber and Yves Schabes. 1990. Synchronous Tree-Adjoining Grammars. In Proceedings of the 13th International Conference on Computational Linguistics (COLING’90), Helsinki, Finland, August.
Mark Steedman. 1987. Combinatory grammars and parasitic gaps. Natural Language and Linguistic Theory,5:403–439.
J. W. Thatcher. 1971. Characterizing derivations trees of context free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 5:365–396.
K. Vijay-Shanker and Aravind K. Joshi. 1985. Some computational properties of Tree Adjoining Grammars. In 23rd Meeting of the Association for Computational Linguistics, pages 82–93, Chicago, Illinois, July.
K. Vijay-Shanker and Aravind K. Joshi. 1988. Feature structure based tree adjoining grammars In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, August.
K. Vijay-Shanker and David J. Weir. 1990. Parsing constrained grammar formalisms. Computational Linguistics, 19(4), 591–636.
K. Vijay-Shanker. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
K. Vijay-Shanker. 1992. Using description of trees in a tree- adjoining grammar. Computational Linguistics, 18(4), pp 481–517.
David J. Weir. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania
XTAG-Group. 1995. A lexicalized tree-adjoining grammar of English. Technical Report, Institute for Research in Cognitive Science (IRCS), University of Pennsylvania, 95–03.
D. H. Younger. 1967. Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2):189–208.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Joshi, A.K., Schabes, Y. (1997). Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59126-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-59126-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63859-6
Online ISBN: 978-3-642-59126-6
eBook Packages: Springer Book Archive