[go: up one dir, main page]

Search results

62 packages found

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

published version 7.0.4, 2 months ago

Maintenance: 33%. Quality: 65%. Popularity: 14%.

Measure the difference between two strings using the Levenshtein distance algorithm

published version 4.0.0, 3 years ago

Maintenance: None. Quality: 54%. Popularity: 36%.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

published version 4.0.4, 6 months ago

Maintenance: 33%. Quality: 61%. Popularity: 0%.

Maintenance: 20%. Quality: 65%. Popularity: 9%.

All mismatch between two strings

published version 3.0.2, 7 months ago

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

published version 2.0.2, 9 months ago

Maintenance: 31%. Quality: 61%. Popularity: 0%.

A library for comparing strings and determining their similarity.

published version 1.0.1, 5 months ago

Maintenance: 33%. Quality: 52%. Popularity: 1%.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

published version 1.1.6, 6 years ago

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.

published version 1.2.2, 7 months ago

Maintenance: 32%. Quality: 53%. Popularity: 1%.

Finds degree of similarity between strings, based on Dice's Coefficient.

published version 1.0.0, 8 months ago

Maintenance: 30%. Quality: 52%. Popularity: 1%.

Operate image pixels, such as pickup color, color contrast, etc

published version 1.3.2, 2 months ago

Maintenance: 33%. Quality: 54%. Popularity: 2%.

JavaScript implementation of the SSIM algorithm

published version 3.5.0, 4 years ago

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.

published version 1.0.1, 7 months ago

Maintenance: 28%. Quality: 51%. Popularity: 0%.

Finds similar word(s) in a list of words

published version 1.2.6, 3 months ago

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)

published version 1.1.1, 5 years ago

Maintenance: None. Quality: 62%. Popularity: 15%.

A collection of common string functions.

published version 2.2.0, 2 months ago

Maintenance: 33%. Quality: 61%. Popularity: 1%.

A collection of common string functions {web}.

published version 2.2.0, 2 months ago

Maintenance: 33%. Quality: 61%. Popularity: 0%.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

published version 1.9.1, 8 months ago

Maintenance: 33%. Quality: 48%. Popularity: 2%.

Modded version of string-similarity.

published version 1.1.3, 2 years ago

Maintenance: 13%. Quality: 61%. Popularity: 0%.

Collection of usefull methods for testing on the browser console

published version 1.1.0, 10 months ago

Maintenance: 33%. Quality: 48%. Popularity: 0%.