Search results

179 packages found

A package for playing around with different dictionaries. Supports Swedish and English.

published version 1.1.2, a year ago

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

Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support

published version 0.1.6, a year ago

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

MAM Helpers

published version 0.0.6, 5 months ago

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

Simple package to implement levenshtein distance algorithm in typescript

published version 1.0.0, 7 months ago

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

Modded version of string-similarity.

published version 1.1.3, 2 years ago

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

Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.

published version 1.1.4, 4 years ago

Maintenance: None. Quality: 63%. Popularity: 7%.

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

published version 1.2.0, 6 years ago

Maintenance: None. Quality: 63%. Popularity: 7%.

A package to search dances with fuzzy matching

published version 2.0.0, 4 months ago

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

A minimal algorithm for computing Levenshtein distance in JavaScript.

published version 2.2.10, 4 years ago

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

Various utilities regarding Levenshtein transducers.

published version 2.0.4, 2 years ago

Maintenance: 6%. Quality: 61%. Popularity: 2%.

Maintenance: 4%. Quality: 63%. Popularity: 2%.

Set of functions for efficient implementation of approximate (fuzzy) search

published version 0.0.0, 6 months ago

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

🚀 The fastest and easiest「didyoumean」in the universe via levenshtein algorithm

published version 1.2.5, 4 years ago

Maintenance: None. Quality: 65%. Popularity: 3%.

Simply sort by similarity, starring Levenshtein via leven

published version 4.0.0, 2 years ago

Maintenance: None. Quality: 64%. Popularity: 3%.

Give me a word and I’ll give you an array of words that differ by a single letter

published version 2.0.0, 5 years ago

Maintenance: None. Quality: 64%. Popularity: 2%.

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

published version 4.0.4, 2 years ago

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

Measure how similar two strings are using the Sørensen–Dice Coefficient

published version 1.0.4, 4 years ago

Maintenance: None. Quality: 64%. Popularity: 2%.

A lightweight implementation of the Levenshtein distance algorithm.

published version 1.0.9, 8 years ago

Maintenance: None. Quality: 63%. Popularity: 3%.

Javascript version of hermetrics.py

published version 1.0.0, 5 years ago

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

Levenshtein distance for an array.

published version 2.2.10, 4 years ago

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