Tabular algorithms for TAG parsing

9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999

Volumn , Issue , 1999, Pages 150-157

  Alonso, Miguel A ^b   Cabrero, David ^b   de la Clergerie, Eric ^a   Vilares, Manuel ^b  

^a INRIA   (France)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM UP; PREDICTIVE ALGORITHMS; SIMPLE++; TREE ADJOINING GRAMMARS;

COMPUTATIONAL GRAMMARS;

EID: 2942674038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Eric de la Clergerie and Miguel A. Alonso. 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, August. ACL.
2. Eric de la Clergerie, Miguel A. Alonso, and David Cabrero. 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, August.
3. 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.
4. Mark-Jan Nederhof. 1997. Solving the correct-prefix property for TAGs. In T. Becker and H.-V. Krieger, editors, Proc. of the Fifth Meeting on Mathematics of Language, pages 124-130, Schloss Dagstuhl, Saarbruecken, Germany, August.
5. 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.
6. Yves Schabes and Aravind K. Joshi. 1988. An Earley-type parsing algorithm for tree adjoining grammars. In Proc. of 26th Annual Meeting of the Association for Computational Linguistics, pages 258-269, Buffalo, NY, USA, June. ACL.
7. Yves Schabes and Stuart M. Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics, 20(1):91-124.
8. Yves Schabes. 1991. The valid prefix property and left to right parsing of tree-adjoining grammar. In Proc. of II International Workshop on Parsing Technologies, IWPT91, pages 21-30, Cancun, Mexico.
9. Yves Schabes. 1994. Left to right parsing of lexicalized tree-adjoining grammars. Computational Intelligence, 10(4):506-515.
10. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(l&2):3-36, July-August.
11. Klaas Sikkel. 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.
12. Krishnamurti Vijay-Shanker and Aravind K. Joshi. 1985. Some computational properties of tree adjoining grammars. In 23rd Annual Meeting of the Association for Computational Linguistics, pages 82-93, Chicago, IL, USA, July. ACL.
13. Krishnamurti Vijay-Shanker and David J. Weir. 1993. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591-636.
14. Krishnamurti Vijay-Shanker, David J. Weir, and Aravind K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proc. of the 25th Annual Meeting of the Association for Computational Linguistics, pages 104-111, Buffalo, NY, USA, June. ACL.