NaNtic
/
nanscan
mirror of https://github.com/NaN-tic/nanscan.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Fixed Levenshtein distance for empty strings. 

Also create array more efficiently.
This commit is contained in:
Albert Cervera i Areny 2008-09-15 16:04:18 +02:00
parent 907ccb94b2
commit a4b8ccf707
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
NaNScaN/levenshtein.py
View File

@ -20,12 +20,15 @@ class Levenshtein:
@staticmethod
def levenshtein( text1, text2 ):
d = []
# Should use an array instead..
for i in range(len(text1)):
d.append( [] )
for j in range(len(text2)):
d[i].append(0)
# Levenshtein distance if one string is empty, is the
# length of the other string, len(text) inserts.
if len(text1) == 0:
return len(text2)
if len(text2) == 0:
return len(text1)
# Build array of len(text1) * len(text2)
d = [ [0] * len(text2) ] * len(text1)
for i in range(len(text1)):
d[i][0] = i