Levenshtein Edit Distance: Algorithmic Approaches and Data Structures for Text Processing
-
Notifications
You must be signed in to change notification settings - Fork 0
Built a spell-checking tool as part of CSC 245 coursework. The system uses the Levenshtein edit distance algorithm to detect misspelled words and suggest the most similar alternatives from a dictionary of 100,000 entries.
JohnBacho/Data-Structures-Final-Project
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Built a spell-checking tool as part of CSC 245 coursework. The system uses the Levenshtein edit distance algorithm to detect misspelled words and suggest the most similar alternatives from a dictionary of 100,000 entries.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published