danlynn / Levenshtein-in-Ruby-with-inline-C-and-Java-optimizations

The Levenshtein string distance algorithm is a great way to determine how similar two strings are to each other. However, it is very CPU intensive. Therefore, I added INLINE Java and C versions of the core algorithm which produce 60x and 500x improvements in performance over the pure ruby implementation. This code will automatically fail back to a pure ruby implementation if any of the dependencies for the inline optimizations aren't met.