Mixed Parsing of Tree Insertion and Tree Adjoining Grammars

Authors:
Miguel A. Alonso;Vicente Carrillo;Víctor J. Díaz
Affiliations:
-;-;-
Venue:
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2002

Citing 6
Cited 0

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
The computational complexity of the correct-prefix property for TAGs

Computational Linguistics
Tabular algorithms for TAG parsing

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
XTAG system: a wide coverage grammar for English

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Refining tabular parsers for TAGs

NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction defined for Tree Insertion Grammar. In this paper, we describe a parsing algorithm that makes use of this characteristic to reduce the practical complexity of TAG parsing: the expensive standard adjunction operation is only considered in those cases in which the simpler cubic-time adjunction cannot be applied.