A fast, efficient spell checker using Levenshtein distance and BK-trees for fuzzy string matching. This project demonstrates advanced algorithm implementation with real-world application.
- Fast dictionary lookup using BK-tree data structure
- Levenshtein distance for edit distance calculation
- Damerau-Levenshtein distance (handles transpositions like "teh" → "the")
- BK-tree search for O(log n) fuzzy matching
- Suggestion generation with distance ranking
- Auto-correction for entire sentences
- Interactive demo mode