Translation memory retrieval methods
Michael Bloodgood and Benjamin Strauss. 2014. Translation memory retrieval methods. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, pages 202-210, Gothenburg, Sweden, April. Association for Computational Linguistics.
MetadataShow full item record
Translation Memory (TM) systems are one of the most widely used translation technologies. An important part of TM systems is the matching algorithm that determines what translations get retrieved from the bank of available translations to assist the human translator. Although detailed accounts of the matching algorithms used in commercial systems can’t be found in the literature, it is widely believed that edit distance algorithms are used. This paper investigates and evaluates the use of several matching algorithms, including the edit distance algorithm that is believed to be at the heart of most modern commercial TM systems. This paper presents results showing how well various matching algorithms correlate with human judgments of helpfulness (collected via crowdsourcing with Amazon’s Mechanical Turk). A new algorithm based on weighted n-gram precision that can be adjusted for translator length preferences consistently returns translations judged to be most helpful by translators for multiple domains and language pairs.
Showing items related by title, author, creator and subject.
Lopez, Adam David (2008-04-22)The best systems for machine translation of natural language are based on statistical models learned from data. Conventional representation of a statistical translation model requires substantial offline computation and ...
Translating English and Mandarin Verbs with Argument Structure (Mis)matches Using LCS Representation Olsen, Mari Broman (1998-10-15)This paper applies and evaluates a semi-automatically acquired Mandarin Chinese lexicon (Olsen, Dorr, and Thomas 1998) with respect to translation of English and Chinese verbs in a UNESCO text (Otero 1997). I demonstrate ...
Malekpour, Shirin Minoo (2004-06-24)We show the embedding provided by the Hahn Embedding Theorem of an ordered Abelian group into a lexicographic functions space is coinitiality preserving. From this we strengthen Hajek's Completeness theorem for predicate ...