Implementation of: Linear Spelling check, BK-Tree, and SymSpell spelling checking algorithms on Arabic dictionary, in C++
The code mainly implements:
- Levenshtein distance
- Linear Spell Checking
- BK-Tree Spel Checking
- SymSpell Spell Checking
- Add better documentation and how-to-use
- Use static array (instead of vector) for suggested words -- with maximum number of suggested words
- Use static array of bytes instead of string.
- https://www.geeksforgeeks.org/bk-tree-introduction-implementation/
- https://towardsdatascience.com/symspell-vs-bk-tree-100x-faster-fuzzy-string-search-spell-checking-c4f10d80a078
- Engineer Tamer Ali from Asas El Qarar for his feedback on my code.
If you need to use the code and couldn't, please contact me: wmustafaawad@gmail.com