Skip to content
Publications

Article · January 1, 2002

A Predictive Left-Corner Parser for Tree Adjoining Grammars

Vicente Carrillo, Miguel Á. Alonso

Abstract

Tree Adjoining Grammar (TAG) is a formalism that has become very popular for the description of natural languages. However, the parsers for TAG that have been defined on the basis of the Earley's algorithm entail important computational costs. In this article, we propose to extend the left corner relation from Context Free Grammar (CFG) to TAG in order to define an e#cient left corner parser for TAG that improves the performance of the Earley-like parsers guaranteeing the valid prefix property, due to a remarkable reduction in the number of predictions operations with respect to Earley-like parsing algorithms.

Natural Language Processing Techniquessemigroups and automata theorySyntax, Semantics, Linguistic Variationtree adjoining grammarsleft-corner parsingEarley algorithm

More by Miguel Alonso