How to write the Levenshtein Distance Algorithm for string comparison

Question

Is anyone able to show in pseudocode how one would create a function that calculates Levenshtein Distance for any two strings?

Answer 1

https://en.m.wikipedia.org/wiki/Levenshtein_distance
Check the "Computing Levenshtein Distance" section.

Answer 2

Hi Sonic, thanks for the link.
I was able to make this algorithm work!
I made it in KVS for KVIrc. See the code in my github:
https://github.com/Cabji/kvirc-kvs/blob/master/fnLevenshteinDistance.kvs
I don't know if it's exactly correctly implemented, but it seems to give the correct results.