In this project, we first investigate and pre-process some texts using nltk and then create a "speeling-recommender-function" based on three different approaches to calculate the distance between two words, i. e. Jaccard distance on the trigrams of the two words, Jaccard distance on the 4-grams of the two words and Damerau–Levenshtein distance and see how the different approaches can results in slightly different recommendations.
-
Notifications
You must be signed in to change notification settings - Fork 0
In this project, we first investigate and pre-process some texts using nltk and then create a "speeling-recommender-dunction" based on three different approaches to calculate the distance between two words, i. e. Jaccard distance on the trigrams of the two words, Jaccard distance on the 4-grams of the two words and Damerau–Levenshtein distance a…
Mehranov/Spelling-recommender-function-
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
In this project, we first investigate and pre-process some texts using nltk and then create a "speeling-recommender-dunction" based on three different approaches to calculate the distance between two words, i. e. Jaccard distance on the trigrams of the two words, Jaccard distance on the 4-grams of the two words and Damerau–Levenshtein distance a…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published