@doubletrade/fastest-levenshtein
Fastest Levenshtein distance implementation in JS.
Fastest Levenshtein distance implementation in JS.
struck-egg-laid
this package lets you compare two strings and give you how much percent they are similar
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
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 framework to build tiny apps
Random colors are tools for generating attractive color, similar colors, color palettes or any random colors.
zaadevwa
provides functions for comparing and calculating the similarity between two strings using various methods.
A library for comparing strings and determining their similarity.
A fork of js-levenshtein by gustf adding a limit to the distance calculation.
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
returns similarities and differences between two arrays
**Rype** is not just another validation package; it's a lightning-fast, type-optimized solution designed specifically for TypeScript projects. Unlike other libraries, Rype has been fine-tuned to fully harness the power of TypeScript, providing unparallele
potatoes-angry-let-arrange
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
An extension of Set meant for checking similarity of strings. Also offers static functions that can be used seperately from the SimilaritySet.