The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for js-levenshtein
mirror of js-levenshtein, bundled and exposed as ES module
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
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
Levenshtein edit distance
TypeScript definitions for fast-levenshtein
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Javascript implementation of the L-diggity.
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
A tiny implementation of the Levenshtein edit distance algorithm.
A library implementing different string similarity
TypeScript definitions for damerau-levenshtein
Fast and tiny fuzzy-search utility
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
TypeScript definitions for levenshtein
Measure the difference between two strings using the Levenshtein distance algorithm
String and tree edit distance
Match human-quality input to potential matches by edit distance.
library for simularity identification
Calculates the Levenshtein (edit) distance between two strings.
No description provided.
No description provided.