Issue No. 09 - September (1995 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.406656
<p><it>Abstract</it>—The Normalized Edit Distance (NED) between two strings <it>X</it> and <it>Y</it> is defined as the minimum quotient between the sum of weights of the edit operations required to transform <it>X</it> into <it>Y</it> and the length of the editing path corresponding to these operations. An algorithm for computing the NED has recently been introduced by Marzal and Vidal that exhibits <it>O</it>(<it>mn</it><super>2</super>) computing complexity, where <it>m</it> and <it>n</it> are the lengths of <it>X</it> and <it>Y</it>. We propose here an algorithm that is observed to require in practice the same <it>O</it>(<it>mn</it>) computing resources as the conventional unnormalized Edit Distance algorithm does. The performance of this algorithm is illustrated through computational experiments with synthetic data, as well as with real data consisting of OCR chain-coded strings.</p>
Normalized edit distance, Levenshtein distance, pattern recognition, string correction, editing, spelling correction, optical character recognition, speech recognition, fractional programming, fast algorithms.
A. Marzal, P. Aibar and E. Vidal, "Fast Computation of Normalized Edit Distances," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 17, no. , pp. 899-902, 1995.