Title :
The normalized string editing problem revisited
Author :
Oommen, B.J. ; Zhang, K.
Author_Institution :
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
fDate :
6/1/1996 12:00:00 AM
Abstract :
Marzal and Vidal (1993) 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 the authors demonstrate how this measure is related to an auxiliary measure already defined in the literature-the inter-string constrained edit distance. Since the normalized edit distance can be computed efficiently using the latter, the analytic and experimental results reported in the above paper can be obtained just as accurately, but more efficiently, using the strategies presented here
Keywords :
dynamic programming; pattern recognition; string matching; inter-string constrained edit distance; normalized edit distance; normalized string editing problem; Application software; Biology computing; Character recognition; Computer science; Machine intelligence; Particle measurements; Pattern recognition;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on