搜索资源列表
文件相似度比较器
- 文件相似度比较器： 1。 采用标准的 Levenshtein Distance 算法计算两个文件的相似度。 2。 程序使用简单。选入多个文件，然后按分析便个分析出两个文件之间的相似程度。 3。 发现问题欢迎和我讨论。 E-mail: hackerqc@gmail.com-document similarity comparison : 1. Standard Levenshtein Distance algorithm similarity of the two documents.
simmetrics_src_v1_5_d06_06_06
- SimMetrics is a Similarity Metric Library, e.g. from edit distance s (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/0
DL-Dist
- [Damerau–Levenshtein distance] vb.net程式碼，內含兩Function，一個計算距離，一個計算相似度。-[Damerau–Levenshtein distance] Code of vb.net, contains two Function, one for the distance, another for similarity.
LevenshteinCompare
- String comparaison based on levenshtein algorithm
L_A_distance
- Levenshtein 距离算法实现。Levenshtein 距离测量两个字符串的相近性-The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance".
distance
- Implementation of Levenshtein distance
LevenshteinDistance
- Method to Compute Levenshtein distance
Levenshtein
- Algorithm Levenstein and recursive version this algorithm
3
- 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
LD
- 又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间，由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。 -Also known as Levenshtein distance (also known as Edit Distance), is between two strings, one by one turned into the minimum required number of edit
Levenshtein-Distance
- 验证码识别，字符串相似度算法（编辑距离算法 Levenshtein Distance）-Verification code identification, string similarity algorithm (edit Distance algorithm Levenshtein Distance)
editLenth
- 编辑距离算法的python源码,编辑距离，又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。-Levenshtein Distance Algorithm s python version The Levenshtein distance between two strings is defined as the minimum number o
SimilarityLYG
- /** * @作者：刘亚歌 * @日期时间：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
Levenshtein-Distance
- SA算法实现编辑距离功能，压缩包内有两个版本，一个只实现编辑距离的求解，一个在实现编辑距离的计算同时，还将具体的编剧过程打印出来-Edit distance function SA algorithm, compressed package comes in two versions, one only solving edit distance, an edit distance calculation the same time, will also be specific screenwr
SiftStringSimilarity
- 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
levenshtein_src
- 快速，内存高效的Levenshtein字符串相似度算法。相比以前用矩阵的算法，此算法只需两个数组。速度不减，且大大优化了内存的使用。 http://www.codeproject.com/Articles/13525/Fast-memory-efficient-Levenshtein-algorithm-Fast, memory efficient Levenshtein algorithm http://www.codeproject.com/Articles/13525/Fast-m
LevenshteinDistance
- This class represents the matrix used in the Levenshtein distance algorithm, together with the algorithm itself which operates on the matrix.
levenshtein
- This function implements the Damerau-Levenshtein algorithm to calculate a distance between strings.
similar
- Django 中如何使用 Levenshtein 工具检索数据库中内容相似的对象-how to use Levenshtein in Django to the similar objects the
levenshtein
- This function implements the Damerau-Levenshtein algorithm to calculate a distance between strings.