THE NORMALIZED STRING EDITING PROBLEM REVISITED

Marzal and Vidal [8] recently considered the problem of computing the normalized edit distance between two strings, and reported experimenta l 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 sho rt communication we shall demonstrate how this measure is related to a n 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 a nd experimental results reported in [8] can be obtained just as accura tely, but more efficiently, using the strategies presented here.