Search results
179 packages found
A package for playing around with different dictionaries. Supports Swedish and English.
- swedish
- english
- german
- french
- spanish
- levenshtein
- levenshtein distance
- palindrome
- palindromes
- anagram
- anagrams
- word
- words
- similarity
- View more
Maintenance: 17%. Quality: 61%. Popularity: 1%.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
Maintenance: 33%. Quality: 42%. Popularity: 2%.
MAM Helpers
Maintenance: 33%. Quality: 42%. Popularity: 0%.
Simple package to implement levenshtein distance algorithm in typescript
Maintenance: 25%. Quality: 51%. Popularity: 0%.
Modded version of string-similarity.
Maintenance: 14%. Quality: 61%. Popularity: 0%.
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
- bloom filter
- canberra
- caverphone
- chebyshev
- cologne
- cosine
- clustering
- daitch-mokotoff
- dice
- fingerprint
- fuzzy
- hamming
- k-means
- jaccard
- View more
Maintenance: None. Quality: 63%. Popularity: 7%.
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
Maintenance: None. Quality: 63%. Popularity: 7%.
A package to search dances with fuzzy matching
Maintenance: 33%. Quality: 39%. Popularity: 0%.
A minimal algorithm for computing Levenshtein distance in JavaScript.
Maintenance: None. Quality: 62%. Popularity: 7%.
Various utilities regarding Levenshtein transducers.
- javascript
- coffeescript
- levenshtein
- distance
- metric
- spelling correction
- fuzzy search
- approximate string matching
- automata
- transducer
- information retrieval
Maintenance: 6%. Quality: 61%. Popularity: 2%.
Group similar items together.
- algorithm
- cluster
- compare
- comparison
- disjoint-set
- edit-distance
- fuzzy
- group
- group-similar
- grouping
- levenshtein
- match
- matching
- merge-find
- View more
Maintenance: 4%. Quality: 63%. Popularity: 2%.
Set of functions for efficient implementation of approximate (fuzzy) search
Maintenance: 33%. Quality: 35%. Popularity: 0%.
🚀 The fastest and easiest「didyoumean」in the universe via levenshtein algorithm
Maintenance: None. Quality: 65%. Popularity: 3%.
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Maintenance: None. Quality: 64%. Popularity: 3%.
Give me a word and I’ll give you an array of words that differ by a single letter
Maintenance: None. Quality: 64%. Popularity: 2%.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Maintenance: 6%. Quality: 61%. Popularity: 0%.
Measure how similar two strings are using the Sørensen–Dice Coefficient
- closest
- coefficient
- compare
- comparison
- Dice
- difference
- index
- Levenshtein
- match
- matching
- measure
- nearest
- similar
- similarity
- View more
Maintenance: None. Quality: 64%. Popularity: 2%.
A lightweight implementation of the Levenshtein distance algorithm.
Maintenance: None. Quality: 63%. Popularity: 3%.
Javascript version of hermetrics.py
- hermetrics
- nlp
- similarity metric
- distance metric
- levenshtein
- jaro
- jaro-winkler
- hamming
- osa
- damerau-levenshtein
- jaccard
- dice
Maintenance: None. Quality: 62%. Popularity: 3%.
Levenshtein distance for an array.
Maintenance: None. Quality: 62%. Popularity: 3%.