An alternative conception of tree-adjoining derivation

Authors:
Yves Schabes;Stuart M. Shieber
Affiliations:
Mitsubishi Electric Research Laboratory;Harvard University
Venue:
Computational Linguistics
Year:
1994

Citing 10
Cited 24

Constraint-based grammar formalisms: parsing and type inference for natural and computer languages

Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
A study of tree adjoining grammars

A study of tree adjoining grammars
Some computational properties of Tree Adjoining Grammars

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Lexicalized context-free grammars

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Using lexicalized tags for machine translation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Feature structures based Tree Adjoining Grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Stochastic lexicalized tree-adjoining grammars

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2

Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Computational Linguistics
A note on the strong and weak generative powers of formal systems

Theoretical Computer Science - Algebraic methods in language processing
D-tree substitution grammars

Computational Linguistics
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
A descriptive characterization of tree-adjoining languages: (project note)

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Restrictions on tree adjoining languages

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Another facet of LIG parsing

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A meta-level grammar: redefining synchronous TAG for translation and paraphrase

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Preserving semantic dependencies in synchronous Tree Adjoining Grammar

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Generation as dependency parsing

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Statistical parsing with an automatically-extracted tree adjoining grammar

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes

Computational Linguistics
Two statistical parsing models applied to the Chinese Treebank

CLPW '00 Proceedings of the second workshop on Chinese language processing: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 12
Relating tabular parsing algorithms for LIG and TAG

New developments in parsing technology
Automated extraction of Tree-Adjoining Grammars from treebanks

Natural Language Engineering
MICA: a probabilistic dependency parser based on tree insertion grammars application note

NAACL-Short '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers
Extraction phenomena in synchronous TAG syntax and semantics

SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
The hidden TAG model: synchronous grammars for parsing resource-poor languages

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Exploration of the LTAG-spinal formalism and Treebank for semantic role labeling

GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar

Computational Linguistics
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete

Journal of Logic, Language and Information
How to build argumental graphs using TAG shared forest: a view from control verbs problematic

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that the definition of tree-adjoining derivation must be reformulated in order to manifest the proper linguistic dependencies in derivations. The particular proposal is both precisely characterizable through a definition of TAG derivations as equivalence classes of ordered derivation trees, and computationally operational, by virtue of a compilation to linear indexed grammars together with an efficient algorithm for recognition and parsing according to the compiled grammar.