{"repository":{"description":"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 .","homepage":"","watchers":1,"stargazers":1,"forks":1,"fork":false,"size":172,"owner":"tonvanbart","private":false,"open_issues":1,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Clojure","created_at":"2012-05-15T14:07:43-07:00","pushed_at":"2012-09-05T13:37:53-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Anthony Grimes","company":"Geni","blog":"http://blog.raynes.me","location":"Los Angeles, CA","email":"042dc4512fa3d391c5170cf3aa61e6a638f84342@raynes.me"},"url":"https://github.com/tonvanbart/clojure-levenshtein/issues/1"}