The "Levenshtein Distance" algorithm
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fastest Levenshtein distance implementation in JS.
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for js-levenshtein
Levenshtein edit distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for fast-levenshtein
Javascript implementation of the L-diggity.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
A tiny implementation of the Levenshtein edit distance algorithm.
mirror of js-levenshtein, bundled and exposed as ES module
TypeScript definitions for damerau-levenshtein
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Fast and tiny fuzzy-search utility
A library implementing different string similarity
TypeScript definitions for levenshtein
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
library for simularity identification
returns the closest suggestion from an inputted array using levenshtein distance
Library for NLU (Natural Language Understanding) done in Node.js
String and tree edit distance