• Levenshtein distance

Levenshtein distance (suomeksi)

Määritelmät:

• (lb, en, computer science) The number of edits (replacements, deletions and insertions) required to change one string into another.