e/String-to-string correction problem

Information
has gloss	eng: The string-to-string correction problem refers to the minimum number of edit operations necessary to change one string into another. A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings.
lexicalization	eng: string-to-string correction problem
instance of	c/Algorithms on strings