Location:
Search - edit distance
Search list
Description: 对模式识别中的字符串模板匹配问题进行的研究，设计了对任意字符串进行匹配和字符串相似度，即列文斯顿距离进行计算的算法-right pattern recognition template matching string for the research and design of the arbitrary strings and string matching similarity, Ken Livingstone distance calculation algorithm
Platform: |
Size: 2734 |
Author: 蓝色梦幻 |
Hits:
Description: 动态规划算法求字符串的相似性（编辑距离）-dynamic programming algorithms to find the similarity of the string (edit distance)
Platform: |
Size: 4096 |
Author: Richard |
Hits:
Description: 对模式识别中的字符串模板匹配问题进行的研究，设计了对任意字符串进行匹配和字符串相似度，即列文斯顿距离进行计算的算法-right pattern recognition template matching string for the research and design of the arbitrary strings and string matching similarity, Ken Livingstone distance calculation algorithm
Platform: |
Size: 2048 |
Author: 蓝色梦幻 |
Hits:
Description: 对生物DNA进行两条碱基的比对，找出最小编辑距离，显示出联配结果（带界面变成源码）-Of biological DNA bases to more than two right, to find the minimum edit distance, showing that the alignment results (with the interface into source)
Platform: |
Size: 1024 |
Author: 小猪 |
Hits:
Description: 对任给的两个字符串A，B，用动态规划算法算出他们的最小编辑距离-For any given two strings A, B, using dynamic programming algorithm to calculate the minimum edit distance
Platform: |
Size: 6144 |
Author: 兰天 |
Hits:
Description: 实现编辑距离的计算，即字符串的匹配，支持汉字。-Realize the calculation of edit distance, that is, string matching, support for Chinese characters.
Platform: |
Size: 2048 |
Author: Majesty Liu |
Hits:
Description: 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
Platform: |
Size: 1024 |
Author: Doreen |
Hits:
Description: 求字符串编辑距离 动态规划 设给定样本 ，样本P在文本T中的K-近似匹配（K-approximate match）是指P在T中包含最多K个差异的匹配，求K-For the string edit distance to the set of dynamic programming based sample, the sample P in the text T in the K-approximate match (K-approximate match) refers to P in T contains up to a difference in the match K, and K
Platform: |
Size: 7168 |
Author: 郭涛 |
Hits:
Description: 数据清理中编辑距离的应用及Java编程实现,讲解深入浅出-Data cleaning edit distance application and Java programming implementation, explaining in layman' s language
Platform: |
Size: 128000 |
Author: 高进 |
Hits:
Description: 采用编辑距离计算词语相似度方法程序，可以嵌入其它程序-Edit the word using a distance-based similarity method of procedure, can be embedded in other programs
Platform: |
Size: 1024 |
Author: 刘翔 |
Hits:
Description: 设A 和B 是2 个字符串。要用最少的字符操作将字符串A 转换为字符串B。这里所说的字符操作包括
(1)删除一个字符；
(2)插入一个字符；
(3)将一个字符改为另一个字符。
将字符串A变换为字符串B 所用的最少字符操作数称为字符串A到B 的编辑距离，记为d(A,B)。试设计一个有效算法，对任给的2 个字符串A和B，计算出它们的编辑距离d(A,B)。-For A and B are two strings. Operation to use at least the characters will be converted to string A string B. Operation of the characters mentioned here, including (1) delete a character (2) insert a character (3) will be replaced by one character to another character. Will transform the string A string B for at least the characters used in string operands as the editor of A to B distance is recorded as d (A, B). Test the design of an efficient algorithm, for any given two strings A and B, to calculate their edit distance d (A, B).
Platform: |
Size: 884736 |
Author: 王 |
Hits:
Description: 最大公共子串和字符编辑距离算法的类实现。
函数第一个参数是用来比较的字符串，
第二个参数是被比较的字符串。
lCommonStr第三个参数是前两个字符串的公共子串。-The largest common sub-string and the character edit distance algorithm to achieve the category. Function of the first parameter is used to compare the string, the second parameter is the string to be compared. lCommonStr third parameter is the string the first two public substring.
Platform: |
Size: 2048 |
Author: 尤凤凯 |
Hits:
Description: java code implement minimum edit distance
Platform: |
Size: 2048 |
Author: Nagaraj |
Hits:
Description: Edit Distance algorithm between two srings.
Platform: |
Size: 3072 |
Author: saad |
Hits:
Description: 实现最小编辑距离算法，并给出完整的编辑过程，完整版源码，已调试通过-To achieve the minimum edit distance algorithm, and gives the complete editing process, full version of source code, has been debugging through the
Platform: |
Size: 506880 |
Author: 王贝 |
Hits:
Description: 这是模式识别中模板匹配内容的Matlab例程，其中edit_distance程序用来计算两个符号字符串间的编辑距离；
back-tracking程序是“回溯”法画出最佳路径的代价网格；
Dtw-Sakoe.m程序是具有Sakoe-Chiba局部路径约束的动态时间弯
折。-This is a pattern recognition template matching the content of Matlab routines, which edit_distance procedures used to calculate the two symbols of the edit distance between strings back-tracking program is " back" method to draw the best path cost grid Dtw- Sakoe.m program is a Sakoe-Chiba local path constraint of the dynamic time warping.
Platform: |
Size: 1024 |
Author: 王明松 |
Hits:
Description: 计算两个拥有几万字符的文件的编辑距离的动态规划的代码-Calculate the edit distance two files with tens of thousands of characters of dynamic programming code
Platform: |
Size: 6882304 |
Author: 马超 |
Hits:
Description: 该代码主要是用来计算两个句子之间的编辑距离-edit distance
Platform: |
Size: 1024 |
Author: 贺子宸 |
Hits:
Description: 算法导论(3)动态规划中edit distance 一题解答-Introduction to Algorithms (3) dynamic programming in an edit distance Answers
Platform: |
Size: 2048 |
Author: xiazhao |
Hits:
Description: 经典的动态规划算法，利用动态规划思想实现字符串编辑距离，二维数组做为动态规划的存储空间，用来换取时间。-String edit distance
Platform: |
Size: 1024 |
Author: |
Hits: