Abstract
Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction defined for Tree Insertion Grammar. In this paper, we describe a parsing algorithm that makes use of this characteristic to reduce the practical complexity of TAG parsing: the expensive standard adjunction operation is only considered in those cases in which the simpler cubic-time adjunction cannot be applied.
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
Miguel A. Alonso, David Cabrero, Eric de la Clergerie, and Manuel Vilares. Tabular algorithms for TAG parsing. In Proc. of EACL’99, Ninth Conference of the European Chapter of the Association for Computational Linguistics, pages 150–157, Bergen, Norway, June 1999. ACL.
Eric de la Clergerie. Refining tabular parsers for TAGs. In Proceedings of Language Technologies 001: The Second Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL’01), pages 167–174, CMU, Pittsburgh, PA, USA, June 2001.
Christy Doran, Dania Egedi, Beth Ann Hockey, B. Srinivas, and Martin Zaidel. XTAG system-a wide coverage grammar for English. In Proc. of the 15th International Conference on Computational Linguistics (COLING’94), pages 922–928, Kyoto, Japan, August 1994.
Aravind K. Joshi and Yves Schabes. Tree-adjoining grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages. Vol 3: Beyond Words, chapter 2, pages 69–123. Springer-Verlag, Berlin/Heidelberg/New York, 1997.
Mark-Jan Nederhof. The computational complexity of the correct-prefix property for TAGs. Computational Linguistics, 25(3):345–360, 1999.
Yves Schabes and Richard C. Waters. Tree insertion grammar: A cubic-time parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics, 21(4):479–513, December 1995. Also as Technical Report TR-94-13, June 1994, Mitsubishi Electric Research Laboratories, Cambridge, MA, USA.
Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3–36, July-August 1995.
Klaas Sikkel. Parsing Schemata-A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science-An EATCS Series. Springer-Verlag, Berlin/Heidelberg/New York, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, M.A., Carrillo, V., Díaz, V.J. (2002). Mixed Parsing of Tree Insertion and Tree Adjoining Grammars. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_71
Download citation
DOI: https://doi.org/10.1007/3-540-36131-6_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00131-7
Online ISBN: 978-3-540-36131-2
eBook Packages: Springer Book Archive