The Community for Technology Leaders
Green Image
Issue No. 09 - September (1993 vol. 15)
ISSN: 0162-8828
pp: 926-932
<p>Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d(X,Y) is defined as the minimum of W(P)/L(P), where P is an editing path between X and Y, W(P) is the sum of the weights of the elementary edit operations of P, and L(P) is the number of these operations (length of P). It is shown that in general, d(X,Y) cannot be computed by first obtaining the conventional (unnormalized) edit distance between X and Y and then normalizing this value by the length of the corresponding editing path. In order to compute normalized edit distances, an algorithm that can be implemented to work in O(m*n/sup 2/) time and O(n/sup 2/) memory space is proposed, where m and n are the lengths of the strings under consideration. Experiments in hand-written digit recognition are presented, revealing that the normalized edit distance consistently provides better results than both unnormalized or post-normalized classical edit distances.</p>
character strings; words; normalized edit distance; finite alphabet; hand-written digit recognition; computational complexity; pattern recognition
E. Vidal, A. Marzal, "Computation of Normalized Edit Distance and Applications", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 926-932, September 1993, doi:10.1109/34.232078
90 ms
(Ver 3.3 (11022016))