Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, approximate string matching is the technique of finding approximate matches to a pattern in a string. The closeness of a match is measured in terms of the number of primitive operations necessary to convert the string into an exact match. This number is called the edit distance between the string and the pattern. The usual primitive operations are: insertion: cot -> coat, deletion: coat -> cot, substitution: coat -> cost

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.