Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/lc-rezende/python-edit-distance
Implementation of Levenshtein distance through python editdistance lib to evaluate how distant different terms are.
https://github.com/lc-rezende/python-edit-distance
editdistance levenshtein-distance python
Last synced: about 4 hours ago
JSON representation
Implementation of Levenshtein distance through python editdistance lib to evaluate how distant different terms are.
- Host: GitHub
- URL: https://github.com/lc-rezende/python-edit-distance
- Owner: lc-rezende
- Created: 2017-09-25T17:30:39.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2024-10-29T16:11:40.000Z (19 days ago)
- Last Synced: 2024-10-30T02:18:04.450Z (19 days ago)
- Topics: editdistance, levenshtein-distance, python
- Language: Python
- Homepage: https://pypi.org/project/editdistance/
- Size: 1000 Bytes
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
#### Thanks to [Hiroyuki Tanaka](https://github.com/roy-ht) and his implementation of edit distance (Levenshtein distance) available [here](https://github.com/roy-ht/editdistance).
---This library simply implements [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) with C++ and Cython.
The algorithm used in this library is proposed by Heikki Hyyrö, "Explaining and extending the bit-parallel approximate string matching algorithm of Myers", (2001)