@linkdotnet/stringoperations
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
@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.
Finds degree of similarity between strings, based on Dice's Coefficient.
Word compare gives you the most closely related words to an input string. If you have a list of strings, word compare can give you the most closely related list elements to a string input.
A fork of js-levenshtein by gustf adding a limit to the distance calculation.
A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.
provides functions for comparing and calculating the similarity between two strings using various methods.
Various utilities regarding Levenshtein transducers.
Calculates the Levenshtein (edit) distance between two strings.
Collection of usefull methods for testing on the browser console
Searches a haystack for all best possible matches of needle, returning their position and Levenshtein distance.
A package for playing around with different dictionaries. Supports Swedish and English.
Find the minimal edit path between two generic arrays.
An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fastest Levenshtein distance implementation in JS.
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power