andreasmadsen/levenshtein-benchmark

Higher-order functions and common patterns for asynchronous code

Takes an array of numbers and calculates some descriptive statistics

Flexible ascii progress bar

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

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.

Javascript implementation of the L-diggity.

A much faster than the naïve Levenshtein distance algoritme

A minimal algorithm for computing Levenshtein distance in JavaScript.

Compute the Levenshtein distance for string comparison