Skip to content
Publications

Talk · International Workshop/Conference on Parsing Technologies · October 1, 2001

Bidirectional Automata for Tree Adjoining Grammars

Miguel Á. Alonso, Víctor J. Díaz, Manuel Vilares Ferro

Abstract

We de ne 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.

semigroups and automata theoryNatural Language Processing TechniquesSyntax, Semantics, Linguistic Variationtree adjoining grammarsparsing strategiesautomata models

More by Miguel Alonso