Skip to content
Publications

Talk · Conference of the European Chapter of the Association for Computational Linguistics · January 1, 1999

Tabular algorithms for TAG parsing

Miguel Á. Alonso, Éric Villemonte de la Clergerie, David Cabrero, Jesús Vilares

Abstract

We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.

Natural Language Processing Techniquessemigroups and automata theorySyntax, Semantics, Linguistic Variationtree adjoining grammarssyntactic analysisbottom-up parsing

More by Miguel Alonso