Welcome![Sign In][Sign Up]
Location:
Search - 编辑距离

Search list

[Other resource编辑距离问题

Description: 此算法也是非常常用的算法之一,在这个算法中我们特别要明白编辑距离问题的实质所在.-This algorithm is very commonly used algorithm, the algorithm in particular, we need to understand edit distance the real problem lies.
Platform: | Size: 6095 | Author: 周华 | Hits:

[Delphi VCLDNA

Description: 对生物DNA进行两条碱基的比对,找出最小编辑距离,显示出联配结果(带界面变成源码)
Platform: | Size: 1238 | Author: 小猪 | Hits:

[Windows Developld

Description: 对任给的两个字符串A,B,用动态规划算法算出他们的最小编辑距离
Platform: | Size: 6041 | Author: 兰天 | Hits:

[MultiLanguageDirect

Description: 珍藏论文:基于改进编辑距离的中文相似句子检索
Platform: | Size: 332086 | Author: zhoutgtt | Hits:

[JSP/JavaEditDistance

Description: 实现编辑距离的计算,即字符串的匹配,支持汉字。
Platform: | Size: 2580 | Author: Majesty Liu | Hits:

[SourceCode基于编辑距离计算文本相似性

Description: 基于编辑距离计算文本相似性
Platform: | Size: 1033466 | Author: tjnuwanghu@163.com | Hits:

[Data structs编辑距离问题

Description: 此算法也是非常常用的算法之一,在这个算法中我们特别要明白编辑距离问题的实质所在.-This algorithm is very commonly used algorithm, the algorithm in particular, we need to understand edit distance the real problem lies.
Platform: | Size: 6144 | Author: 周华 | Hits:

[Data structsEditDistance

Description: 用动态规划算法思想求最小编辑距离,即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
Platform: | Size: 1024 | Author: Doreen | Hits:

[Windows Developstring

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:

[OtherStringMatch

Description: VC 实现的小程序,完成最小编辑距离计算,简单易读易懂-VC string match
Platform: | Size: 310272 | Author: wang | Hits:

[Othermed

Description: 最小编辑距离,可以计算2个字符串的相似度,用于语音文档检索-Minimum edit distance between two strings can calculate the similarity for retrieval of voice files
Platform: | Size: 31744 | Author: zhu | Hits:

[Windows DevelopED

Description: 编辑距离的程序实现,用C++语言编程实现的。-Edit distance program, using C++ language programming realization.
Platform: | Size: 854016 | Author: yp | Hits:

[Algorithmsuanfa

Description: 设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括: 1. 删除一个字符 2. 插入一个字符 3. 将一个字符改为另一个字符 将字符串A变换为字符串B所用的最少操作数称为A到B的编辑距离,极为d(A,B)。设计一个算法,计算任意两个字符串的编辑距离。 -Set A and B are two strings. Operation will use the least character string A is converted to a string B. Operation of characters are talking about here include: 1. Delete a character 2. Insert a character 3. Will be replaced by one character to another character will be transformed into a string A string of at least B operand used by A to B is called the edit distance is extremely d (A, B). Design an algorithm to calculate any two of the string edit distance.
Platform: | Size: 1024 | Author: 李代 | Hits:

[OtherEDIT_Distance

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:

[Othereditdistance

Description: soundx 和 编辑距离的程序 输入两个单词进行比较(soundx and edit distance)
Platform: | Size: 1024 | Author: pangsinidjfi | Hits:

[Console王敬贤-SA16168143-第3次作业

Description: 关于两个字符串s1,s2的差别,可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems)
Platform: | Size: 2593792 | Author: 心晴紫贝 | Hits:

[Other编辑距离

Description: 程序提示用户输入一行字符串(字符个数不超过80个,该字符串用回车符结束)。并按字母,数字及其他字符分类计数,然后将结果存入以char、digit和other为名的存储单元 字符串转换所需最短的编辑距离(The program prompts the user to enter a string of characters (no more than 80 characters, and the string ends with carriage returns). It is classified and counted according to letters, numbers and other characters, and then the results are stored in the storage units in the name of char, digit and other The shortest edit distance required for string conversion)
Platform: | Size: 5120 | Author: xiaozhu1998 | Hits:

[Windows Develop编辑距离问题

Description: 编辑距离:将字符串S通过插入、删除、替换三种编辑操作,转变为字符串T,所需最少的编辑次数。(Edit distance definition: string S by inserting, deleting, replacing three editing operations, converted to string T, the minimum number of editing required.)
Platform: | Size: 402432 | Author: 你若安好 | Hits:

[Other1107编辑距离

Description: 这是一个用C++写的编辑距离问题,可供初学者学习使用(This is an editing distance problem written in c ++ that can be used by beginners)
Platform: | Size: 1024 | Author: 钱哇史蒂芬 | Hits:

[Other4

Description: 动态规划中编辑距离算法的实现,使用JAVA语言。(The implementation of the edit distance algorithm in dynamic programming, using the JAVA language.)
Platform: | Size: 1024 | Author: jiang_sen | Hits:
« 12 3 4 5 6 7 »

CodeBus www.codebus.net