Wikipedia
In computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number of operations required to transform one string into the other.

Given two strings a and b on an alphabet Σ (e.g. the set of ASCII characters, the set of bytes [0..255], etc.), the edit distance d(a, b) is the minimum-weight series of edit operations that transforms a into b. One of the simplest sets of edit operations is that defined by Levenshtein in 1966:[2]

• Insertion of a single symbol. If a = uv, then inserting the symbol x produces uxv. This can also be denoted ε→x, using ε to denote the empty string.
• Deletion of a single symbol changes uxv to uv (x→ε).
• Substitution of a single symbol x for a symbol y ≠ x changes uxv to uyv (x→y)辑

Baidu

kitten->sitten （k→s）
sitten->sittin （e→i）
sittin->sitting （插入g）

editdistance/ _editdistance.cpp (117) : error C2059: syntax error