8+ times faster implementation of algorithm with 19+ million weekly downloads!

I have just published a new node js package called "node-Levenshtein". It computes the Levenshtein-/edit distance of two strings. There are already plenty of similar packages (js-levenshtein, fast-levenshtein, leven, etc), with over 19 million weekly downloads collectively. However, my package is a lot faster - In fact, in some cases 8 times faster than the closest competitor "js-levensthein". Feel free to try it out and see for yourself. It is incredibly fast.I hope you find this interesting - please star my repo if you do.This image shows the relative performance between node-levenshtein and js-levenshtein (the 2nd fastest). As you can see, node-levenshtein is a lot faster for small strings, but especially for long strings (8x faster when N = 1024) where N is the length of the pair of strings.https://i.redd.it/ug9nvbg5c6t31.png

Submitted October 17, 2019 at 11:11PM by ka-weihe