Search results
62 packages found
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Maintenance: 33%. Quality: 65%. Popularity: 14%.
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Maintenance: None. Quality: 54%. Popularity: 36%.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Maintenance: 33%. Quality: 61%. Popularity: 0%.
A library implementing different string similarity
- strings
- compare similarity
- similarity
- Dice's Coefficient
- Cosine
- Jaccard Index
- Levenshtein
- Longest Common Subsequence
- Metric Longest Common Subsequence
- difference
- compare
- comparision
- similar
- distance
- View more
Maintenance: 20%. Quality: 65%. Popularity: 9%.
All mismatch between two strings
Maintenance: 33%. Quality: 62%. Popularity: 1%.
"Similify is a versatile JavaScript package designed to simplify and enhance similarity comparisons in various contexts. Whether you're comparing words, objects, arrays, or exploring string lengths and numerical ranges, Similify provides an easy-to-use in
- similarity
- comparison
- matching
- analyze
- compare
- similarity percentage
- string similarity
- object similarity
- array similarity
- threshold
- fuzzy matching
- string matching
- pattern matching
- similarity analysis
- View more
Maintenance: 31%. Quality: 61%. Popularity: 0%.
A library for comparing strings and determining their similarity.
Maintenance: 33%. Quality: 52%. Popularity: 1%.
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: 21%.
A very fast implementation of cosine-similarity for comparing two vectors. Up to 6x faster than the compute-cosine-similarity library.
Maintenance: 32%. Quality: 53%. Popularity: 1%.
Finds degree of similarity between strings, based on Dice's Coefficient.
Maintenance: 30%. Quality: 52%. Popularity: 1%.
Operate image pixels, such as pickup color, color contrast, etc
Maintenance: 33%. Quality: 54%. Popularity: 2%.
JavaScript implementation of the SSIM algorithm
Maintenance: None. Quality: 64%. Popularity: 17%.
An extension of Set meant for checking similarity of strings. Also offers static functions that can be used seperately from the SimilaritySet.
- string-similarity
- similarity-set
- similarity
- strings
- similar
- difference
- compare
- comparison
- dice
- levensthein
- jaccard
Maintenance: 28%. Quality: 51%. Popularity: 0%.
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
Maintenance: 33%. Quality: 54%. Popularity: 0%.
[![npm-version](https://img.shields.io/npm/v/levenary.svg)](https://www.npmjs.com/package/levenary) [![github-actions](https://github.com/tanhauhau/levenary/workflows/CI/badge.svg)](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Maintenance: None. Quality: 62%. Popularity: 15%.
A collection of common string functions.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
Maintenance: 33%. Quality: 61%. Popularity: 1%.
A collection of common string functions {web}.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
Maintenance: 33%. Quality: 61%. Popularity: 0%.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Maintenance: 33%. Quality: 48%. Popularity: 2%.
Modded version of string-similarity.
Maintenance: 13%. Quality: 61%. Popularity: 0%.
Collection of usefull methods for testing on the browser console
Maintenance: 33%. Quality: 48%. Popularity: 0%.