This minimum number of changes is called the edit distance.
最小数量的更改称为编辑距离。
In fact, a Levenshtein distance is also known as an edit distance.
实际上，Levenshtein距离也称作编辑距离。
Sort: Sort the words by edit distance, keeping words found at each step together.
排序：按照编辑距离排序单词，把每一步骤中找到的单词放在一起。
The strength of the Aspell algorithm is the way it USES edit distance at both the word level and the phonetic code level.
Aspell算法的优势在于它利用编辑距离的方式，它在单词级别上和语音代码级别上都使用编辑距离。
Design an algorithm to calculate any two of the string edit distance.
设计一个算法，计算任意两个字符串的编辑距离。
This paper reviews some formulas for event sequence similarity calculation, and proposes an improved edit distance.
分析了事件序列相似性的计算公式，提出了改进的编辑距离公式。
Compared to the 0-1 polynomial kernel, our newly designed string kernel based on edit distance can effectively measure the similarity between sequences.
相比先前基于0 - 1编码的多项式核，采用新的字符串核能较好地度量序列之间的相似度。
Next we used distributional similarity as a feature in the discriminative maximum entropy model, with edit distance, phonetic similarity, and language model as other features.
我们还将分布式相似度作为一个特征用于最大熵判别模型中，结合编辑距离、发音相似度、语言模型等基本特征。
Next we used distributional similarity as a feature in the discriminative maximum entropy model, with edit distance, phonetic similarity, and language model as other features.
我们还将分布式相似度作为一个特征用于最大熵判别模型中，结合编辑距离、发音相似度、语言模型等基本特征。
应用推荐