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.
| Original language | English |
|---|---|
| Pages (from-to) | 263-270 |
| Number of pages | 8 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1994-June |
| State | Published - 1994 |
| Event | 32nd Annual Meeting of the Association for Computational Linguistics, ACL 1994 - Las Cruces, United States Duration: Jun 27 1994 → Jun 30 1994 |
Fingerprint
Dive into the research topics of 'Multiset-valued linear index grammars: Imposing dominance constraints on derivations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver