distlib VS polyleven

Compare distlib vs polyleven and see what are their differences.

distlib

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported. (by schiffma)
Sqlite3 Sqlite Extension levenshtein-distance damerau-levenshtein-distance longest-common-subsequence longest-common-substring jaro-winkler jaro-winkler-distance permutation subsets subsequence edit-distance edit-distance-algorithm
Source Code
Suggest alternative
Edit details

polyleven

Fast Levenshtein Distance Library for Python 3 (by fujimotos)
levenshtein-distance
Source Code
ceptord.net
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
distlib polyleven
2 1
20 76
- -
4.4 10.0
over 2 years ago over 1 year ago
C C
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

distlib

Posts with mentions or reviews of distlib. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-07-16.

polyleven

Posts with mentions or reviews of polyleven. We have used some of these posts to build our list of alternatives and similar projects.
  • Spellcheck and Levenshtein distance
    1 project | /r/learnmachinelearning | 15 Nov 2022
    polyleven is the fastest Levenshtein distance library I've been able to find. It also has a threshold parameter which can be used to speed up the calculations. That being said, I've had a lot more success speeding up the processing of large text datasets by converting the words to a vector space (using e.g. word2vec) then calculating euclidean distance, which is much faster than calculating Levenshtein distance (assuming you are using vectorized operations). The fastest solution would probably be to use approximate nearest neighbor search (see for example the faiss library), but again you'll have to embed your words in a vector space and you'll need to decide if this is viable for your use case.

What are some alternatives?

When comparing distlib and polyleven you can also consider the following projects:

sqlite-wf - Simple visual ETL tool

SymSpell - SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

go-sqlite-lite - SQLite driver for the Go programming language

Java String Similarity - Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

sqlite-createtable-parser - A parser for SQLite create table sql statements.

RapidFuzz - Rapid fuzzy string matching in Python using various string metrics

SQLite3MultipleCiphers - SQLite3 encryption extension with support for multiple ciphers

lev - Levenshtein distance function as C Extension for Python 3

esp32_arduino_sqlite3_lib - Sqlite3 Arduino library for ESP32

sqlite-gui - Lightweight SQLite editor for Windows

distlib vs sqlite-wf polyleven vs SymSpell distlib vs go-sqlite-lite polyleven vs Java String Similarity distlib vs sqlite-createtable-parser polyleven vs RapidFuzz distlib vs SQLite3MultipleCiphers polyleven vs lev distlib vs esp32_arduino_sqlite3_lib distlib vs sqlite-gui