Job scheduling for Node.js with overlap prevention, distributed coordination, and background tasks. Zero dependencies, written in TypeScript.
A node.js redlock implementation for distributed redis locks
A distributed event emitter, both for client and nodejs servers
Measure the difference between two strings using the Levenshtein distance algorithm
Fastest Levenshtein distance implementation in JS.
Distributed task scheduler and rate limiter
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
A tiny implementation of the Levenshtein edit distance algorithm.
Sample from the Guassian distribution
[](https://www.npmjs.com/package/youch-redist)
A minimal algorithm for computing Levenshtein distance in JavaScript.
Compute the Levenshtein distance for string comparison
The "Levenshtein Distance" algorithm
General natural language (tokenizing, stemming (English, Russian, Spanish), part-of-speech tagging, sentiment analysis, classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.
a cli tool and library to create development and production versions for the browser
A simple tool for selecting a dist tag for npm publish.
Interactive release task for Git repositories. Optionally release a build to distribution/component repository.
A sort-imports rule that properly distinguishes between ES6 import types.
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Distribution version of sails.io.js for browsers, including bundled socket.io-client.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Lightweight file-to-file transformer