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.

Distance is a Coffeescript for calculating distances between strings.

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

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

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.

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

Levenshtein distance calculator

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

Levenshtein distance for an array.

A lightweight implementation of the Levenshtein distance algorithm.

returns the closest suggestion from an inputted array using levenshtein distance

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.

Find the best matching word using the first smallest Levenshtein distance

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

The "Levenshtein Distance" algorithm

diff strings and lists with levenshtein distance