Parsing Tree Adjoining Grammars

Part of the Cognitive Technologies book series (COGTECH, volume 0)


This chapter treats different parsing techniques for TAG. We will extend the standard algorithms for CFG, i.e., present a CYK parser, different types of Earley algorithms and LR parsing for TAG.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Nederhof, Mark-Jan. 1998. An alternative LR algorithm for TAGs. In Proceedings of ACL, Montreal, Canada.Google Scholar
  2. Joshi, Aravind K. 1985. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In D. Dowty, L. Karttunen, and A. Zwicky, editors, Natural Language Parsing. Cambridge University Press, pages 206–250.Google Scholar
  3. Prolo, Carlos. 2000. An efficient LR parser generator for Tree Adjoining Grammars. In Proceedings of the 6th International Workshop on Parsing Technologies (IWPT-2000), pages 207–218, Trento, Italy.Google Scholar
  4. Prolo, Carlos. 2003. LR Parsing for Tree Adjoining Grammars and Its Application to Corpus-Based Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.Google Scholar
  5. Nederhof, Mark-Jan. 1997. Solving the correct-prefix property for TAGs. In T.Becker and H.-U. Krieger, editors, Proceedings of the Fifth Meeting on Mathematics of Language, pages 124–130, Schloss Dagstuhl, Saarbrücken, August.Google Scholar
  6. Nederhof, Mark-Jan. 1999. The computational complexity of the correct-prefix property for TAGs. Computational Linguistics, 25(3):345–360.Google Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.SFB 833Universität TübingenTübingenGermany

Personalised recommendations