Fastest Levenshtein distance implementation in JS.

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

Measure the difference between two strings using the Levenshtein distance algorithm

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

A minimal algorithm for computing Levenshtein distance in JavaScript.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.

Uses Levenshtein Distance to find the closest string match or matches in an array

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

Levenshtein distance for an array.

Levenshtein distance calculator

A lightweight implementation of 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.

returns the closest suggestion from an inputted array using levenshtein distance

Find the best matching word using the first smallest Levenshtein distance

Advanced fuzzy search library with Levenshtein distance, n-gram indexing, and Web Worker support

The "Levenshtein Distance" algorithm

diff strings and lists with levenshtein distance

Blazing-fast Levenshtein distance with bit-parallel Myers algorithm and early exits.