Parsing preferences with lexicalized tree adjoining grammars: Exploiting the derivation tree

ISSN: 0736587X
0Citations
Citations of this article
69Readers
Mendeley users who have this article in their library.

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...).

Cite

CITATION STYLE

APA

Kinyon, A. (1999). Parsing preferences with lexicalized tree adjoining grammars: Exploiting the derivation tree. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1999-June, pp. 585–590). Association for Computational Linguistics (ACL).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free