This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Normalized String Editing Problem Revisited
June 1996 (vol. 18 no. 6)
pp. 669-672

Abstract—Marzal and Vidal [8] recently considered the problem of computing the normalized edit distance between two strings, and reported experimental results which demonstrated the use of the measure to recognize hand-written characters. Their paper formulated the theoretical properties of the measure and developed two algorithms to compute it. In this short communication we shall demonstrate how this measure is related to an auxiliary measure already defined in the literature—the inter-string constrained edit distance[10], [11], [15]. Since the normalized edit distance can be computed efficiently using the latter, the analytic and experimental results reported in [8] can be obtained just as accurately, but more efficiently, using the strategies presented here.

[1] P.A.V. Hall and G.R. Dowling, "Approximate String Matching," Computing Surveys, vol. 12, no. 4, pp. 381-402, 1980.
[2] D.S. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. Assoc. Comput. Mach., vol. 18, pp. 341-343, 1975.
[3] R.L. Kashyap and B.J. Oommen, "A Common Basis for Similarity and Dissimilarity Measures Involving Two Strings," Int'l J. Comput. Math., vol. 13, pp. 17-40, 1983.
[4] R.L. Kashyap and B.J. Oommen, "An Effective Algorithm for String Correction Using Generalized Edit Distances—I. Description of the Algorithm and Its Optimality," Inform. Sci., vol. 23, no. 2, pp. 123-142, 1981.
[5] R.L. Kashyap and B.J. Oommen, "The Noisy Substring Matching Problem," IEEE Trans. Software Engineering, vol. 9, pp. 365-370, 1983.
[6] K. Kukich, “Techniques for Automatically Correcting Words in Text,” ACM Computing Surveys, vol. 24, no. 4, pp. 377-439, 1992.
[7] A. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions and Reversals," Soviet Phys. Dokl., vol. 10, pp. 707-710, 1966.
[8] A. Marzal and E. Vidal, "Computation of Normalized Edit Distance and Applications," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 15, pp. 926-932, 1993.
[9] W.J. Masek and M.S. Paterson, "A Faster Algorithm Computing String Edit Distances, J. Comput. System Sci., vol. 20, pp. 18-31, 1980.
[10] B.J. Oommen, “Constrained String Editing,” Information Science, vol. 40, pp. 267-284, 1986.
[11] B.J. Oommen, “Recognition of Noisy Subsequences Using Constrained Edit Distances,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 676-685, May 1987.
[12] J.L. Peterson, "Computer Programs for Detecting and Correcting Spelling Errors," Comm. Assoc. Comput. Mach., vol. 23, pp. 676-687, 1980.
[13] D. Sankoff and J.B. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.
[14] R.A. Wagner and M.J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-78, 1974.
[15] K. Zhang, "Constrained String and Tree Editing Distance," Proc. IASTED Int'l Symp. Machine Learning and Neural Networks, pp. 92-95, 1990.
[16] E. Vidal, A. Marzal, and P. Aibar, "Fast Computation of Normalized Edit Distance," to appear.
[17] N. Megiddo, "Applying Parallel Computation Algorithms in the Design of Serial Algorithms," J. ACM, vol. 30, pp. 852-865, 1983.

Index Terms:
Sequence processing, string editing, normalized string distances. Levenshtein Distance.
Citation:
B. J. Oommen, K. Zhang, "The Normalized String Editing Problem Revisited," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 669-672, June 1996, doi:10.1109/34.506420
Usage of this product signifies your acceptance of the Terms of Use.