Measure the difference between two strings using the Levenshtein distance algorithm
Fastest Levenshtein distance implementation in JS.
A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
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 minimal algorithm for computing Levenshtein distance in JavaScript.
Compute the Levenshtein distance for string comparison
Javascript implementation of the L-diggity.
The "Levenshtein Distance" algorithm
General natural language (tokenizing, stemming (English, Russian, Spanish), part-of-speech tagging, sentiment analysis, classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
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.
mirror of js-levenshtein, bundled and exposed as ES module
TypeScript definitions for js-levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.