Search results
45 packages found
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
this package lets you compare two strings and give you how much percent they are similar
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.
Customizable edit distance calculator
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
An implementation of weighted Damerau–Levenshtein distance.
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
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
A tiny implementation of the Levenshtein edit distance algorithm.
Customizable comparison of a string against another full string or substring.
Fast implementation of the Levenshtein edit distance
Compare and Convert Part-of-Speech Tagged Sentences to Expected Grammar.
compute and verify string similarity
Compute the Levenshtein distance between two strings.
Generate commands that represents the delta from one string to other using the edit distance algorithm
Transform one string into another using the operations in the Levenshtein edit distance computation.
Find the difference between two arrays and compute the minimal steps to transform one array to another.