Levenshtein Packages

A lib to compare similarity of two strings

Levenshtein distance implementation, with benchmarks, without dependencies

Levenshtein distance for an array.

an approximate string matching algorithm

Pure Javascript/Node.js in-memory full text search engine.

For private use.

All mismatch between two strings

Calculate the minimum number of changes needed to turn string A into B with the Levenshtein edit distance

A sort function for string arrays based on Levenshtein distance.

Perhaps the fastest Levenshtein Edit Distance measure ever

Return all word matches between two arrays within given Levenshtein distance

Algorithms for clustering strings

Distance between given email and popular domains

Module to compare similarity between strings / arrays.

Heuristic Distance/Similarity Between Strings (sift4 and levenshtein distance)

Find closest matches to search query based on Levenshtein distance

using wuzzy in the real world

Wrapper for edlib sequence alignment library

Customizable comparison of a string against another full string or substring.

Get Levenshtein distance between strings.