Levenshtein 距离算法实现。Levenshtein 距离测量两个字符串的相近性-The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance".

实现LV距离算法，可用于字符串等相似度的应用计算，是相似度的核心算法实现，共分7步-LV distance algorithm to achieve, can be used to calculate the string so the application of similarity is the similarity of the core algorithm, is divided into 7 steps