Refer to program-overview.pdf for the detailed explanation of the program and algorithm-report.pdf for the analysis of the algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
A project from Design of Algorithms subject that implements a spelling correction algorithm, using a hash function with separate chaining and move-to-front technique. This program involves calculating Levenshtein distances.
leolinardi/spelling-correction
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A project from Design of Algorithms subject that implements a spelling correction algorithm, using a hash function with separate chaining and move-to-front technique. This program involves calculating Levenshtein distances.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published