JSPM

Measure the difference between two strings using the Levenshtein distance algorithm

[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)

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

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

Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers

Simply sort by similarity, starring Levenshtein via leven

Finds similar word(s) in a list of words

Git like diff between two strings, using the Levenshtein distance algorithm

provides functions for comparing and calculating the similarity between two strings using various methods.

Find the difference between two arrays and compute the minimal steps to transform one array to another.

Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first

String's percent similarity

Compare Strings Similarity Based on Levenshtein Distance Algorithm

Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name

Measure the difference between two strings using the Levenshtein distance algorithm

Over simplistic fuzzy search library using Damerau-Levenshtein and optionally the keyboard layout to calculate distances.

Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.

Fast implementation of the Levenshtein edit distance