polyleven

Fast Levenshtein Distance Library for Python 3 (by fujimotos)

Polyleven Alternatives

Similar projects and alternatives to polyleven based on common topics and language

  • 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.

  • SymSpell

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

  • InfluxDB

    Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

    InfluxDB logo
  • 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 ...

  • RapidFuzz

    Rapid fuzzy string matching in Python using various string metrics

  • lev

    Levenshtein distance function as C Extension for Python 3 (by duranbe)

  • SaaSHub

    SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives

    SaaSHub logo
NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better polyleven alternative or higher similarity.

polyleven reviews and mentions

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.

Stats

Basic polyleven repo stats
1
76
10.0
over 1 year ago

fujimotos/polyleven is an open source project licensed under MIT License which is an OSI approved license.

The primary programming language of polyleven is C.


Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com