Levenshtein Packages

A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.

Ensemble de methodes prototypes utiles

A TypeScript npm package for finding near duplicate string pairs

[](https://www.npmjs.com/package/nested-fuzzy-search) [](https://opensource.org/licenses/MIT)

Potsiu! is a simple utility function that allows you to update indexes of specific positions on a string after you apply some transformation to it. It is quite handy if you have data in which string indexes are specified, but for some reason you want to p

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

QWERTY-Adjusted Levenshtein Distance computation on JS

Fast string matcher conceived for quick replies chat and multiple choice scenario.

Fast string matcher conceived for quick replies chat and multiple choice scenario.

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

Damerau Levenshtein that actually produces right results.

A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.

Group similar items together.

small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance

Levenshtein algorithm module

Fast implementation of the Levenshtein edit distance

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

MAM Helpers

Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support

Collection of usefull methods for testing on the browser console