Levenshtein Distance
Showing 5 of 5 projects
Fuzzy string matching library for Python that calculates similarity between strings using Levenshtein Distance.
A Python library for computing distances between sequences with 30+ algorithms, pure Python implementation, and optional external libraries for speed.
A Java library implementing various string similarity and distance algorithms like Levenshtein, Jaro-Winkler, and n-gram methods.
A Python library for approximate and phonetic string matching, implementing algorithms like Levenshtein distance and Soundex.
A Rust library for compact ordered sets and maps using finite state transducers, enabling fast searches and range queries.
Related Tags
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.