Search results
180 packages found
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
String's percent similarity
compare the similarity of two string
eCommerce AI
Get string similarity in JavaScript or TypeScript
- string similarity
- similarity
- string
- strings
- metric
- jaro-winkler
- Levenshtein
- Normalized
- NormalizedLevenshtein
- Normalized Levenshtein
- Weighted
- WeightedLevenshtein
- Weighted Levenshtein
- Damerau
- View more
Text classification using n-grams and cosine similarity
- text classification
- classification
- classify
- classifier
- machine learning
- machine
- learning
- ai
- artificial intelligence
- artificial
- intelligence
- n-gram
- n-grams
- cosine similarity
- View more
String and tree edit distance
Computes the cosine similarity between two vectors
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
Mag3llan's similarity API SDK
A collection of mathematical functions for working with vectors.
Fastest implementation of Sørensen–Dice coefficient.
A lightweight and efficient vector database for storing and searching text embeddings in the browser's local storage. The package uses OpenAI's API or Transformer.js models to generate embeddings for text documents and provides functionality for similarit
- vector
- semantic
- store
- storage
- database
- db
- local
- localstorage
- browser
- embeddings
- text
- search
- similarity
- OpenAI
- View more
Color a given set of N strings into a set of M<N color classes
Compare the similarity of two strings.
Image mean square error (MSE). In TypeScript/JavaScript. For browser/server.
string extrapolated relations based on string similarity range between 0 and 1
Calculates cosine similarity between 2 strings.
A simple-yet-powerful KD-tree library for NodeJS, with support for lightning-fast k-Nearest Neighbour queries. Supports normalization, weights, key and filter parameters
Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.