[Damerau–Levenshtein distance] vb.net程式碼，內含兩Function，一個計算距離，一個計算相似度。-[Damerau–Levenshtein distance] Code of vb.net, contains two Function, one for the distance, another for similarity.

The Levenshtein Distance between two strings a, b is the number of changes to transform one string into another. For example to transform mouse into house would take 1 (change the m to an h). If the strings are different length then either characters

/** * @作者：刘亚歌 * @日期时间：2012-5-24 下午06:45:47 * @描述：编辑距离的算法是首先由俄国科学家Levenshtein提出的，故又叫Levenshtein Distance。 */-/*** @ Author: Liu Ya Song* @ Date Time :2012-5-afternoon 24 06:45:47* @ descr iption: the edit distance algorithm is first p

SIFT3 字符串距离比较，类Levenshtein算法实现。速度较 Levenshtein距离算法快10-45倍。实现略有不同，结果也与 Levenshtein有些差异，但高速是此算法的特点。详情请看： http://siderite.blogspot.com/2007/04/super-fast-and-accurate-string-distance.html-Super Fast and Accurate string distance algorithm: Sift3. Fro