Search results
169 packages found
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 quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
Morph one word into another, one letter at a time
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Find the minimal edit path between two generic arrays.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
String's percent similarity
Fast and tiny fuzzy-search utility
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.
Search for approximate matches to a query
levenshtein text comparison
Suggest fixing misspelled, typos, matching human-quality input
- didyoumean
- string similarity
- spelling
- levenshtein
- typo
- similar
- matching
- suggestion
- spelling correction
- text correction
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 fork of js-levenshtein by gustf adding a limit to the distance calculation.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
String and tree edit distance
A Javascript library to compare and transform strings.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power