Search results
178 packages found
CleverStack CSV processing
Node.js bindings for the levenshtein-sse lib
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
Implementation of the Levenshtein algorithm used to calculate distince between strings.
A very fast JavaScript implementation of Levenshtein distance for the k <= 1 case.
Search for approximate matches to a query
String and tree edit distance
diff strings and lists with levenshtein distance
Javascript version of hermetrics.py
- hermetrics
- nlp
- similarity metric
- distance metric
- levenshtein
- jaro
- jaro-winkler
- hamming
- osa
- damerau-levenshtein
- jaccard
- dice
findsuggestions searches haystacks for needles and nails.
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Various utilities regarding Levenshtein transducers.
- javascript
- coffeescript
- levenshtein
- distance
- metric
- spelling correction
- fuzzy search
- approximate string matching
- automata
- transducer
- information retrieval
Distance between given email and popular domains
A tiny optimized package which finds the Levenshtein distance (edit distance) between two words. Having two strings of length N and M, the algorithm has O(N*M) complexity and uses O(N) additional space.
Pure Javascript/Node.js in-memory full text search engine.
Fast string matcher conceived for quick replies chat and multiple choice scenario.
A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.
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
Diff Match and Patch