High Quality Content by WIKIPEDIA articles! In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two characters. In his seminal paper, Damerau not only distinguished these four edit operations but also stated that they correspond to more than 80% of all human misspellings. Damerau's paper considered only misspellings that could be corrected with at most one edit operation. Edit distance was introduced by Levenshtein, who generalized this concept with multiple edit operations, but did not include transpositions in the set of basic operations. The name Damerau–Levenshtein distance is used to refer to an edit distance that allows multiple edit operations including transpositions.

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