A Dynamic Programming Approach to Improving Translation Memory Matching and Retrieval Using Paraphrases

  • Rohit Gupta
  • Constantin Orăsan
  • Qun Liu
  • Ruslan Mitkov
Conference paper

DOI: 10.1007/978-3-319-45510-5_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9924)
Cite this paper as:
Gupta R., Orăsan C., Liu Q., Mitkov R. (2016) A Dynamic Programming Approach to Improving Translation Memory Matching and Retrieval Using Paraphrases. In: Sojka P., Horák A., Kopeček I., Pala K. (eds) Text, Speech, and Dialogue. TSD 2016. Lecture Notes in Computer Science, vol 9924. Springer, Cham

Abstract

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ăsan [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 [1].

Keywords

Edit distance with paraphrasing Translation memory TM matching and retrieval Computer aided translation Paraphrasing 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Rohit Gupta
    • 1
  • Constantin Orăsan
    • 1
  • Qun Liu
    • 2
  • Ruslan Mitkov
    • 1
  1. 1.University of WolverhamptonWolverhamptonUK
  2. 2.Dublin City UniversityDublinIreland

Personalised recommendations