Gathering detailed insights and metrics for fastest-levenshtein
Gathering detailed insights and metrics for fastest-levenshtein
Gathering detailed insights and metrics for fastest-levenshtein
Gathering detailed insights and metrics for fastest-levenshtein
@doubletrade/fastest-levenshtein
Fastest Levenshtein distance implementation in JS.
node-levenshtein
Fastest Levenshtein distance implementation in JS.
cached-levenshtein
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power
qlevens
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
The fastest implementation of Levenshtein distance in JS/TS.
Typescript
Module System
Min. Node Version
Node Version
NPM Version
TypeScript (100%)
Built with Next.js • Fully responsive • SEO optimized • Open source ready
Total Downloads
1,966,336,301
Last Day
687,849
Last Week
15,149,225
Last Month
66,141,456
Last Year
669,365,157
MIT License
723 Stars
134 Commits
24 Forks
5 Watchers
1 Branches
8 Contributors
Updated on Aug 31, 2025
Latest Version
1.0.16
Package Id
fastest-levenshtein@1.0.16
Unpacked Size
20.78 kB
Size
5.96 kB
File Count
14
NPM Version
8.14.0
Node Version
18.6.0