Quickenshtein vs JavaPermutationTools

Quickenshtein

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

Source Code

Suggest alternative

Edit details

JavaPermutationTools

A Java library for computation on permutations and sequences (by cicirello)

Permutations Sequences permutation-distance-metrics string-distance permutation-distance edit-distance

Source Code

jpt.cicirello.org

Suggest alternative

Edit details

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

Quickenshtein		JavaPermutationTools
	Project
-	Mentions	3
273	Stars	7
-	Growth	-
4.7	Activity	8.2
6 months ago	Latest Commit	5 days ago
C#	Language	Java
MIT License	License	GNU General Public License v3.0 only

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.

JavaPermutationTools

Posts with mentions or reviews of JavaPermutationTools. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-08-18.

On JitPack's use of git repository name as Maven artifactId
2 projects | dev.to | 18 Aug 2022

JavaPermutationTools - A Java library for computation on permutations and sequences
generate-sitemap action
4 projects | dev.to | 14 Sep 2020

Java Permutation Tools

What are some alternatives?

When comparing Quickenshtein and JavaPermutationTools you can also consider the following projects:

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

generate-sitemap - Generate an XML sitemap for a GitHub Pages site using GitHub Actions

StringDistances.jl - String Distances in Julia

Chips-n-Salsa - A Java library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms

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

cicirello.github.io

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