leven
Measure the difference between two strings using the Levenshtein distance algorithm
Measure the difference between two strings using the Levenshtein distance algorithm
[![npm-version](https://img.shields.io/npm/v/levenary.svg)](https://www.npmjs.com/package/levenary) [![github-actions](https://github.com/tanhauhau/levenary/workflows/CI/badge.svg)](https://github.com/tanhauhau/levenary/actions)
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Simply sort by similarity, starring Levenshtein via leven
Uses Levenshtein Distance to find the closest string match or matches in an array
Measure the difference between two strings using the Levenshtein distance algorithm
Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first
Find the difference between two arrays and compute the minimal steps to transform one array to another.
Measure the difference between two strings using the Levenshtein distance algorithm
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
Fast implementation of the Levenshtein edit distance
Finds similar word(s) in a list of words
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
provides functions for comparing and calculating the similarity between two strings using various methods.
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.