Dynamic phrase tables for machine translation in an interactive post-editing scenario

Ulrich Germann


Abstract
This paper presents a phrase table implementation for the Moses system that computes phrase table entries for phrase-based statistical machine translation (PBSMT) on demand by sampling an indexed bitext. While this approach has been used for years in hierarchical phrase-based translation, the PBSMT community has been slow to adopt this paradigm, due to concerns that this would be slow and lead to lower translation quality. The experiments conducted in the course of this work provide evidence to the contrary: without loss in translation quality, the sampling phrase table ranks second out of four in terms of speed, being slightly slower than hash table look-up (Junczys-Dowmunt, 2012) and considerably faster than current implementations of the approach suggested by Zens and Ney (2007). In addition, the underlying parallel corpus can be updated in real time, so that professionally produced translations can be used to improve the quality of the machine translation engine immediately.
Anthology ID:
2014.amta-workshop.3
Volume:
Workshop on interactive and adaptive machine translation
Month:
October 22
Year:
2014
Address:
Vancouver, Canada
Editors:
Francisco Casacuberta, Marcello Federico, Philipp Koehn
Venue:
AMTA
SIG:
Publisher:
Association for Machine Translation in the Americas
Note:
Pages:
20–31
Language:
URL:
https://aclanthology.org/2014.amta-workshop.3
DOI:
Bibkey:
Cite (ACL):
Ulrich Germann. 2014. Dynamic phrase tables for machine translation in an interactive post-editing scenario. In Workshop on interactive and adaptive machine translation, pages 20–31, Vancouver, Canada. Association for Machine Translation in the Americas.
Cite (Informal):
Dynamic phrase tables for machine translation in an interactive post-editing scenario (Germann, AMTA 2014)
Copy Citation:
PDF:
https://aclanthology.org/2014.amta-workshop.3.pdf