:v: A minimal algorithm for computing Levenshtein distance in JavaScript.
JavaScript
4
1
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the repos that depend on ionicabizau/node-levdist
Compare strings line by line.
Levenshtein distance for an array.
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet