Multiset-valued linear index grammars: imposing dominance constraints on derivations

Authors:
Owen Rambow
Affiliations:
Univesité Paris, Paris, France
Venue:
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Year:
1994

Citing 9
Cited 8

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
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
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
New frontiers beyond context-freeness: DI-grammars and DI-automata

EACL '93 Proceedings of the sixth conference on European chapter of the Association for 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
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A CCG approach to free word order languages

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics

D-tree substitution grammars

Computational Linguistics
D-tree grammars

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 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
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes

Computational Linguistics
The reachability problem for branching vector addition systems requires doubly-exponential space

Information Processing Letters
On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
The covering and boundedness problems for branching vector addition systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multiset-valued feature structures in unification-based formalisms, while the latter is motivated by word order variation and by "quasi-trees", a generalization of trees. The two formalisms are weakly equivalent, and an important subset is at most context-sensitive and polynomially parsable.