Yet Another 0(n⁶) Recognition Algorithm for Mildly Context-Sensitive Languages
Pierre
Boullier
author
1995-sep 20-24
text
Proceedings of the Fourth International Workshop on Parsing Technologies
Eva
Hajicova
editor
Bernard
Lang
editor
Robert
Berwick
editor
Harry
Bunt
editor
Bob
Carpenter
editor
Ken
Church
editor
Aravind
Joshi
editor
Ronald
Kaplan
editor
Martin
Kay
editor
Makoto
Nagao
editor
Anton
Nijholt
editor
Mark
Steedman
editor
Henry
Thompson
editor
Masaru
Tomita
editor
K
Vijay-Shanker
editor
Yorick
Wilks
editor
Kent
Wittenburg
editor
Association for Computational Linguistics
Prague and Karlovy Vary, Czech Republic
conference publication
Vijay-Shanker and Weir have shown in [17] that Tree Adjoining Grammars and Combinatory Categorial Grammars can be transformed into equivalent Linear Indexed Grammars (LIGs) which can be recognized in 0(n⁶) time using a Cocke-Kasami-Younger style algorithm. This paper exhibits another recognition algorithm for LIGs, with the same upper-bound complexity, but whose average case behaves much better. This algorithm works in two steps: first a general context-free parsing algorithm (using the underlying context-free grammar) builds a shared parse forest, and second, the LIG properties are checked on this forest. This check is based upon the composition of simple relations and does not require any computation of symbol stacks.
boullier-1995-yet
https://aclanthology.org/1995.iwpt-1.7
1995-sep 20-24
34
47