Levenshtein Distance1 Levenshtein distance Levenshtein Distance란? wikipedia에서는 아래와 같이 정의하고 있다. Ininformation theoryandcomputer science, theLevenshtein distanceis astring metricfor measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. It is named afterVla.. 2017. 1. 10. 이전 1 다음