Ranking search results for translated content

Authors:
B. Hawkins;C. Giraud-Carrier
Affiliations:
Lingotek, Inc., Draper, UT;Brigham Young University, Provo, UT
Venue:
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Year:
2009

Citing 9
Cited 0

String searching algorithms

String searching algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem

Journal of the ACM (JACM)
A fast string searching algorithm

Communications of the ACM
A vector space model for automatic indexing

Communications of the ACM
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Modern Information Retrieval

Modern Information Retrieval
Dynamic Programming

Dynamic Programming
Example-based machine translation using DP-matching between word sequences

DMMT '01 Proceedings of the workshop on Data-driven methods in machine translation - Volume 14

Quantified Score

Hi-index	0.00

Visualization

Abstract

Translation Memory (TM) consists of a collection of previously translated units of text that may prove useful in the translation of new text. The main problem faced by translators who wish to take advantage of TM is that, although search tools do exist, there is no standardized way of effectively ranking search results. This paper proposes a method for effectively ranking TM search results together with a novel approach to efficiently finding common substrings.