Levenshtein distance: Difference between revisions
Content added Content deleted
m (→{{header|F#}}: Corrected header as suggested on the Count examples/Full list/Tier 4 talk page) |
|||
| Line 1,659: | Line 1,659: | ||
<lang dyalect>func levenshtein(s, t) { |
<lang dyalect>func levenshtein(s, t) { |
||
var n = s. |
var n = s.Length() |
||
var m = t. |
var m = t.Length() |
||
var d = Array. |
var d = Array.Empty(n + 1, () => Array.Empty(m + 1)) |
||
if n == 0 { |
if n == 0 { |
||
return m |
return m |
||
| Line 1,674: | Line 1,674: | ||
d[i][0] = i |
d[i][0] = i |
||
} |
} |
||
for j in 0..m { |
for j in 0..m { |
||
d[0][j] = j |
d[0][j] = j |
||
| Line 1,693: | Line 1,693: | ||
} |
} |
||
} |
} |
||
d[n][m] |
d[n][m] |
||
} |
} |
||
func run(x, y) { |
func run(x, y) { |
||
print("\(x) -> \(y) = \(levenshtein(x, y))") |
print("\(x) -> \(y) = \(levenshtein(x, y))") |
||
} |
} |
||
run("rosettacode", "raisethysword")</lang> |
run("rosettacode", "raisethysword")</lang> |
||