Levenshtein Packages

A lightweight implementation of the Levenshtein distance algorithm.

The fastest JS implementation of the Damerau-Levenshtein edit distance

An implementation of weighted Damerau–Levenshtein distance.

Simply sort by similarity, starring Levenshtein via leven

🚀 The fastest and easiest「didyoumean」in the universe via levenshtein algorithm

NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings

A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).

String and tree edit distance

Diff Match and Patch

Fastest Levenshtein distance implementation in JS.

Node.js bindings for the levenshtein-sse lib

Search for a malformed string. Think of Levenshtein distance but in search.

Finds and fixes common and not so common broken named HTML entities, returns ranges array of fixes

Sort array of strings by Levenshtein (Sift4) distance

Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.

Various utilities regarding Levenshtein transducers.

Get Damerau-Levenshtein distance between strings.

An implementation of Levenshtein string distance in JS

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

coming soon