的编辑距离来求,然后说了一下怎么实现
def leven(a,b):if len(a) > len(b):
a,b = b,a
if len(a) == 0 :
return len(b)
else:
return len(a)
n = len(a)+1
m = len(b)+1
distance_matrix = [range(m) for x in range(n)]
for i in range(1,n):
for j in range(1,m):
deletion = distance_matrix[i-1][j]+1
insertion = distance_matrix[i][j-1]+1
subtion = distance_matrix[i-1][j-1]
if n[i-1] != second[j-1]:
subtion = subtion+1
distance_matrix[i][j] = min(deletion,insertion,subtion)
return distance_matrix[n-1][m-1]