fastest-levenshtein

Fastest Levenshtein distance implementation in JS.
OpenBrowse Files
levenshteindistancefastfastesteditstringsimilarityalgorithmmatchcomparisonfuzzysearchstringmatchingsimilarnodedifference

didyoumean2

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

leven

Measure the difference between two strings using the Levenshtein distance algorithm
OpenBrowse Files
levenlevenshteindistancealgorithmstringdifferencedifffastfuzzysimilarsimilaritycomparecomparisonedittextmatchmatching

similify

"Similify is a versatile JavaScript package designed to simplify and enhance similarity comparisons in various contexts. Whether you're comparing words, objects, arrays, or exploring string lengths and numerical ranges, Similify provides an easy-to-use in
OpenBrowse Files
similaritycomparisonmatchinganalyzecomparesimilarity percentagestring similarityobject similarityarray similaritythresholdfuzzy matchingstring matchingpattern matchingsimilarity analysistext matchingdata comparisonmatch percentageversatile similarityeasy comparisonsmart matching

js-levenshtein

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