{"repository":{"created_at":"2009/07/30 11:52:21 -0700","owner":"schuyler","has_wiki":true,"language":"C","open_issues":0,"watchers":17,"pushed_at":"2009/07/30 12:33:44 -0700","description":"Fast string edit distance computation, using the Damerau-Levenshtein algorithm.","fork":false,"size":132,"has_downloads":true,"private":false,"has_issues":true,"homepage":"","forks":8},"actor_attributes":{"email":"717864b92c6e23fb714860482bc11f382955e2fb@gmail.com","name":"Fernando Meyer","blog":"http://fmeyer.org","company":"pigraph","location":"Sao Paulo","type":"User"},"url":"https://github.com/schuyler/levenshtein"}