Levenshtein Distance

By | September 18, 2017

The Levenshtein Distance algorithm measures the amount of changes required to transform one string into another, essentially comparing 2 strings and returning a number representative of the number of characters needed to make both strings equal.

For instance if you implemented a function Levenshtein(“American”, “American”) you would get the return value = 1.

Useful Links

Wikipedia on Levenshtein Distance

Leave a Reply

Your email address will not be published. Required fields are marked *