A modern implementation of the Levenshtein distance algorithm for comparing the distance between two strings, written in Rust for maximum performance, security, and compatability.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fastest Levenshtein distance implementation in JS.
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for js-levenshtein
Levenshtein edit distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for fast-levenshtein
Javascript implementation of the L-diggity.
A tiny implementation of the Levenshtein edit distance algorithm.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
mirror of js-levenshtein, bundled and exposed as ES module
TypeScript definitions for damerau-levenshtein
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Fast and tiny fuzzy-search utility
A library implementing different string similarity
TypeScript definitions for levenshtein
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
library for simularity identification
HTTP2 client, just with the familiar `https` API
returns the closest suggestion from an inputted array using levenshtein distance
Library for NLU (Natural Language Understanding) done in Node.js
No description provided.
No description provided.