edit distance

Appears in 8 sentences as: edit distance (8)

In Refinements to Interactive Translation Prediction Based on Search Graphs

If the user prefix cannot be found in the search graph, approximate string matching is used by finding a path with minimal string edit distance , i.e., a path in the graph with the minimal number of insertions, deletions and substitutions to match the user prefix.

Page 1, “Introduction”

Cost is measured primarily in terms of string edit distance (number of deletions, insertions and substitutions), and secondary in terms of translation model score for the matched path in the graph.

Page 1, “Properties of Core Algorithm”

ms 5 1015 20 25 30 35 40pX Figure 1: Average response time of baseline method based on length of the prefix and number of edits: The main bottleneck is the string edit distance between prefix and path.

Page 2, “Properties of Core Algorithm”

the length of the user prefix and the string edit distance between the user prefix and the search graph.

Page 2, “Properties of Core Algorithm”

To guarantee a response in 100ms, the algorithms aborts when this time is exceeded and relies on a prediction based on string edit distance against the best path in the graph.

Page 2, “Properties of Core Algorithm”

We attempt to find the last word in the predicted path either before or after the optimal matching position according to string edit distance .