This project provides a highly efficient JavaScript implementation of the Levenshtein distance algorithm, optimized for speed and memory usage. It is distributed as an ES module and is intended for developers who need to measure string similarity in applications like spell-checking, fuzzy searching, or data deduplication.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of 43081j/js-levenshtein
ESLint JavaScript language implementation
output coverage reports using Node.js' built in coverage
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
TypeScript is a language for application scale JavaScript development
Tooling which enables you to use TypeScript with ESLint
Support the repos that depend on this repository
Top contributors
gustf
27 contributions
43081j
8 contributions
stramel
2 contributions
georgyberdyshev
1 contributions
tech6hutch
1 contributions
mvasilkov
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet