レーベンシュタイン距離
1. Levenshtein distanceIn information theory and computer science, the Levenshtein distance is a string metric for measuring the amount of difference between two sequences. The term edit distance is often used to refer specifically to Levenshtein distance. The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
Read “Levenshtein distance” on English Wikipedia
Read “レーベンシュタイン距離” on Japanese Wikipedia
Read “Levenshtein distance” on DBpedia
Read “Levenshtein distance” on English Wikipedia
Read “レーベンシュタイン距離” on Japanese Wikipedia
Read “Levenshtein distance” on DBpedia
Discussions
Log in to talk about this word.