Calculates the Levenshtein distance between two strings, which is the distance between two words. The lower the distance, the closer the words match. Useful in word comparisons. Includes a recursive implementation for experimentational purposes, and a unit test to compare the two.
#Data Files 10k and 20k text files taken from: https://github.com/first20hours/google-10000-english with provided license.