Lines Matching full:string1
9 * deleted from, or added to string1, at least, to get string2.
17 * string1 that the distance is calculated for.
20 * of string1 of length "i"), and row0 the row before that.
23 * Damerau-Levenshtein distance between the substring of string1 of length
29 * i (in string1) and j (in string2), respectively, given that the last
41 int levenshtein(const char *string1, const char *string2,
44 int len1 = strlen(string1), len2 = strlen(string2);
58 row2[j + 1] = row1[j] + s * (string1[i] != string2[j]);
60 if (i > 0 && j > 0 && string1[i - 1] == string2[j] &&
61 string1[i] == string2[j - 1] &&
