Paper: Ordering Prenominal Modifiers with a Reranking Approach

ACL ID P11-1111
Title Ordering Prenominal Modifiers with a Reranking Approach
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2011
Authors

In this work, we present a novel approach to the generation task of ordering prenomi- nal modifiers. We take a maximum entropy reranking approach to the problem which ad- mits arbitrary features on a permutation of modifiers,exploitinghundredsofthousandsof featuresintotal. Wecompareourerrorratesto the state-of-the-art and to a strong Google n- gram count baseline. We attain a maximum error reduction of 69.8% and average error re- duction across all test sets of 59.1% compared tothestate-of-the-artandamaximumerrorre- duction of 68.4% and average error reduction across all test sets of 41.8% compared to our Google n-gram count baseline.