最小数量的更改称为编辑距离。
实际上，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.
作者认为，编辑能够跨过历史距离来进行工作是一种值得赞赏的优势。
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.
应用推荐