Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nederhof, Mark-Jan. 1998. An alternative LR algorithm for TAGs. In Proceedings of ACL, Montreal, Canada.
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.
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.
Prolo, Carlos. 2003. LR Parsing for Tree Adjoining Grammars and Its Application to Corpus-Based Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
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.
Nederhof, Mark-Jan. 1999. The computational complexity of the correct-prefix property for TAGs. Computational Linguistics, 25(3):345–360.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Kallmeyer, L. (2010). Parsing Tree Adjoining Grammars. In: Parsing Beyond Context-Free Grammars. Cognitive Technologies, vol 0. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14846-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-14846-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14845-3
Online ISBN: 978-3-642-14846-0
eBook Packages: Computer ScienceComputer Science (R0)