Parsing preferences with lexicalized Tree Adjoining Grammars: exploiting the derivation tree

Authors:
Alexandra Kinyon
Affiliations:
TALANA Universite, Paris, Paris, France
Venue:
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Year:
1999

Citing 4
Cited 1

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

Syntactic locality and tree adjoining grammar: grammatical, acquisition and processing perspectives
Structural ambiguity and lexical relations

Computational Linguistics - Special issue on using large corpora: I
On parsing preferences

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
XTAG system: a wide coverage grammar for English

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2

Hypertags

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since Kimball (73) parsing preference principles such as "Right association" (RA) and "Minimal attachment" (MA) are often formulated with respect to constituent trees. We present 3 preference principles based on "derivation trees" within the framework of LTAGs. We argue they remedy some shortcomings of the former approaches and account for widely accepted heuristics (e.g. argument/modifier, idioms...).