Levenshtein Packages

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

General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.

Distance between given email and popular domains

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

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

Fastest Levenshtein distance implementation in JS.

this package lets you compare two strings and give you how much percent they are similar

A Javascript library to compare and transform strings.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Compare strings with best suitable algorithm for your need

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.