Quickenshtein VS Java String Similarity

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

Quickenshtein

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support (by Turnerj)

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)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Quickenshtein Java String Similarity
0 0
272 2,654
- -
4.7 0.0
5 months 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.

Quickenshtein

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

We haven't tracked posts mentioning Quickenshtein yet.
Tracking mentions began in Dec 2020.

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 Quickenshtein and Java String Similarity you can also consider the following projects:

Pliant - [Moved to: https://github.com/patrickhuber/Pliant]

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

StringDistances.jl - String Distances in Julia

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

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

Java - All Algorithms implemented in Java

js-levenshtein - The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

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

polyleven - Fast Levenshtein Distance Library for Python 3

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

JavaPermutationTools - A Java library for computation on permutations and sequences