Jump to content

Levenshtein distance: Difference between revisions

m
m (→‎{{header|F#}}: Corrected header as suggested on the Count examples/Full list/Tier 4 talk page)
Line 1,659:
 
<lang dyalect>func levenshtein(s, t) {
var n = s.lenLength()
var m = t.lenLength()
var d = Array.emptyEmpty(n + 1, () => Array.emptyEmpty(m + 1))
 
if n == 0 {
return m
Line 1,674:
d[i][0] = i
}
 
for j in 0..m {
d[0][j] = j
Line 1,693:
}
}
 
d[n][m]
}
 
func run(x, y) {
print("\(x) -> \(y) = \(levenshtein(x, y))")
}
 
run("rosettacode", "raisethysword")</lang>
 
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.