Levenshtein Packages

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

Modded version of string-similarity.

Suggest fixing misspelled, typos, matching human-quality input

A tiny implementation of the Levenshtein edit distance algorithm.

A package for playing around with different dictionaries. Supports Swedish and English.

Searches a haystack for all best possible matches of needle, returning their position and Levenshtein distance.

Various utilities regarding Levenshtein transducers.

Library to interact con azure services

library to measure levenshtein distance between words

Simple package to implement levenshtein distance algorithm in typescript

provides functions for comparing and calculating the similarity between two strings using various methods.

A library for comparing strings and determining their similarity.

Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.

@magic library to calculate levenshtein distances.

A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.

A fork of js-levenshtein by gustf adding a limit to the distance calculation.

Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.

Fast and tiny fuzzy-search utility

A robust name matching library combining multiple algorithms for optimal performance

Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers