搜索资源列表
editdistance
- 数据清理中编辑距离的应用及Java编程实现,讲解深入浅出-Data cleaning edit distance application and Java programming implementation, explaining in layman' s language
EditDistance
- Edit Distance algorithm implemented en java
Similarity
- 编辑距离就是用来计算从原串（s）转换到目标串(t)所需要的最少的插入，删除和替换的数目。-Edit distance is used to calculate the converted from the original string (s) to the target string (t) is the minimum needed to insert, delete, and the number of substitutions.
information_retrieval
- 输入edit distance上限和一个String 得到所有可能的字符串-Enter the maximum edit distance and a String to get all possible string
algorithm
- 一些经典算法的java实现：包括：二分查找，最优二搜索树，编辑距离，哈夫曼树，最长公共子序列，矩阵连乘问题，最短路径优先-Some classic algorithm java implementation: including: binary search, and optimal two search tree, the edit distance Huffman tree, the longest common subsequence matrix multiplicative Short
LevenshteinSuggestionFormatter
- Suggestion formatter using the Levenshtein distance (minumum edit distance) to calculate the formatting.
EditDistanceSimilarityTest
- 基于编辑距离的字符串相似度检测算法的实现-Based on the similarity detection algorithm to achieve a string edit distance
文本查重
- 类说明： 名称：Contrast 描述：用于两文本进行各种方法的相似度对比。 相似度对比方法： 1.EditDistance编辑距离 2.CosineSimilarAlgorithm余弦定理 3.JianDanMoHu模糊匹配 4.综合对比，三种方法皆对比一遍，取平局值 方法：String getDegree（文本1，文本2，使用方法id）返回值为：字符串型的，相似度百分比(Class descr iption: Name: Contrast Desc