{"repository":{"description":"Fast string edit distance computation, using the Damerau-Levenshtein algorithm.","homepage":"","watchers":66,"stargazers":66,"forks":7,"fork":true,"size":132,"owner":"dbalatero","private":false,"open_issues":3,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Ruby","created_at":"2010-04-07T10:30:58-07:00","pushed_at":"2012-08-09T12:47:06-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"David Butler","location":"Pasadena, CA","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/dbalatero/levenshtein-ffi/pull/4"}