Improving Arabic neural machine translation via n-best list
re-ranking

Hadj Ameur, MS; Guessoum, A; Meziane, F

Abstract

Even though the rise of the Neural Machine Translation (NMT) paradigm has brought a great deal of improvement to the machine translation field, the current translation results are still not perfect. One of the main reasons for this imperfection is the decoding task complexity. Indeed, the problem of finding the one best translation from the space of all possible translations was and still is a challenging problem. One of the most successful ways to address it is via n-best list re-ranking which attempts to reorder the n-best decoder translations according to some defined features. In this paper, we propose a set of new re-ranking features that can be extracted directly from the parallel corpus without needing any external tools. The features set that we propose takes into account lexical, syntactic, and even semantic aspects of the n-best list translations. We also present a method for feature weights optimization that uses a Quantum-behaved Particle Swarm Optimization (QPSO) algorithm. Our system has been evaluated on multiple English-to-Arabic and Arabic-to-English machine translation test sets, and the obtained re-ranking results yield noticeable improvements over the baseline NMT systems.

Citation

re-ranking. Machine Translation, 33, 279-314. https://doi.org/10.1007/s10590-019-09237-6

• Journal Article Type: Article
• Acceptance Date: Aug 7, 2019
• Online Publication Date: Aug 26, 2019
• Publication Date: Dec 1, 2019
• Deposit Date: Jul 12, 2019
• Publicly Available Date: Aug 26, 2020
• Journal: Machine Translation
• Print ISSN: 0922-6567
• Electronic ISSN: 1573-0573
• Publisher: Springer Verlag
• Volume: 33
• Pages: 279-314
• DOI: https://doi.org/10.1007/s10590-019-09237-6
• Publisher URL: https://doi.org/10.1007/s10590-019-09237-6
• Related Public URLs: https://link.springer.com/journal/10590
• Additional Information: Access Information : This is a post-peer-review, pre-copyedit version of an article published in Machine Translation. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10590-019-09237-6