Coding challenge: use levenshtein algorithm to make a "did you mean" algorithm

Use the [levenshtein distance algorithm](https://en.m.wikipedia.org/wiki/Levenshtein_distance) to find the most possible matched word for a misspelled word.

By itself the Levenshtein algorithm is not able to do this, so you'd have to find the word(s) with the smallest distance, and if there are more than one, check each letter in every word, and assign a score to each word based on how many matched letters it has, compared to the misspelled word.