A SpellChecker with Ternary Search Tree
-
Updated
Aug 7, 2018 - C++
A SpellChecker with Ternary Search Tree
Spell Checker using a Hash Table
Ever wondered how spell checkers work? I actually found them quite fascinating, so I decided to build one myself. This project is a spell checker implemented in C++ using the strategy pattern.
A simple server which checks words with Uzbek dictionary, gives suggestions or adds words to the dictionary.
A user-friendly variable cipher with a catch*
Modern spell checking library - accurate, fast, multi-language
uses linux pipes to run spellcheck on a text file using multiple smaller scripts
Spellchecking using Trie ADT. Users can manipulate the trie by adding, deleting words and finding similar words (imitation of spell recommendations feature)).
It is a spell checker implemented using bloom filters that highlights spelling mistakes. A file is taken as an input which is checked against the provided dictionary highlighting the words not present in the dictionary.
Application of Bloom Filter to check spelling of words stored in a file
Super-simple C language interface and DLL library for easy access to Windows 8+ system speller
Hunspell for PowerBuilder
DSAP Course Assignments 2022-2023
Utilizes single-row version of Levenshtein Edit Distance to spell check.
Spell checker and corrector, written in C++17
C++ notepad with fast spell-checking capability.
Add a description, image, and links to the spellchecker topic page so that developers can more easily learn about it.
To associate your repository with the spellchecker topic, visit your repo's landing page and select "manage topics."