Skip to content
Publications

Talk · International Workshop/Conference on Parsing Technologies · February 23, 2000

New Tabular Algorithms for Parsing.

Miguel Á. Alonso, Jorge Graña, Jesús Vilares, Éric Villemonte de la Clergerie

Abstract

We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.

semigroups and automata theoryNatural Language Processing TechniquesSyntax, Semantics, Linguistic Variationbottom-up parsingcontext-free grammarsparsing algorithms

More by Miguel Alonso