https://github.com/hamedzarei/nlp-min-edit-distance
Find the best match for a token word with dictionary via min edit distance and levenshtein
https://github.com/hamedzarei/nlp-min-edit-distance
levenshtein-algorithm levenshtein-distance min-edit-distance nlp python
Last synced: 3 months ago
JSON representation
Find the best match for a token word with dictionary via min edit distance and levenshtein
- Host: GitHub
- URL: https://github.com/hamedzarei/nlp-min-edit-distance
- Owner: hamedzarei
- Created: 2018-05-04T16:36:00.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2018-05-04T16:43:24.000Z (about 7 years ago)
- Last Synced: 2024-12-31T13:42:08.743Z (5 months ago)
- Topics: levenshtein-algorithm, levenshtein-distance, min-edit-distance, nlp, python
- Language: Python
- Homepage:
- Size: 1.95 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# nlp-min-edit-distance
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