The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
JavaScript
2
1
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of 43081j/js-levenshtein
TypeScript plugin for ESLint
An ESLint custom parser which leverages TypeScript ESTree
TypeScript is a language for application scale JavaScript development
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Benchmark your code.
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
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