Yet Another ${\cal O}(n^6)$ Recognition Algorithm for Mildly Context-Sensitive Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Yet Another ${\cal O}(n^6)$ Recognition Algorithm for Mildly Context-Sensitive Languages

Abstract

Vijay-Shanker and Weir have shown in \cite{VSW94} that Tree Adjoining Grammars and Combinatory Categorial Grammars can be transformed into equivalent Linear Indexed Grammars (LIGs) which can be recognized in ${\cal O}(n^6)$ 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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2730.pdf (371.16 Ko) Télécharger le fichier

Dates and versions

inria-00073964 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073964 , version 1

Cite

Pierre Boullier. Yet Another ${\cal O}(n^6)$ Recognition Algorithm for Mildly Context-Sensitive Languages. [Research Report] RR-2730, INRIA. 1995. ⟨inria-00073964⟩
35 View
38 Download

Share

Gmail Facebook Twitter LinkedIn More