levdist

levdist

A minimal algorithm for computing Levenshtein distance in JavaScript.

:cloud: Installation

$ npm i --save levdist

:clipboard: Example

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

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

:question: Get Help

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. :bug:
3. For direct and quick help from me, you can use Codementor. :rocket:

:memo: Documentation

LevDist(s, t)

Calculates the Levenshtein distance.

Params

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

Return

• Number The Levenshtein distance value.

:yum: How to contribute

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

:sparkling_heart: Support my projects

I open-source almost everything I can, and I try to reply 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 :rocket:

• —You can make one-time donations via PayPal. I'll probably buy a coffee tea. :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! :heart:

:dizzy: Where is this library used?

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

• levenshtein-array—Levenshtein distance for an array.
• line-diff—Compare strings line by line.

:scroll: License

MIT © Ionică Bizău