Distance is a Coffeescript for calculating distances between strings.

Scoring-based fuzzy search with Myers Levenshtein distance and radix/tim sort ranking. Part of the ex-* ecosystem.

Find closest matches to search query based on Levenshtein distance

Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein

Match human-quality input to potential matches by edit distance.

A much faster than the naïve Levenshtein distance algoritme

A tiny implementation of the Levenshtein edit distance algorithm.

Fast and tiny fuzzy-search utility

A modern implementation of the Levenshtein distance algorithm for comparing the distance between two strings, written in Rust for maximum performance, security, and compatability.

Javascript implementation of the L-diggity.

similarity based on Levenshtein distance

library for simularity identification

The Levenshtein Distance Calculator is a utility class that calculates the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions or substitutions) required to

Balochi spellchecker using BK-tree and Levenshtein distance

The Levenshtein distance metric for node and browser.

Fastest Levenshtein distance implementation in JS.

Calculate the Levenshtein distance between two strings.

Measure the difference between two strings using the Levenshtein distance algorithm

A very fast JavaScript implementation of Levenshtein distance for the k <= 1 case.

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