Multi-level similar segment matching algorithm for translation memories and Example-based Machine Translation

Authors:
Emmanuel Planas;Osamu Furuse
Affiliations:
Cyber Solutions Laboratories, Kyoto, Japan;Cyber Solutions Laboratories, Kyoto, Japan
Venue:
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Year:
2000

Citing 4
Cited 4

The String-to-String Correction Problem

Journal of the ACM (JACM)
A program for aligning sentences in bilingual corpora

Computational Linguistics - Special issue on using large corpora: I
Example retrieval from a translation memory

Natural Language Engineering
Solving analogies on words: an algorithm

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1

Using comparable corpora to solve problems difficult for human translators

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
EXTRA: a system for example-based translation assistance

Machine Translation
ASSIST: automated semantic assistance for translators

EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
An effective approach for searching closest sentence translations from the web

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

@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.