Search results
178 packages found
Some algorithms to compare strings.
Compare two strings using multiple methods (Jaro-Winkler Algorithm,Cosine Similarity,Levenshtein Algorithm)
Find the difference between two arrays and compute the minimal steps to transform one array to another.
words.pipe(new LevenFilter(string, distance))
The Levenshtein distance metric for node and browser.
A Levenshtein algorithm implementation written in ES6
Transform one string into another using the operations in the Levenshtein edit distance computation.
Check the phishy equality of a string
Filter a list based on Levenshtein distances
library for fuzzy search
- fuzzy
- search
- levenshtein
- damerau-levenshtein
- hamming distance
- longest subsequence
- edit distance
- string matching
- fuzzy matching
A much faster than the naïve Levenshtein distance algoritme
levenshtein text comparison
Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first
- leven
- levenshtein
- distance
- algorithm
- sort
- string
- difference
- diff
- array
- similar
- similarity
- compare
- comparison
- match
- View more
General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.
- natural
- language
- porter
- lancaster
- stemmer
- bayes
- classifier
- phonetic
- metaphone
- inflector
- wordnet
- tf-idf
- logistic
- regression
- View more
A sort function for string arrays based on Levenshtein distance.
Levenshtein algorithm module
A method to detect the levenshtein edits between strings
Compute the edit distance between strings by approximate matching.
Algorithms for clustering strings
Compare the difference between two strings using Levenshtein Distance. Returns a number 0 to 1 showing exactly how related the two strings are.