{"id":20354929,"url":"https://github.com/grayhatdevelopers/trie","last_synced_at":"2026-05-26T23:31:22.030Z","repository":{"id":109372433,"uuid":"226915528","full_name":"grayhatdevelopers/Trie","owner":"grayhatdevelopers","description":"A suffix trie implementation for the lowercase English language, with a spellchecker implementing the Levenshtein Distance Algorithm.","archived":false,"fork":false,"pushed_at":"2019-12-09T16:29:40.000Z","size":19,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-04T17:35:34.317Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/grayhatdevelopers.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-12-09T16:23:31.000Z","updated_at":"2020-08-24T12:19:57.000Z","dependencies_parsed_at":"2023-03-07T22:45:34.834Z","dependency_job_id":null,"html_url":"https://github.com/grayhatdevelopers/Trie","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/grayhatdevelopers/Trie","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grayhatdevelopers%2FTrie","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grayhatdevelopers%2FTrie/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grayhatdevelopers%2FTrie/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grayhatdevelopers%2FTrie/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/grayhatdevelopers","download_url":"https://codeload.github.com/grayhatdevelopers/Trie/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grayhatdevelopers%2FTrie/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33543973,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"ssl_error","status_checked_at":"2026-05-26T15:22:15.568Z","response_time":63,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-14T23:10:28.597Z","updated_at":"2026-05-26T23:31:22.013Z","avatar_url":"https://github.com/grayhatdevelopers.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Trie\nA suffix trie implementation for the lowercase English language, with a spellchecker implementing the Levenshtein Distance Algorithm.\nAuthor: Saad Bazaz\n\nPlease use dictionary.txt, as the program is currently tweaked to read dictionaries in that format. You can alter it to \nhowever you like.\nIf you find a way to improve the implementation, don't hesitate to message or send a pull request!\n\nThis file also contains the C++ implementation of Levenshtein distance algorithm combined with Suffix Trie.\nComments starting with '#' belong to the original author, Steve Hanov, who wrote it in Python for Rhymebrain.com (2011).\n\n\t// References:\n\t// 1. http://stevehanov.ca/blog/?id=114\n\t// 2. https://en.wikipedia.org/wiki/Levenshtein_distance\n\t// 3. http://norvig.com/spell-correct.html\n\t// 4. https://dzone.com/articles/the-levenshtein-algorithm-1\n\t// 5. https://en.wikipedia.org/wiki/BK-tree\n\t// 6. https://news.ycombinator.com/item?id=9737554\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrayhatdevelopers%2Ftrie","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgrayhatdevelopers%2Ftrie","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrayhatdevelopers%2Ftrie/lists"}