polyleven VS Java String Similarity

Compare polyleven vs Java String Similarity and see what are their differences.

polyleven

Fast Levenshtein Distance Library for Python 3 (by fujimotos)
levenshtein-distance
Source Code
ceptord.net
Suggest alternative
Edit details

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 ... (by tdebatty)
Text processing Java levenshtein-distance cosine-similarity string-distance damerau-levenshtein Distance distance-measure jaro-winkler similarity-measures Shingles Algorithm
Source Code
Suggest alternative
Edit details
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.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
polyleven Java String Similarity
1 -
76 2,654
- -
10.0 0.0
over 1 year ago almost 2 years ago
C Java
MIT License GNU General Public License v3.0 or later
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.

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.

Java String Similarity

Posts with mentions or reviews of Java String Similarity. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning Java String Similarity yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing polyleven and Java String Similarity you can also consider the following projects:

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.

TextDistance - 📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

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

go-edlib - 📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

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

Leetcode - Solutions to LeetCode problems; updated daily. Subscribe to my YouTube channel for more.

lev - Levenshtein distance function as C Extension for Python 3

Java - All Algorithms implemented in Java

StringDistances.jl - String Distances in Julia

interviews - Everything you need to know to get the job.

java-algorithms-implementation - Algorithms and Data Structures implemented in Java

Quickenshtein - Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

polyleven vs distlib Java String Similarity vs TextDistance polyleven vs SymSpell Java String Similarity vs go-edlib polyleven vs RapidFuzz Java String Similarity vs Leetcode polyleven vs lev Java String Similarity vs Java Java String Similarity vs StringDistances.jl Java String Similarity vs interviews Java String Similarity vs java-algorithms-implementation Java String Similarity vs Quickenshtein