Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support (by Turnerj)
Pliant
[Moved to: https://github.com/patrickhuber/Pliant] (by patrickhuber)
DISCONTINUED
Our great sponsors
Quickenshtein | Pliant | |
---|---|---|
0 | 1 | |
272 | 20 | |
- | - | |
4.7 | 0.0 | |
5 months ago | about 3 years 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.
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.
Pliant
Posts with mentions or reviews of Pliant.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning Pliant yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing Quickenshtein and Pliant you can also consider the following projects:
StringDistances.jl - String Distances in Julia
js-levenshtein - The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
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 ...
JavaPermutationTools - A Java library for computation on permutations and sequences