Tuning as ranking (2011)
| Venue: | In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing |
| Citations: | 9 - 0 self |
BibTeX
@INPROCEEDINGS{Hopkins11tuningas,
author = {Mark Hopkins and Jonathan May},
title = {Tuning as ranking},
booktitle = {In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing},
year = {2011}
}
OpenURL
Abstract
We offer a simple, effective, and scalable method for statistical machine translation parameter tuning based on the pairwise approach to ranking (Herbrich et al., 1999). Unlike the popular MERT algorithm (Och, 2003), our pairwise ranking optimization (PRO) method is not limited to a handful of parameters and can easily handle systems with thousands of features. Moreover, unlike recent approaches built upon the MIRA algorithm of Crammer and Singer (2003) (Watanabe et al., 2007; Chiang et al., 2008b), PRO is easy to implement. It uses off-the-shelf linear binary classifier software and can be built on top of an existing MERT framework in a matter of hours. We establish PRO’s scalability and effectiveness by comparing it to MERT and MIRA and demonstrate parity on both phrase-based and syntax-based systems in a variety of language pairs, using large scale data scenarios. 1







