Relating tabular parsing algorithms for LIG and TAG

Authors:
Miguel A. Alonso;Éric de la Clergerie;Víctor J. Díaz;Manuel Vilares
Affiliations:
Departamento de Computación, Facultad de Informática, Universidad de La Coruña, La Coruña, Spain;INRIA, Domaine de Voluceau, Rocquencourt, Le Chesnay, France;Departamento de Lenguajes y Sistemas Informáticos, E.T.S. de Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain;Departamento de Informática, Escuela Superior de Ingeniería Informática, Universidad de Vigo, Orense, Spain
Venue:
New developments in parsing technology
Year:
2004

Citing 9
Cited 2

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing some constrained grammar formalisms

Computational Linguistics
An alternative conception of tree-adjoining derivation

Computational Linguistics
The computational complexity of the correct-prefix property for TAGs

Computational Linguistics
Tabular algorithms for TAG parsing

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A tabular interpretation of a class of 2-Stack Automata

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Refining tabular parsers for TAGs

NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies

A compiler for parsing schemata

Software—Practice & Experience
Large scale semantic construction for tree adjoining grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.