Search results
46 packages found
[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Finds similar word(s) in a list of words
- leven
- levenshtein
- distance
- string
- difference
- diff
- suggest
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- text
- View more
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Super-fast Levenshtein edit distance with a maximum
An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
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
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.
Transform one string into another using the operations in the Levenshtein edit distance computation.
A lightweight implementation of the Levenshtein distance algorithm.
Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
compute and verify string similarity
A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.
String and tree edit distance
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
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
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