New Tabular Algorithms for Parsing

Miguel A. Alonso, Jorge Graña, Manuel Vilares, Eric de la Clergerie


Abstract
We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.
Anthology ID:
2000.iwpt-1.6
Volume:
Proceedings of the Sixth International Workshop on Parsing Technologies
Month:
February 23-25
Year:
2000
Address:
Trento, Italy
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
29–40
Language:
URL:
https://aclanthology.org/2000.iwpt-1.6
DOI:
Bibkey:
Cite (ACL):
Miguel A. Alonso, Jorge Graña, Manuel Vilares, and Eric de la Clergerie. 2000. New Tabular Algorithms for Parsing. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 29–40, Trento, Italy. Association for Computational Linguistics.
Cite (Informal):
New Tabular Algorithms for Parsing (Alonso et al., IWPT 2000)
Copy Citation:
PDF:
https://preview.aclanthology.org/starsem-semeval-split/2000.iwpt-1.6.pdf