A minimal algorithm for computing Levenshtein distance in JavaScript.

# Using npm
npm install --save levdist

# Using yarn
yarn add levdist

// Dependencies
var LevDist = require("levdist");

// Output the levdist of these two words
console.log(LevDist("live", "life"));
// => 1

There are few ways to get help:

1. Please post questions on Stack Overflow. You can open issues with questions, as long you add a link to your Stack Overflow question.
2. For bug reports and feature requests, open issues. 🐛
3. For direct and quick help, you can use Codementor. 🚀

Calculates the Levenshtein distance.

• String s: The first string.
• String t: The second string.

• Number The Levenshtein distance value.

Have an idea? Found a bug? See how to contribute.

I open-source almost everything I can, and I try to reply to everyone needing help using these projects. Obviously, this takes time. You can integrate and use these projects in your applications for free! You can even change the source code and redistribute (even resell it).

However, if you get some profit from this or just want to encourage me to continue creating stuff, there are few ways you can do it:

• Starring and sharing the projects you like 🚀

• —I love books! I will remember you after years if you buy me one. 😁 📖

• —You can make one-time donations via PayPal. I'll probably buy a coffee tea. 🍵

• —Set up a recurring monthly donation and you will get interesting news about what I'm doing (things that I don't share with everyone).

• Bitcoin—You can send me bitcoins at this address (or scanning the code below): 1P9BRsmazNQcuyTxEqveUsnf5CERdq35V6

  

Thanks! ❤️

If you are using this library in one of your projects, add it in this list. ✨

• line-diff
• levenshtein-array

MIT © Ionică Bizău