Levenshtein Packages

Dynamic word set with accelerated exact and fuzzy search based on trie data structure.

Distance between given email and popular domains

Returns a difference between two strings using soundex, levenshtein distance or both.

Check the phishy equality of a string

this library implements the edit distance algorithm (levenshtein original operation) to predict the correct spelling

Suggests which tasks you wanted to call unless you made a typo

Compute the Levenshtein distance between two strings.

Suggest email based on the Levenshtein distance

React hook for suggest email based on the Levenshtein distance

Get Levenshtein distance between strings.

Word compare gives you the most closely related words to an input string. If you have a list of strings, word compare can give you the most closely related list elements to a string input.

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.

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

Este pacote oferece uma coleção de algoritmos úteis relacionados ao cálculo de similaridade de strings utilizando o algoritmo de Levenshtein. Ideal para desenvolvedores que precisam comparar strings de forma eficiente e precisa, ele inclui funções avançad

small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance

Levenshtein algorithm module

Fast implementation of the Levenshtein edit distance

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

MAM Helpers

Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support