D-tree grammars

Authors:
Owen Rambow;K. Vijay-Shanker;David Weir
Affiliations:
CoGen Tex, Inc., Ithaca, NY;University of Delaware, Newark, DE;University of Sussex, Brighton, UK.
Venue:
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Year:
1995

Citing 8
Cited 36

Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives

Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
Formal and computational aspects of natural language syntax

Formal and computational aspects of natural language syntax
A study of tree adjoining grammars

A study of tree adjoining grammars
An alternative conception of tree-adjoining derivation

Computational Linguistics
Long-distance scrambling and tree adjoining grammars

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Compilation of HPSG to TAG

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics

An efficient algorithm for the configuration problem of dominance graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Talking about Trees and Truth-Conditions

Journal of Logic, Language and Information
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Dominance constraints with Boolean connectives: a model-eliminative treatment

Theoretical Computer Science - Algebraic methods in language processing
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Dominance Constraints with Set Operators

CL '00 Proceedings of the First International Conference on Computational Logic
D-tree substitution grammars

Computational Linguistics
A lightweight dependency analyzer for partial parsing

Natural Language Engineering
Parsing with an extended domain of locality

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Compilation of HPSG to TAG

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Synchronous models of language

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On underspecified processing of dynamic semantics

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Interaction Grammars

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
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
An Earley-style predictive chart parsing method for Lambek grammars

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Facilitating treebank annotation using a statistical parser

HLT '01 Proceedings of the first international conference on Human language technology research
Recovering latent information in treebanks

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Underspecified beta reduction

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Constraints on strong generative power

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generating with a grammar based on tree descriptions: a constraint-based approach

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Computational properties of environment-based disambiguation

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Using model-theoretic semantic interpretation to guide statistical parsing and word recognition in a spoken language interface

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A polynomial-time fragment of dominance constraints

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Multi-component TAG and notions of formal power

ACL '00 Proceedings of the 38th 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
Lexicalized grammar 101

ETMTNLP '02 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1
Automated extraction of Tree-Adjoining Grammars from treebanks

Natural Language Engineering
Associative Grammar Combination Operators for Tree-Based Grammars

Journal of Logic, Language and Information
Deductive parsing with interaction grammars

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Non-projective parsing for statistical machine translation

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
String-to-dependency statistical machine translation

Computational Linguistics
Mildly non-projective dependency grammar

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for wh-movement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.