QWERTY-Adjusted Levenshtein Distance computation on JS

A micro library that returns the Levenshtein distance bewteen lists of strings

Fuzzy search library based based on Damerau Levenshtein distance algorithm for Node.js

String and tree edit distance

javascript module for using levenshtein distance to search objects for a string

Simple search suggestion using the Levenshtein distance algorithm.

Weighted Damerau-Levenshtein and Levenshtein edit distance for Node.js with configurable operation costs.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.

Similarity between strings using levenshtein distance

General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.

Finds degree of similarity in list of array of objects , based on Dice's Coefficient, which is mostly better than Levenshtein distance.

General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.

TypeScript definitions for levenshtein

Fastest Levenshtein distance implementation in JS.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

> NodeJs levenshtein distance algorithm.

A really simple spelling corrector module based on the levenshtein distance between words.

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