{"id":15973267,"url":"https://github.com/ulitol97/spellchecker","last_synced_at":"2025-04-04T16:19:46.588Z","repository":{"id":133594140,"uuid":"373905956","full_name":"ulitol97/spellchecker","owner":"ulitol97","description":"Spellchecker using the Levenshtein Distance between words to correct user input","archived":false,"fork":false,"pushed_at":"2021-06-06T23:00:39.000Z","size":609,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-10T01:44:47.880Z","etag":null,"topics":["cpp","levenshtein-distance","spellcheck"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":false,"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/ulitol97.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":"2021-06-04T16:49:38.000Z","updated_at":"2021-06-06T23:00:41.000Z","dependencies_parsed_at":null,"dependency_job_id":"ddcbd274-480d-4c1d-a41e-5c34e30cc5c1","html_url":"https://github.com/ulitol97/spellchecker","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulitol97%2Fspellchecker","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulitol97%2Fspellchecker/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulitol97%2Fspellchecker/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulitol97%2Fspellchecker/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ulitol97","download_url":"https://codeload.github.com/ulitol97/spellchecker/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247208370,"owners_count":20901570,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["cpp","levenshtein-distance","spellcheck"],"created_at":"2024-10-07T21:04:06.334Z","updated_at":"2025-04-04T16:19:46.570Z","avatar_url":"https://github.com/ulitol97.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Spellchecker (Levenshtein)\n\nDemo of a spellchecker using [Levenshtein Distances](https://en.wikipedia.org/wiki/Levenshtein_distance) to correct the\nuser's input while suggesting new words.\n\nThis project implements the three most common ways of computing the edit distance between words:\n\n1. [Recursive method](https://en.wikipedia.org/wiki/Levenshtein_distance#Recursive): inefficient and slowest way.\n2. [Wagner–Fischer algorithm](https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm) (full-matrix variant):\n   enhancement over the recursive method using a matrix to cache repetitive computations.\n3. Wagner–Fischer algorithm (single-row variant): further enhancement over the matrix method storing only the most\n   significant data at a time.\n\nThe distance between words is later used to compare a given input against a dictionary and make suggestions, in the same\nmanner most modern text processors do. Word comparisons are run in parallel for enhanced performance.\n\n## Compiling and running\n\n### Getting the executable\n\n- Build from source:\n    1. Run `cmake .` inside the project folder to generate the _Makefile_.\n    2. Run `make` inside the project folder to generate the binaries.\n    3. Run the executable named _spellchecker_.\n\n\n- Or download the linux executable from the [_bin_](https://github.com/ulitol97/spellchecker/tree/main/bin) folder.\n\n### Program usage\n\nThe executable accepts several arguments:\n\n- `-h`, `--help`: Show the program's help menu.\n- `-d`, `--dict`: Relative path of the dictionary to be used. Defaults to `dictionary.txt`.\n- `-s`, `--suggestions`: Number of words suggested by the spellchecker. Defaults to 5.\n\nOnce running, select the algorithm you want the spellchecker to use and start entering words to receive feedback.\n\n## References\n\n- Levenshtein distance algorithm samples:\n    - [Recursive and matrix variants](https://en.wikipedia.org/wiki/Levenshtein_distance#Computing_Levenshtein_distance)\n    - [Single row variant](https://rosettacode.org/wiki/Levenshtein_distance#C.2B.2B)\n- [Dictionaries](http://www.gwicks.net/dictionaries.htm) used for testing\n- [Inspiration](https://www.youtube.com/watch?v=Cu7Tl7FGigQ) for this demo project\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fulitol97%2Fspellchecker","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fulitol97%2Fspellchecker","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fulitol97%2Fspellchecker/lists"}