Levenshtein distance/Alignment: Difference between revisions

Content added Content deleted
(→‎{{header|Haskell}}: added solution)
(Added Arturo implementation)
Line 18: Line 18:
You can either implement an algorithm, or use a dedicated library (thus showing us how it is named in your language).
You can either implement an algorithm, or use a dedicated library (thus showing us how it is named in your language).
<br><br>
<br><br>

=={{header|Arturo}}

<lang rebol>print join.with:"\n" levenshtein.align "place" "palace"
print join.with:"\n" levenshtein.align "rosettacode" "raisethysword"</lang>

{{out}}

<pre>p-lace
palace
r-oset-tacode
raisethysword</pre>


=={{header|C}}==
=={{header|C}}==