Levenshtein distance: Difference between revisions

<lang futurebasic>window 1

dim as long m, n, i, j, min, k, l

dim as long distance( 255, 255 )

m = len$(aStr)

n = len$(bStr)

for i = 0 to m

distance( i, 0 ) = i

next

for j = 0 to n

distance( 0, j ) = j

next

for j = 1 to n

for i = 1 to m

distance( i, j ) = distance( i-1, j-1 )

min = distance( i-1, j ) + 1

k = distance( i, j - 1 ) + 1

l = distance( i-1, j-1 ) + 1

if k < min then min = k

if l < min then min = l

distance( i, j ) = min

end if

next

next

print "1st string = "; testStr( i, 0 )

print "2nd string = "; testStr( i, 1 )

print "Levenshtein distance ="; fn LevenshteinDistance( testStr( i, 0 ), testStr( i, 1 ) )

print