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

2.50
Hdl Handle:
http://hdl.handle.net/2436/620374
Title:
A Dynamic Programming Approach to Improving Translation Memory Matching and Retrieval Using Paraphrases
Authors:
Gupta, Rohit; Orăsan, Constantin ( 0000-0003-2067-8890 ) ; Liu, Qun; Mitkov, Ruslan
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
Citation:
In: Petr Sojka, Aleš Horák, Ivan Kopeček, Karel Pala (eds), Text, Speech, and Dialogue: olume 9924 of the series Lecture Notes in Computer Science pp 259-269
Publisher:
Springer
Issue Date:
Sep-2016
URI:
http://hdl.handle.net/2436/620374
Additional Links:
http://link.springer.com/chapter/10.1007%2F978-3-319-45510-5_30
Type:
Book chapter
Language:
en
ISBN:
9783319455099; 9783319455105 on-line
Sponsors:
FP7/2007-2013/ under REA grant agreement no. 317471, Funded by: FP7 People Programme
Appears in Collections:
FOSS

Full metadata record

DC FieldValue Language
dc.contributor.authorGupta, Rohiten
dc.contributor.authorOrăsan, Constantinen
dc.contributor.authorLiu, Qunen
dc.contributor.authorMitkov, Ruslanen
dc.date.accessioned2017-02-13T15:11:53Z-
dc.date.available2017-02-13T15:11:53Z-
dc.date.issued2016-09-
dc.identifier.citationIn: Petr Sojka, Aleš Horák, Ivan Kopeček, Karel Pala (eds), Text, Speech, and Dialogue: olume 9924 of the series Lecture Notes in Computer Science pp 259-269en
dc.identifier.isbn9783319455099-
dc.identifier.isbn9783319455105 on-line-
dc.identifier.urihttp://hdl.handle.net/2436/620374-
dc.description.abstractTranslation 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 approachen
dc.description.sponsorshipFP7/2007-2013/ under REA grant agreement no. 317471, Funded by: FP7 People Programmeen
dc.language.isoenen
dc.publisherSpringeren
dc.relation.urlhttp://link.springer.com/chapter/10.1007%2F978-3-319-45510-5_30en
dc.subjecttranslation memoriesen
dc.subjectmachine translationen
dc.subjectsemantically enhanced translation memoriesen
dc.subjectparaphrasingen
dc.titleA Dynamic Programming Approach to Improving Translation Memory Matching and Retrieval Using Paraphrasesen
dc.typeBook chapteren
All Items in WIRE are protected by copyright, with all rights reserved, unless otherwise indicated.