qlevens
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
QWERTY-Adjusted Levenshtein Distance computation on JS
Ensemble de methodes prototypes utiles
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Suggest fixing misspelled, typos, matching human-quality input
A tiny implementation of the Levenshtein edit distance algorithm.
A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.
Compare strings with best suitable algorithm for your need
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Modded version of string-similarity.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.
this package lets you compare two strings and give you how much percent they are similar
A Javascript library to compare and transform strings.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Simple package to implement levenshtein distance algorithm in typescript
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.
Various utilities regarding Levenshtein transducers.
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.