Search results
25 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
A library implementing different string similarity
- strings
- compare similarity
- similarity
- Dice's Coefficient
- Cosine
- Jaccard Index
- Levenshtein
- Longest Common Subsequence
- Metric Longest Common Subsequence
- difference
- compare
- comparision
- similar
- distance
- View more
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
A collection of string matching algorithms built with React Select in mind
- distance
- filter
- fuzzy
- Jaro-Winkler
- Levenshtein
- match
- options
- proximity
- search
- similar
- similarity
- string
- subsequence
- substitutions
- View more
A Javascript library for fuzzy substring searches.
Easy-to-use React component for morphing one string into another.
Calculate string distance using Damerau–Levenshtein method.
Get string similarity in JavaScript or TypeScript
- string similarity
- similarity
- string
- strings
- metric
- jaro-winkler
- Levenshtein
- Normalized
- NormalizedLevenshtein
- Normalized Levenshtein
- Weighted
- WeightedLevenshtein
- Weighted Levenshtein
- Damerau
- View more
A much faster than the naïve Levenshtein distance algoritme
Measure how similar two strings are using the Sørensen–Dice Coefficient
- closest
- coefficient
- compare
- comparison
- Dice
- difference
- index
- Levenshtein
- match
- matching
- measure
- nearest
- similar
- similarity
- View more
Compute the Levenshtein distance for string comparison
An N-API/C++ port of the Damerau-Levenshtein implementation from natural
A Search library, with integrated threshhold.
JavaScript port of the fast Damerau-Levenshtein string distance calculation algorithm used in Git
Implementation of the Levenshtein algorithm used to calculate distince between strings.
Compare the difference between two strings using Levenshtein Distance. Returns a number 0 to 1 showing exactly how related the two strings are.
Compute the edit distance between strings by approximate matching.
Some algorithms to compare strings.
similarity based on Levenshtein distance
Over simplistic fuzzy search library using Damerau-Levenshtein and optionally the keyboard layout to calculate distances.