Search results

189 packages found

The structural similarity (SSIM) index is a method for measuring the similarity between two images. The SSIM index is a full reference metric; in other words, the measuring of image quality based on an initial uncompressed or distortion-free image as reference. SSIM is designed to improve on traditional methods like peak signal-to-noise ratio (PSNR) and mean squared error (MSE), which have proven to be inconsistent with human eye perception.

published 0.0.0 11 years ago
M
Q
P

Image multi-scale structural similarity (MS-SSIM). In TypeScript/JavaScript. For browser/server.

published 0.2.0 9 years ago
M
Q
P

Find the difference between two arrays and compute the minimal steps to transform one array to another.

published 0.1.4 4 years ago
M
Q
P

Hybrid word similarity scores for use in sentence-similarity.

published 1.0.0 5 years ago
M
Q
P

Simple document similarity based on JavaScript

published 0.0.1 7 years ago
M
Q
P

eCommerce AI

published 0.0.7 3 years ago
M
Q
P

An association lib that will find an things closest associations and give helper methods to do some other interesting things

published 1.0.5 8 years ago
M
Q
P

Sorts a list of strings by the similarity of the search value and filter with it

published 0.15.1 7 years ago
M
Q
P

Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first

published 0.1.9 8 years ago
M
Q
P

Mag3llan's similarity API SDK

published 0.3.1 9 years ago
M
Q
P

SuggestGrid JavaScript Clients

published 0.1.1 8 years ago
M
Q
P

Covectric is a simple vector based search engine using cosine similarity and tf-idf methods for finding text similarity.

published 0.0.7 5 years ago
M
Q
P

Node.js bindings for Musly

published 0.0.3 10 years ago
M
Q
P

This package includes a set of useful array methods that facilitates working with arrays, specifically the arrays that contain objects or arrays even falsy values (such as: 0, null, false, NaN...). This package is es5 supported.

published 1.0.7 3 years ago
M
Q
P

An algorithm to construct the maximum common subgraph between two graphs (networks) and find their similarity (correlation).

published 1.0.0 5 years ago
M
Q
P

compare the similarity of two string

published 0.1.0 10 years ago
M
Q
P

calculate the similarity of colors

published 0.0.1 8 years ago
M
Q
P

Heuristic Distance/Similarity Between Strings (sift4 and levenshtein distance)

published 0.6.0 8 years ago
M
Q
P

similarity based on Levenshtein distance

published 0.1.0 8 years ago
M
Q
P

dom node similarity

published 0.0.3 7 years ago
M
Q
P