Showing papers on "Edit distance published in 1981"

TL;DR: Using dynamic programming principles, an algorithm is presented which yields X+ without computing individually the distances between every word of H and Y, and it can be shown that it is, in general, computationally less complex than all other existing algorithms which perform the same task.

TL;DR: This paper deals with the problem of estimating an unknown transmitted string Xs belonging to a finite dictionary H from its observable noisy version Y, and develops an algorithm to find the string X+H which minimizes the generalized Levenshtein distance D(XY).