Este pacote oferece uma coleção de algoritmos úteis relacionados ao cálculo de similaridade de strings utilizando o algoritmo de Levenshtein. Ideal para desenvolvedores que precisam comparar strings de forma eficiente e precisa, ele inclui funções avançad
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fastest Levenshtein distance implementation in JS.
Levenshtein edit distance
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fast and tiny fuzzy-search utility
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.
TypeScript definitions for js-levenshtein
TypeScript definitions for fast-levenshtein
Javascript implementation of the L-diggity.
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Match human-quality input to potential matches by edit distance.
mirror of js-levenshtein, bundled and exposed as ES module
Measure the difference between two strings using the Levenshtein distance algorithm
library for simularity identification
TypeScript definitions for damerau-levenshtein
A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.
Logfmt transport for pino