A tabular interpretation of a class of 2-stack automata

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2, Issue , 1998, Pages 1333-1339

  de la Clergerie, Eric Villemonte ^a   Pardo, Miguel Alonso ^b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM UP; INPUT STRING; SPACE COMPLEXITY; TIME COMPLEXITY; TOPDOWN;

AUTOMATA THEORY;

EID: 85149131966     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Alfred V. Aho. 1968. Indexed grammars - an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October.
2. Miguel Angel Alonso Pardo, Eric de la Clergerie, and Manuel Vilares Ferro. 1997. Automata-based parsing in dynamic programming for Linear Indexed Grammars. In A. S. Narin'yani, editor, Proc. of DIALOGUE'97 Computational Linguistics and its Applications International Workshop, pages 22-27, Moscow, Russia, June.
3. F. P. Barthelemy and E. Villemonte de la Clergerie. 1996. Information flow in tabular interpretations for generalized push-down automata. To appear in journal of TCS.
4. Tilman Becker. 1994. A new automaton model for TAGs: 2-SA. Computational Intelligence, 10(4):422-430.
5. Gerald Gazdar. 1987. Applicability of indexed grammars to natural languages. In U. Reyle and C. Rohrer, editors, Natural Language Parsing and Linguistic Theories, pages 69-94. D. Reidel Publishing Company.
6. Aravind K. Joshi. 1987. An introduction to tree adjoining grammars. In Alexis Manaster-Ramer, editor, Mathematics of Language, pages 87-115. John Benjamins Publishing Co., Amsterdam/Philadelphia.
7. Mark-Jan Nederhof. 1997. Solving the correct-prefix property for TAGs. In T. Becker and H.-V. Krieger, editors, Proc. of MOL'97, pages 124-130, Schloss Dagstuhl, Germany, August.
8. Mark-Jan Nederhof. 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, April.
9. Owen Rambow. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania.
10. K. Vijay-Shanker. 1988. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania, January.