fast-levenshtein - Levenshtein algorithm in Javascript
Last updated
Last updated
An efficient Javascript implementation of the Levenshtein algorithm with locale-specific collator support.
Works in node.js and in the browser.
Better performance than other implementations by not needing to store the whole matrix (more info).
Locale-sensitive string comparisions if needed.
Comprehensive test suite and performance benchmark.
Small: <1 KB minified and gzipped
Install using npm:
Using bower:
If you are not using any module loader system then the API will then be accessible via the window.Levenshtein
object.
Default usage
Locale-sensitive string comparisons
It supports using Intl.Collator for locale-sensitive string comparisons:
To build the code and run the tests:
Thanks to Titus Wormer for encouraging me to do this.
Benchmarked against other node.js levenshtein distance modules (on Macbook Air 2012, Core i7, 8GB RAM):
You can run this benchmark yourself by doing:
If you wish to submit a pull request please update and/or create new tests for any changes you make and ensure the grunt build passes.
See CONTRIBUTING.md for details.
MIT - see LICENSE.md