When you have to figure out the difference between two strings your best bet is either H*amming distance* or *Levenshtein distance*.

Because hamming distance only works on strings of equal lengths, you're usually better off using levenshtein distance. Its name is also harder to spell so you know it's better!

It is defined as *the minimum amount of edits needed to transform one string into another*. Like this:

kitten โsitten (substitution of 's' for 'k')- sitt
en โ sittin (substitution of 'i' for 'e')- sittin โ sittin
g(insertion of 'g' at the end).

Levenshtein distance also happens to be a great case for learning about dynamic programming, because one of the simplest implementations involves nothing more than keeping track of the already known distances and deciding whether you should increase that number for the next character.

Doing this in a 2D array is trivially simple because it lest you travel through the distance space very efficiently without forgetting that *kitten* and *kiten* only have a levenshtein distance of 1.

The meat of the algorithm goes like this:

if s[i] = t[j] thend[i, j] := d[i-1, j-1] // no operation requiredelsed[i, j] := minimum(d[i-1, j] + 1, // a deletiond[i, j-1] + 1, // an insertiond[i-1, j-1] + 1 // a substitution)

## Dynamic programming and Haskell

Doing this in Haskell becomes tricky because we don't have state so we can't really keep track of what we already know. Translating this into a recursive problem is our only option.

The key insight comes from looking at what those index manipulations are doing - traveling in the space of two strings.

So, if we start from the other end of the "matrix" - bottom right instead of top left - we can express the levenshtein distance recursively:

- if last two characters are same, ignore them
- otherwise take the minimum of ignoring either or both the last characters
- recurse

In Haskell the function ends up looking like this:

-- calculate levenshtein distance between two stringslevenshtein::[Char] -> [Char] -> Intlevenshtein "" "" = 0levenshtein "" s2 = length s2levenshtein s1 "" = length s1levenshtein s1 s2| last s1 == last s2 = levenshtein (init s1) (init s2)| otherwise = minimum [1 + levenshtein (init s1) s2,1 + levenshtein s1 (init s2),1 + levenshtein (init s1) (init s2)]

Better Haskellers than me can probably write this a bit cleaner - for instance you don't need the *levenshtein "" "" = 0* line, but I think it's more readable when all the border cases are spelled out explicitly.

However, the problem is that this is incredibly slow when comparing a long string to a short one. So slow in fact, I never waited for the code to stop executing (takes 20s+).

Luckily, speeding up the code is trivial - look at those border cases. We can just handle those first and *then* go into the meaty algorithm!

The code becomes somewhat uglier to look at, but is usefully quick for all cases:

-- calculate levenshtein distance between two stringslevenshtein::[Char] -> [Char] -> Int-- this part is mostly a speed optimiziationlevenshtein s1 s2| length s1 > length s2 = levenshtein s2 s1| length s1 < length s2 =let d = length s2 - length s1in d + levenshtein s1 (take (length s2 - d) s2)-- the meat of the algorithmlevenshtein "" "" = 0levenshtein s1 s2| last s1 == last s2 = levenshtein (init s1) (init s2)| otherwise = minimum [1 + levenshtein (init s1) s2,1 + levenshtein s1 (init s2),1 + levenshtein (init s1) (init s2)]

If anyone's got an even better idea for implementing Levenshtein distance in Haskell, I'd love to hear!

edit: A Reddit commenter provides a far better Levenshtein distance function.

###### Related articles

## Learned something new?

Want to become a high value JavaScript expert?

Here's how it works ๐

Leave your email and I'll send you an **Interactive Modern JavaScript Cheatsheet** ๐right away. After that you'll get thoughtfully written emails every week about **React**, **JavaScript**, and **your career**. Lessons learned over my 20 years in the industry working with companies ranging from tiny startups to Fortune5 behemoths.

### Start with an interactive cheatsheet ๐

Then get thoughtful
letters ๐ on **mindsets, tactics, and technical skills** for your
career.

"Man, love your simple writing! Yours is the only email I open from marketers and only blog that I give a fuck to read & scroll till the end. And wow always take away lessons with me. Inspiring! And very relatable. ๐"

**Have a burning question that you think I can answer?**ย I don't have all of the answers, but I have some! Hit me up on twitter or book a 30min ama for in-depth help.

**Ready to Stop copy pasting D3 examples and create data visualizations of your own?**
ย Learn how to build scalable dataviz components your whole team can understand
with React for Data Visualization

**Curious about Serverless and the modern backend?** Check out
Serverless Handbook, modern backend for the frontend engineer.

**Ready to learn how it all fits together and build a modern webapp from scratch?**
Learn how to launch a webapp and make your first ๐ฐ on the side with ServerlessReact.Dev

**Want to brush up on your modern JavaScript syntax?**ย Check out my interactive cheatsheet: es6cheatsheet.com

**By the way, just in case no one has told you it yet today: I love and appreciate you for who you areย โค๏ธ**