js-levenshtein vs Quickenshtein

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

Quickenshtein

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

Text processing levenshtein-distance string-distance Simd hardware-intrinsics Threading edit-distance Levenshtein

Source Code

Suggest alternative

Edit details

SurveyJS - Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App

With SurveyJS form UI libraries, you can build and style forms in a fully-integrated drag & drop form builder, render them in your JS app, and store form submission data in any backend, inc. PHP, ASP.NET Core, and Node.js.

surveyjs.io

featured

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

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

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

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.

What are some alternatives?

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

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

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

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

StringDistances.jl - String Distances in Julia

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

JavaPermutationTools - A Java library for computation on permutations and sequences

dice-coefficient - Sørensen–Dice coefficient

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