The fastest implementation of Levenshtein distance in JS/TS.
TypeScript
763
27
MIT License
Fastest-Levenshtein is a Node.js and Deno library that provides the fastest implementation of the Levenshtein distance algorithm for measuring the difference between two strings. It's designed for developers who need to efficiently calculate edit distances between strings, with additional functionality to find the closest matching string from an array. The library outperforms alternatives like js-levenshtein and leven in benchmarks, making it ideal for applications requiring high-performance string comparison operations.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of ka-weihe/fastest-levenshtein
TypeScript definitions for benchmark
TypeScript definitions for jest
TypeScript plugin for ESLint
An ESLint custom parser which leverages TypeScript ESTree
takes json-cov output into stdin and POSTs to coveralls.io
Pluggable eslint config for Node.js that you can import, extend and override
Import with sanity.
Additional ESLint's rules for Node.js
Runs prettier as an eslint rule
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Delightful JavaScript Testing.
General natural language (tokenizing, stemming (English, Russian, Spanish), part-of-speech tagging, sentiment analysis, classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
TypeScript is a language for application scale JavaScript development
Support the repos that depend on this repository
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet