Levenshtein-distance Packages

Lightning-fast Wasm-compiled levenshtein library.

A simple ES6 proxy wrapper that enables you to make typos in property names.

A collection of string comparisons algorithms

A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.

A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.

lightweight npm package to calculate string similarity

Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power