@magic-libraries/levenshtein
@magic library to calculate levenshtein distances.
@magic library to calculate levenshtein distances.
Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.
A fork of js-levenshtein by gustf adding a limit to the distance calculation.
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
Fast and tiny fuzzy-search utility
A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.
Calculates the Levenshtein (edit) distance between two strings.
Finds similar word(s) in a list of words
Levenshtein algorithm module
Fast implementation of the Levenshtein edit distance
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
MAM Helpers
FJS é uma biblioteca JavaScript que permite fazer buscas em um array de objetos com base em critérios de consulta flexíveis. Com o FJS, você pode realizar buscas complexas e precisas em seus dados usando operadores atômicos e operadores de busca avançados
Group similar items together.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance