grav/clojure-levenshtein

Learning clojure by implementing the Levenshtein algorithm. This is an algorithm to calculate the "edit distance" between two strings, or the number of insertions, deletions and replacements to get from one string to the other. See http://en.wikipedia.org/wiki/Levenshtein_distance .

This project is mainly for my own education and amusement and is put online as a way to pick up Git and Github while at the same time learning some more Clojure. The code in this project is an implementation of the Levenshtein distance algorithm which calculates the minimum number of edit operations to get from one string to another.