最小数量的更改称为编辑距离。
实际上，Levenshtein距离也称作编辑距离。
In fact, a Levenshtein distance is also known as an edit distance.
设计一个算法，计算任意两个字符串的编辑距离。
Design an algorithm to calculate any two of the string edit distance.
排序：按照编辑距离排序单词，把每一步骤中找到的单词放在一起。
Sort: Sort the words by edit distance, keeping words found at each step together.
基于此编辑距离，提出一种事件序列聚类算法SOEC。
Thereby a sequence of events clustering algorithm, shorted for SOEC, is proposed.
分析了事件序列相似性的计算公式，提出了改进的编辑距离公式。
This paper reviews some formulas for event sequence similarity calculation, and proposes an improved edit distance.
在Jazzy 中使用的编辑距离与以前在 Levenshtein 距离中的定义不同。
The edit distance used in Jazzy differs from the Levenshtein distance defined earlier.
基于数据处理的需要，在分析原有编辑距离算法的基础上，通过拓展交换操作减少编辑操作的数量。
Based on the requirement of data processing, after analyzing the existing algorithm of Levenshtein Distance, the number of edit operation was decreased by extending the transposition operation.
鉴于这种情况，将最大拓扑公共子图法与编辑距离测量法相结合，提出了一种新的相似性测量方法。
In this new similarity measure, main structure of the graph is first measured according to the topological common subgraph.
Aspell算法的优势在于它利用编辑距离的方式，它在单词级别上和语音代码级别上都使用编辑距离。
The strength of the Aspell algorithm is the way it USES edit distance at both the word level and the phonetic code level.
对于这些代码，加入字典中所有与拼写错误单词语音编码相同的单词，以及与拼写错误单词的编辑距离小于指定阈值的单词。
For these codes, add all dictionary words that have the same phonetic code as the misspelled word and whose edit distance from the misspelled word is less than a given threshold.
我们还将分布式相似度作为一个特征用于最大熵判别模型中，结合编辑距离、发音相似度、语言模型等基本特征。
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.
最佳猜测：如果没有找到建议，就加入字典中所有与拼写错误的单词的语音代码相同的单词，以及与拼写错误的单词编辑距离最小的单词。
Best guess: If no Suggestions have been found, add all dictionary words that have the same phonetic code as the misspelled word and with the smallest edit distance from the misspelled word.
基于编辑距离和多种后处理的生物医学文献实体名识别方法通过“全称缩写对识别算法”扩充词典，利用编辑距离算法提高识别召回率。
In order to enhance the robustness of LTSA algorithm, an outlier detection method based on the improved distance is presented in this paper.
Lucene支持基于编辑距离算法的模糊搜索，你可以使用波浪符号“~”放在查询词的后面，比如搜索一个与“roam”拼写相近的词可以使用。
Lucene supports fuzzy searches based on the Levenshtein Distance, or Edit Distance algorithm. To do a fuzzy search use the tilde, "~", symbol at the end of a Single word Term.
改进编辑距离的算法与单纯基于语义辞典计算句子相似度的算法相比，具有便于扩展，准确率高等优点，在英文辅助写作领域取得了令人满意的效果。
The approach of improved edit-distance has more advantages than original edit-distance algorithm, such as easily extending, high precision and so on. It has gotten a satisfying result.
特别注意！层不能被删除或编辑的，所以如果你想改变关卡流的距离设置，用你需要的设计来创建一个新的层，并且给它分配对应的关卡。
Layers can not be deleted or edited, so if you would like to change streaming distance Settings, create a new layer with your desired Settings and assign levels to it.
作者认为，编辑能够跨过历史距离来进行工作是一种值得赞赏的优势。
The advantage for an editor being able to work from an historical distance is appreciated.
作者认为，编辑能够跨过历史距离来进行工作是一种值得赞赏的优势。
The advantage for an editor being able to work from an historical distance is appreciated.
应用推荐