{"repository":{"has_issues":true,"description":"Find a needle (a document or record) in a haystack using string similarity and (optionally) regular expression rules. Uses Dice's Coefficient (aka Pair Similiarity) and Levenshtein Distance internally.","owner":"seamusabshere","language":"Ruby","open_issues":3,"has_downloads":true,"pushed_at":"2013-01-17T16:26:34-08:00","watchers":57,"forks":5,"has_wiki":true,"stargazers":57,"fork":false,"size":172,"created_at":"2012-01-13T08:46:31-08:00","homepage":"","private":false},"actor_attributes":{"location":"Tokyo, Japan","type":"User","name":"t_ramu","blog":"http://d.hatena.ne.jp/ramtiga/","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/seamusabshere/fuzzy_match"}