Abstract
We propose a modular design of tabular parsing algorithms for tree-adjoining languages. The modularity is made possible by a separation of the parsing strategy from the mechanism of tabulation. The parsing strategy is expressed in terms of the construction of a nondeterministic automaton from a grammar; three distinct types of automaton will be discussed. The mechanism of tabulation leads to the simulation of these nondeterministic automata in polynomial time, independently of the parsing strategy. The proposed application of this work is the design of efficient parsing algorithms for tree-adjoining grammars and related formalisms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alonso Pardo, M., E. de la Clergerie and M. Vilares Ferro. Automata-Based Parsing in Dynamic Programming for Linear Indexed Grammars. In A. Narin'yani, editor, Computational Linguistics and its Applications, Proceedings, 22–27, Moscow, Russia, 1997.
Becker, T. A New Automaton Model for TAGs: 2-SA. Computational Intelligence, 10(4): 422–430, 1994.
Billot, S. and B. Lang. The Structure of Shared Forests in Ambiguous Parsing. In 27th Annual Meeting of the ACL. 143–151, Vancouver, British Columbia, Canada, 1989.
de la Clergerie, E., M. Alonso Pardo and D. Cabrero Souto. A Tabular Interpretation of Bottom-Up Automata for TAG. In Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, 42–45, 1998.
Gazdar, G. Applicability of Indexed Grammars to Natural Languages. In U. Reyle and C. Rohrer, editors, Natural Language Parsing and Linguistic Theories. Dordrecht, Reidel, 69–94, 1987.
Joshi, A. An Introduction to Tree Adjoining Grammars. In A. Manaster-Ramer, editor. Mathematics of Language. Amsterdam, John Benjamins, 87–114, 1987.
Joshi, A., K. Vijay-Shanker and D. Weir. The Convergence of Mildly Context-Sensitive Grammar Formalisms. In P. Sells, S. Shieber, and T. Wasow, editors, Foundational Issues in Natural Language Processing. MIT Press, Cambridge, MA, chapt. 2, 31–81, 1991.
Lang, B. Deterministic Techniques for Efficient Non-Deterministic Parsers. In Automata, Languages and Programming, 2nd Colloquium, vol. 14 of Lecture Notes in Computer Science. Saarbrücken, 255–269, 1974.
Lang, B. Complete Evaluation of Horn Clauses: An Automata Theoretic Approach. Rapport de Recherche 913, Institut National de Recherche en Informatique et en Automatique, Rocquencourt, France, 1988a.
Lang, B. The Systematic Construction of Earley Parsers: Application to the Production of O.(n 6) Earley Parsers for Tree Adjoining Grammars. Unpublished paper, 1988b.
Lang, B. Recognition Can be Harder than Parsing. Computational Intelligence, 10(4): 486–494, 1994.
Nederhof, M.-J. Linear Indexed Automata and Tabulation of TAG Parsing. In Actes des premières journées sur la Tabulation en Analyse Syntaxique et Déduction (Tabulation in Parsing and Deduction). Paris, France, 1–9, 1998.
Nederhof, M.-J. The Computational Complexity of the Correct-Prefix Property for TAGs. Computational Linguistics, 25(3): 345–360, 1999a.
Nederhof, M.-J. Models of Tabulation for TAG Parsing. In Sixth Meeting on Mathematics of Language. Orlando, Florida USA, 143–158, 1999b.
Parchmann, R., J. Duske and J. Specht. On Deterministic Indexed Languages, Information and Control, 45: 48–67, 1980.
Schabes, Y. and K. Vijay-Shanker. Deterministic Left to Right Parsing of Tree Adjoining Languages. In 28th Annual Meeting of the ACL. Pittsburgh, Pennsylvania, USA, 276–283, 1990.
Shieber, S., Y. Schabes and F. Pereira. Principles and Implementation of Deductive Parsing. Journal of Logic Programming, 24: 3–36, 1995.
Sippu, S. and E. Soisalon-Soininen. Parsing Theory, vol. I: Languages and Parsing. Springer, Berlin 1988.
Sippu, S. and E. Soisalon-Soininen. Parsing Theory, vol. II: LR(k) and LL(k) Parsing. Springer, Berlin 1990.
Tomita, M. Efficient Parsing for Natural Language. Dordrecht Kluwer, 1986.
Vijay-Shanker, K. and D. Weir. Parsing Some Constrained Grammar Formalisms. Computational Linguistics, 19(4): 591–636, 1993a.
Vijay-Shanker, K. and D. Weir. The Use of Shared Forests in Tree Adjoining Grammar Parsing. In Sixth Conference of the European Chapter of the ACL. Utrecht, The Netherlands, 384–393, 1993b.
Vijay-Shanker, K. and D. Weir. The Equivalence of Four Extensions of Context-Free Grammars. Mathematical Systems Theory, 27: 511–546, 1994.
Villemonte de la Clergerie, E. and M. Alonso Pardo. A Tabular Interpretation of a Class of 2-Stack Automata. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, vol. 2. Montréal, Québec, Canada, 1333–1339, 1998.
Villemonte de la Clergerie, E. and F. Barthélemy. Information Flow in Tabular Interpretations for Generalized Push-Down Automata. Theoretical Computer Science, 199: 167–198, 1998.
Weir, D. Linear Iterated Pushdowns. Computational Intelligence, 10(4): 431–439, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alonso Pardo, M.Á., Nederhof, MJ. & Villemonte de la Clergerie, E. Tabulation of Automata for Tree-Adjoining Languages. Grammars 3, 89–110 (2000). https://doi.org/10.1023/A:1009967013686
Issue Date:
DOI: https://doi.org/10.1023/A:1009967013686