Search results
181 packages found
Algorithms for generating image hashes.
A React hook that allows you to use similarity search in a react-select component
A very fast implementation of cosine-similarity for comparing two vectors. Up to 6x faster than the compute-cosine-similarity library.
Implementations of various string similarity metrics.
Finds degree of similarity between strings, based on Dice's Coefficient.
User friendly algorithms for generating image hashes.
String comparison without caring for order of letters
Cluster words with similar IPA transcriptions together
A package to detect similar Gmail addresses based on Gmail's unique addressing rules.
lightweight npm package to calculate string similarity
string similarity scoring algorithm
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
provides functions for comparing and calculating the similarity between two strings using various methods.
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- similar
- View more
Lightweight Cosine Similarity Function. Built as an alternative to the compute-cosine-similarity package. Works with high dimension vectors like openAI embeddings
- vector
- cosine
- similarity
- distance
- openai
- embeddings
- nlp
- machine learning
- node
- typescript
- compute-cosine-similarity
- high-dimension
- word embeddings
- ml-matrix
[![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
A string similarity comparison tool, which is the front-end implementation version of Java string similarity. To maintain consistency with the string similarity algorithm in Java string similarity。
Finds degree of similarity in list of array of objects , based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Express middleware to correct typos in URLs via string similarity algorithms
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- in
- veritatis
- culpa
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Library for preventing confusingly similar e.g. usernames