Sciweavers

Share
IWPT
2001

Bidirectional Automata for Tree Adjoining Grammars

9 years 5 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution.
Miguel A. Alonso, Víctor J. Díaz, Ma
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IWPT
Authors Miguel A. Alonso, Víctor J. Díaz, Manuel Vilares Ferro
Comments (0)
books