node-fast-levenshtein
efficient implementation of Levenshtein algorithm
Description
In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. This is pure JavaScript implementation for Node.js. Node.js is an event-based server-side JavaScript engine.Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://github.com/hiddentao/fast-levenshtein
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install node-fast-levenshtein