A compact data structure for searchable translation memories
Chris Callison-Burch, Colin Bannard, Josh E. Schroeder · 2005
In this paper we describe searchable trans-lation memories, which allow translators to search their archives for possible trans-lations of phrases. We describe how sta-tistical machine translation can be used to align subsentential units in a translation memory, and rank them by their proba-bility. We detail a data structure that al-lows for memory-efficient storage of the index. We evaluate the accuracy of trans-lations retrieved from a searchable trans-lation memory built from 50,000 sentence pairs, and find a precision of 86.6 % for the top ranked translations. 1