npm-similarity
Returns a difference between two strings using soundex, levenshtein distance or both.
Returns a difference between two strings using soundex, levenshtein distance or both.
To find similarity between two words/string
Check the phishy equality of a string
this library implements the edit distance algorithm (levenshtein original operation) to predict the correct spelling
Compute the Levenshtein distance between two strings.
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.
Group similar items together.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fast implementation of the Levenshtein edit distance
Levenshtein algorithm module
MAM Helpers
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two 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.
Simple package to implement levenshtein distance algorithm in typescript