Tabular algorithms for TAG parsing

Authors:
Miguel A. Alonso;Eric de la Clergerie;David Cabrero;Manuel Vilares
Affiliations:
Univesidad de La Coruña, La Coruñ, Spain;INRIA, Domaine de Voluceau, Le Chesnay, France;Univesidad de La Coruña, La Coruña, Spain;Univesided de La Coruña, La Coruña, Spain
Venue:
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Year:
1999

Citing 7
Cited 9

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing some constrained grammar formalisms

Computational Linguistics
An alternative conception of tree-adjoining derivation

Computational Linguistics
A tabular interpretation of a class of 2-Stack Automata

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Some computational properties of Tree Adjoining Grammars

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

Mixed Parsing of Tree Insertion and Tree Adjoining Grammars

IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Left Corner Parser for Tree Insertion Grammars

AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Relating tabular parsing algorithms for LIG and TAG

New developments in parsing technology
Extraction of complex index terms in non-English IR: A shallow parsing based approach

Information Processing and Management: an International Journal
Mining conceptual graphs for knowledge acquisition

Proceedings of the 2nd ACM workshop on Improving non english web searching
A compiler for parsing schemata

Software—Practice & Experience
Generating XTAG parsers from algebraic specifications

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Book review: parsing schemata for practical text analysis carlos gómez rodríguez (university of a coruña) london: Imperial college press (mathematics, computing, language, and life series, edited by carlos martin-vide, volume 1), 2010, xiv+275 pp; hardbound, isbn 978-1-84816-560-1, $89.00

Computational Linguistics
Dependency parsing schemata and mildly non-projective dependency parsing

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.