{"repository":{"homepage":"","watchers":1,"has_downloads":true,"fork":false,"language":"Python","has_issues":true,"has_wiki":true,"forks":1,"size":96,"private":false,"created_at":"2012/04/24 07:51:41 -0700","owner":"gopalkoduri","description":"This python code, when given a term and a list of terms, gives the possible duplicates of the given term in the given list of terms. The basic idea is to make use of edit distance and longest common subsequences, not just with immediate matches but also with the matches of the matches!","open_issues":0,"pushed_at":"2012/04/24 09:27:21 -0700"},"actor_attributes":{"name":"Gopala Krishna Koduri","location":"Barcelona","blog":"http://tidbits.co.in","type":"User","email":"f6fb72be008316e90afe54e85589e76fc29e827e@gmail.com"},"url":"https://github.com/gopalkoduri/stringDuplicates/compare/a2d6426b33...1d5304100d"}