Find the best match for a token word with dictionary via min edit distance and levenshtein You can set coef=2 as default value is, and find best match via levenshtein algorithm Also in this code you can find back track matrix and distance matrix for pairs of words
-
Notifications
You must be signed in to change notification settings - Fork 0
hamedzarei/nlp-min-edit-distance
About
Find the best match for a token word with dictionary via min edit distance and levenshtein
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published