Translation memory tools lack semantic knowledge like paraphrasing when they perform matching and retrieval. As a result, paraphrased segments are often not retrieved. One of the primary reasons
for this is the lack of a simple and efficient algorithm to incorporate
paraphrasing in the TM matching process. Gupta and Or˘asan [1] proposed an algorithm which incorporates paraphrasing based on greedy
approximation and dynamic programming. However, because of greedy
approximation, their approach does not make full use of the paraphrases
available. In this paper we propose an efficient method for incorporating
paraphrasing in matching and retrieval based on dynamic programming
only. We tested our approach on English-German, English-Spanish and
English-French language pairs and retrieved better results for all three
language pairs compared to the earlier approach
Metadata
Item Type:
Conference or Workshop Item (Paper)
Event Type:
Conference
Refereed:
Yes
Uncontrolled Keywords:
Edit distance with paraphrasing; Translation memory; TM matching and retrieval; Computer aided translation; Paraphrasing