Searchable translation memories (2004)
| Venue: | In Proceedings of ASLIB Translation and the Computer 26 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Callison-burch04searchabletranslation,
author = {Chris Callison-burch and Colin Bannard and Josh Schroeder},
title = {Searchable translation memories},
booktitle = {In Proceedings of ASLIB Translation and the Computer 26},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we introduce a technique for creating searchable translation memories. Linear B’s searchable translation memories allow a translator to type in a phrase and retrieve a ranked list of possible translations for that phrase, which is ordered based on the likelihood of the translations. The searchable translation memories use translation models similar to those used in statistical machine translation. In this paper we first describe the technical details of how the TMs are indexed and how translations are assigned probabilities, and then evaluate a searchable TM using precision and recall metrics. 1
Citations
| 805 | A systematic comparison of various statistical alignment models - Och, Ney - 2003 |
| 135 | A phrase-based, joint probability model for statistical machine translation - Marcu, Wong - 2002 |
| 113 | The mathematics of Machine Translation: Parameter estimation - Brown, Pietra, et al. - 1993 |
| 28 | A projection extension algorithm for statistical machine translation - Tillmann - 2003 |
| 25 | Translation Engines: Techniques for Machine Translation - Trujillo - 1999 |
