Search results
171 packages found
A Levenshtein algorithm implementation written in ES6
The Levenshtein distance metric for node and browser.
A much faster than the naïve Levenshtein distance algoritme
FJS é uma biblioteca JavaScript que permite fazer buscas em um array de objetos com base em critérios de consulta flexíveis. Com o FJS, você pode realizar buscas complexas e precisas em seus dados usando operadores atômicos e operadores de busca avançados
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
How similar are these two strings?
MAM Helpers
Wrapper for edlib sequence alignment library
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
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
Algorithms for clustering strings
A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.
Compute the edit distance between strings by approximate matching.
Filter a list based on Levenshtein distances
Super-fast Levenshtein edit distance with a maximum
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
A minimal algorithm for computing Levenshtein distance in JavaScript.
Group similar items together.
- algorithm
- cluster
- compare
- comparison
- disjoint-set
- edit-distance
- fuzzy
- group
- group-similar
- grouping
- levenshtein
- match
- matching
- merge-find
- View more
Check the phishy equality of a string
similarity based on Levenshtein distance