{"repository":{"forks":3,"description":"Fast string edit distance computation, using the Damerau-Levenshtein algorithm.","open_issues":3,"language":"Ruby","created_at":"2010/04/07 10:30:58 -0700","pushed_at":"2011/09/05 12:57:01 -0700","homepage":"","fork":true,"watchers":40,"has_downloads":true,"size":116,"private":false,"owner":"dbalatero","has_issues":true,"has_wiki":true},"actor_attributes":{"name":"Paul Martin","company":"CTV Television Inc","location":"Toronto, Ontario","blog":"www.ctv.ca","type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/dbalatero/levenshtein-ffi"}