The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
JavaScript
1
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
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Benchmark your code.
TypeScript is a language for application scale JavaScript development
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
Support the repos that depend on 43081j/js-levenshtein
ESLint plugin for Web Components
> Looking for v1.x readme? It is available on [V1 Branch](https://github.com/WalletConnect/web3modal/tree/V1)
ESLint plugin for Web Components
Top contributors
gustf
27 contributions
43081j
7 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