{"repository":{"description":"Burkhard-Keller tree implementation. Uses Damerau-Levenshtein algorithm for metric calculation.","homepage":"","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":484,"owner":"TarasRoshko","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C#","created_at":"2013-07-06T04:06:18-07:00","pushed_at":"2013-07-07T08:57:47-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Taras Roshko","location":"Lviv","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/TarasRoshko/fast-fuzzy-matching/compare/bd629a952d...a98ac06d98"}