Multi-level similar segment matching algorithm for translation memories and Example-based Machine Translation
Emmanuel Planas, Osamu Furuse · 2000
@We propose a dynamic programming algorithm for calculating the similarity between two segments of words of the same language. The similarity is considered as a vector whose coordinates refer to the levels of analysis of the segments. This algorithm is extremely efficient for retrieving the best example in Translation Memory systems. The calculus being constructive, it also gives the correspondences between the words of the two segments. This allows the extension of Translation Memory systems towards Example-based Machine Translation.