Quickenshtein vs js-levenshtein

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

js-levenshtein

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings. (by gustf)

Levenshtein edit-distance

Source Code

Suggest alternative

Edit details

Our great sponsors

WorkOS - The modern identity platform for B2B SaaS

InfluxDB - Power Real-Time Data Analytics at Scale

SaaSHub - Software Alternatives and Reviews

Our great sponsors

Quickenshtein		js-levenshtein
	Project
-	Mentions	1
273	Stars	428
-	Growth	-
4.7	Activity	0.0
6 months ago	Latest Commit	almost 2 years ago
C#	Language	JavaScript
MIT License	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.

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.

js-levenshtein

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

Is SQLite available in the browser?
2 projects | /r/learnprogramming | 27 Jan 2022

You can write the algorithm from the pseudo code on Wikipedia, or use a library that already implemented it like: https://github.com/gustf/js-levenshtein

What are some alternatives?

When comparing Quickenshtein and js-levenshtein you can also consider the following projects:

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

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

StringDistances.jl - String Distances in Julia

fuzzball.js - Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.

JavaPermutationTools - A Java library for computation on permutations and sequences

sql.js - A javascript library to run SQLite on the web.

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

dice-coefficient - Sørensen–Dice coefficient