{"repository":{"description":"This project takes a .txt document and a .txt dictionary, checks for misspelled words, and suggests the most likely word that the user intended. It uses the Levenshtein distance algorithm to rank the suggested words. Check out the readme for more information on how to use the program.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":532,"owner":"lurke","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"OCaml","created_at":"2013-12-19T19:54:35-08:00","pushed_at":"2013-12-19T20:08:16-08:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/lurke/Levenshtein-Auto-Correcter/compare/master"}