DMCA
Optimizing for sentence-level BLEU+1 yields short translations (2012)
| Venue: | in Proceedings of the 24th International Conference on Computational Linguistics, ser. COLING ’12 |
| Citations: | 21 - 9 self |
BibTeX
@INPROCEEDINGS{Nakov12optimizingfor,
author = {Preslav Nakov and Stephan Vogel},
title = {Optimizing for sentence-level BLEU+1 yields short translations},
booktitle = {in Proceedings of the 24th International Conference on Computational Linguistics, ser. COLING ’12},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study a problem with pairwise ranking optimization (PRO): that it tends to yield too short translations. We find that this is partially due to the inadequate smoothing in PRO’s BLEU+1, which boosts the precision component of BLEU but leaves the brevity penalty unchanged, thus destroying the balance between the two, compared to BLEU. It is also partially due to PRO optimizing for a sentence-level score without a global view on the overall length, which introducing a bias towards short translations; we show that letting PRO optimize a corpus-level BLEU yields a perfect length. Finally, we find some residual bias due to the interaction of PRO with BLEU+1: such a bias does not exist for a version of MIRA with sentence-level BLEU+1. We propose several ways to fix the length problem of PRO, including smoothing the brevity penalty, scaling the effective reference length, grounding the precision component, and unclipping the brevity penalty, which yield sizable improvements in test BLEU on two Arabic-English datasets: IWSLT (+0.65) and NIST (+0.37).
