ka-weihe

ka-weihe/fastest-levenshtein

The fastest implementation of Levenshtein distance in JS/TS.

TypeScript
762
27
MIT License

Fastest-Levenshtein is a Node.js and Deno library that provides the fastest implementation of the Levenshtein distance algorithm for measuring the difference between two strings. It's designed for developers who need to efficiently calculate edit distances between strings, with additional functionality to find the closest matching string from an array. The library outperforms alternatives like js-levenshtein and leven in benchmarks, making it ideal for applications requiring high-performance string comparison operations.

Total donated
Undistributed
Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies

Support the repos that depend on this repository

Top contributors

ka-weihe's profile
ka-weihe
124 contributions
RoXuS's profile
RoXuS
3 contributions
fzzle's profile
fzzle
2 contributions
G07cha's profile
G07cha
1 contributions
ghoullier's profile
ghoullier
1 contributions
sallar's profile
sallar
1 contributions
danias's profile
danias
1 contributions
binjospookie's profile
binjospookie
1 contributions

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet