Autors:

CiteWeb id: 19740000054

CiteWeb score: 3449

DOI: 10.1145/321796.321811

The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string. An algorithm is presented which solves this problem in time proportional to the product of the lengths of the two strings. Possible applications are to the problems of automatic spelling correction and determining the longest subsequence of characters common to two strings.

The publication "The String-to-String Correction Problem" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Mathematics it is included to the Top 1000. Additionally, the publicaiton "The String-to-String Correction Problem" is placed in the Top 100 among other scientific works published in 1974.
Links to full text of the publication: