Search

leven

Measure the difference between two strings using the Levenshtein distance algorithm

v4.0.0 URL: https://unpkg.com/leven@4.0.0/index.js

OpenBrowse Files

levenlevenshteindistancealgorithmstringdifferencedifffastfuzzysimilarsimilaritycomparecomparisonedittextmatchmatching

is-arrayish

Determines if an object can be used as an array

v0.3.2 URL: https://unpkg.com/is-arrayish@0.3.2/index.js

OpenBrowse Files

isarrayducktypearrayishsimilarprotoprototypetype

fastest-levenshtein

Fastest Levenshtein distance implementation in JS.

v1.0.16 URL: https://unpkg.com/fastest-levenshtein@1.0.16/mod.js

OpenBrowse Files

levenshteindistancefastfastesteditstringsimilarityalgorithmmatchcomparisonfuzzysearchstringmatchingsimilarnodedifference

js-levenshtein

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

v1.1.6 URL: https://unpkg.com/js-levenshtein@1.1.6/index.js

OpenBrowse Files

levenshteindistancealgorithmalgostringdifferencedifffastfuzzysimilarsimilaritycomparecomparisonedittextmatchmatching

levenary

[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)

v1.1.1 URL: https://unpkg.com/levenary@1.1.1/index.js

OpenBrowse Files

levenlevenshteindistancearraystringalgorithmalgostringdifferencedifffastfuzzysimilarsimilaritycomparecomparisonedittextmatchmatching