Skip to content
Publications

Talk · International Workshop/Conference on Parsing Technologies · April 1, 2003

Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions

Miguel Á. Alonso, Víctor J. Díaz

Abstract

A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsing algorithm managing simultaneous adjunctions in TAG and TIG.

Natural Language Processing Techniquessemigroups and automata theorySyntax, Semantics, Linguistic Variationtree adjoining grammarsparsing algorithmscomputational complexity reduction

More by Miguel Alonso