Similarity Packages

Code similarity detection based on the Winnowing algorithm

Fastest Levenshtein distance implementation in JS.

A library for comparing strings and determining their similarity.

Semantically create chunks from large texts. Useful for workflows involving large language models (LLMs).

Facial Recognize Nodes With AI for Node-RED

Calculates cosine similarity of two vector values in Node-RED

provides functions for comparing and calculating the similarity between two strings using various methods.

Neural Vector Database for efficient similarity search

A string similarity utility that uses the Jaro-Winkler algorithm

An optimized port of the SimMetrics Java library

Measures the similarity between two non-zero vectors.

A library for story mapping based on user input with Mecab morphological analysis for Node.js

Calculates cosine similarity of two vector values in Node-RED

It allows to obtain the similarities of words and texts as well as the normalization of texts to different forms.

Produces a similarity score for text blocks. 1-100. If engine determines the string blocks are not adequate relative length to compare, it will return a -1.

A fork of js-levenshtein by gustf adding a limit to the distance calculation.