High-Performance Text Diff Motion Component based on Levenshtein diff algorithm. Make your text flow like water.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fastest Levenshtein distance implementation in JS.
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for js-levenshtein
Levenshtein edit distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
TypeScript definitions for fast-levenshtein
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
A tiny implementation of the Levenshtein edit distance algorithm.
Javascript implementation of the L-diggity.
No description provided.
mirror of js-levenshtein, bundled and exposed as ES module
Fast Javascript text diff
TypeScript definitions for damerau-levenshtein
Compare items in two sequences to find a longest common subsequence
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
A JavaScript text diff implementation.
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Compare items in two sequences to find a longest common subsequence
Fast and tiny fuzzy-search utility
Deep diffs two objects, including nested structures of arrays and objects, and return the difference.
Returns an array with only the unique values from the first array, by excluding all values from additional arrays using strict equality for comparisons.
No description provided.
No description provided.
No description provided.
No description provided.