- taking each word in text and computing all its possible variants that result from the following operations: * vowel substituion * symbols dubbing * reduction * insertion * combination of several operations
- selecting the best variant by computing the Hamming distance between variants and the original word
- or simply taking the most frequent word as found in the supplied corpus of texts
- PROFIT!!!
-
Notifications
You must be signed in to change notification settings - Fork 0
lizaku/CL_spellchecker
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
The spellchecker project for the CL course
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published