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.

Additional Metadata
Keywords Levenshtein distance, Normalized string distances, Sequence processing, String editing
Persistent URL dx.doi.org/10.1109/34.506420
Journal IEEE Transactions on Pattern Analysis and Machine Intelligence
Citation
Oommen, J, & Zhang, K. (K.). (1996). The normalized string editing problem revisited. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(6), 669–672. doi:10.1109/34.506420