dedupe_levenshtein_search
Python search module for fast approximate string matching
Python search module for fast approximate string matching
To install this package, run one of the following:
Levenshtein_search is a Python module that stores any number of documents as ternary search trees. It performs fuzzy searches for words in a document that are d distance away from a query word.
Summary
Python search module for fast approximate string matching
Last Updated
Jun 26, 2024 at 09:06
License
MIT
Total Downloads
22.5K
Supported Platforms
GitHub Repository
https://github.com/dedupeio/Levenshtein_search