Measure the difference between two strings with the fastest JS implementation of the Levenshtein distance algorithm
Installations
Developer Guide
Typescript
No
Module System
ESM
Min. Node Version
^12.20.0 || ^14.13.1 || >=16.0.0
Node Version
16.2.0
NPM Version
7.13.0
Score
99.5
Supply Chain
73.6
Quality
75.5
Maintenance
100
Vulnerability
100
License
Releases
Contributors
Unable to fetch Contributors
Languages
JavaScript (97.92%)
TypeScript (2.08%)
Developer
sindresorhus
Download Statistics
Total Downloads
5,136,587,501
Last Day
5,091,783
Last Week
23,158,092
Last Month
101,366,690
Last Year
1,281,092,300
GitHub Statistics
719 Stars
35 Commits
27 Forks
14 Watching
1 Branches
7 Contributors
Bundle Size
643.00 B
Minified
377.00 B
Minified + Gzipped
Sponsor this package
Maintainers
Package Meta Information
Latest Version
4.0.0
Package Id
leven@4.0.0
Size
2.40 kB
NPM Version
7.13.0
Node Version
16.2.0
Publised On
10 Aug 2021
Other packages similar to leven
fast-levenshtein
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
damerau-levenshtein
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
fastest-levenshtein
Fastest Levenshtein distance implementation in JS.
js-levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.