Search results
124 packages found
For private use.
- natural
- language
- porter
- lancaster
- stemmer
- bayes
- classifier
- phonetic
- metaphone
- inflector
- wordnet
- tf-idf
- logistic
- regression
- View more
A very fast JavaScript implementation of Levenshtein distance for the k <= 1 case.
Find the minimal edit path between two generic arrays.
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
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.
String's percent similarity
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
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power
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
A Search library, with integrated threshhold.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
A lib to compare similarity of two strings
- string similarity
- edit distance
- levenshtein
- levenshtein distance
- lcs
- longest common subsequence
- simhash
- hamming distance
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
A simple ES6 proxy wrapper that enables you to make typos in property names.
Compare the difference between two strings using Levenshtein Distance. Returns a number 0 to 1 showing exactly how related the two strings are.
Fast search for big arrays
Measure the difference between two strings using the Levenshtein distance algorithm
- cli-app
- cli
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more