Abstract
Tree Adjoining Grammars (TAG) and Linear Indexed Grammars (LIG) are extensions of Context Free Grammars that generate the class of Tree Adjoining Languages. Taking advantage of this property, and providing a method for translating a TAG into a LIG, we define several parsing algorithms for TAG on the basis of their equivalent LIG parsers. We also explore why some practical optimizations for TAG parsing cannot be applied to the case of LIG.
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.
Similar content being viewed by others
References
Alonso, M. A., Cabrero, D., De la Clergerie, É., and Vilares, M. (1999). 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. ACL.
Alonso, M. A., De la Clergerie, É., Graña, J., and Vilares, M. (2000a). New tabular algorithms for LIG parsing. In Proc. of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 29–40, Trento, Italy.
Alonso, M. A., Nederhof, M.-J., and De la Clergerie, É. (2000b). Tabulation of automata for tree adjoining languages. Grammars, 3(2/3):89–110.
De la Clergerie, É. (2001). Refining tabular parsers for TAGs. In Proceedings of Language Technologies 2001: The Second Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL’01), pages 167–174, CMU, Pittsburgh, PA, USA.
De la Clergerie, É. and Alonso, M. A. (1998). A tabular interpretation of a class of 2-Stack Automata. In COLING-ACL’98, 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Proceedings of the Conference, volume II, pages 1333–1339, Montreal, Quebec, Canada. ACL.
De la Clergerie, É., Alonso, M. A., and Cabrero, D. (1998). A tabular interpretation of bottom-up automata for TAG. In Proc. of Fourth International Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+4), pages 42–45, Philadelphia, PA, USA.
Díaz, V. J., Carrillo, V. and Alonso, M. A. (2000). A bidirectional bottom-up parser for TAG. In Proc. of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 299–300, Trento, Italy.
Gazdar, G. (1987). Applicability of indexed grammars to natural languages. In Reyle, U. and Rohrer, C., editors, Natural Language Parsing and Linguistic Theories, pages 69–94. D. Reidel Publishing Company.
Joshi, A. K. and Schabes, Y. (1997). Tree-adjoining grammars. In Rozenberg, G. and Salomaa, A., editors, Handbook of Formal Languages. Vol 3: Beyond Words, chapter 2, pages 69–123. Springer-Verlag, Berlin/Heidelberg/New York.
Kasami, T. (1965). An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, Massachussetts.
Lavelli, A. and Satta, G. (1991) Bidirectional parsing of lexicalized tree adjoining grammars. In Proceedings of the 5th Conference of the European Chapter of the Association for Computational Linguistics (EACL’91), pages 27–32, Berlin, Germany.
Nederhof, M.-J. (1998). Linear indexed automata and tabulation of TAG parsing. In Proc. of First Workshop on Tabulation in Parsing and Deduction (TAPD’98), pages 1–9, Paris, France.
Nederhof, M.-J. (1999). The computational complexity of the correct-prefix property for TAGs. Computational Linguistics, 25(3):345–360.
Van Noord, G. (1994). Head-cornerparsing for TAG. Computational Intelligence, 10(4):525–534, 1994.
Schabes, Y. (1991). The valid prefix property and left to right parsing of tree-adjoining grammar. In Proc. of II International Workshop on Parsing Technologies, IWPT’91, pages 21–30, Cancún, Mexico.
Schabes, Y. and Shieber, S. M. (1994). An alternative conception of tree-adjoining derivation. Computational Linguistics, 20(1):91–124.
Schneider, K.-M. (2000). Algebraic construction of parsing schemata. In Proc. of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 242–253, Trento, Italy.
Sikkel, K. (1997). 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.
Vijay-Shanker, K. and Weir, D. J. (1991). Polynomial parsing of extensions of context-free grammars. In Tomita, M., editor, Current Issues in Parsing Technology, chapter 13, pages 191–206. Kluwer Academic Publishers, Norwell, MA, USA.
Vijay-Shanker, K. and Weir, D. J. (1993). Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591–636.
Younger, D. H. (1967). Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2): 189–208.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Alonso, M.A., de la Clergerie, É., Díaz, V.J., Vilares, M. (2004). Relating Tabular Parsing Algorithms for LIG and TAG. In: Bunt, H., Carroll, J., Satta, G. (eds) New Developments in Parsing Technology. Text, Speech and Language Technology, vol 23. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2295-6_8
Download citation
DOI: https://doi.org/10.1007/1-4020-2295-6_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2293-7
Online ISBN: 978-1-4020-2295-1
eBook Packages: Humanities, Social Sciences and Law