Notorious Public Menace

47 packages found

M
Q
P

Description

Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm

Keywords

Publisher

published 3.1.08 months ago
M
Q
P

Description

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

Keywords

Publisher

published 1.1.6a year ago
M
Q
P

Description

Determines if an object can be used as an array

Keywords

Publisher

published 0.3.2a year ago
M
Q
P

Description

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

Keywords

Publisher

published 3.1.24 months ago
M
Q
P

Description

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

Keywords

Publisher

published 3.0.0a year ago
M
Q
P

Description

library for simularity identification

Keywords

Publisher

published 0.1.45 months ago
M
Q
P

Description

Fastest Levenshtein distance implementation.

Keywords

Publisher

published 2.0.132 months ago
M
Q
P
M
Q
P

Description

Finds measure of similarity between two strings using Ochiai coefficient.

Keywords

Publisher

published 1.0.67 months ago
M
Q
P

Description

Find the nearest string with a given string

Keywords

Publisher

published 1.0.62 years ago
M
Q
P

Description

Finds measure of similarity/distance between two input sets.

Keywords

Publisher

published 1.0.17 months ago
M
Q
P

Description

Object properties matcher for Chai

Keywords

Publisher

published 1.6.02 years ago
M
Q
P

Description

Module to compare similarity between strings / arrays.

Keywords

Publisher

published 1.0.0a year ago
M
Q
P

Description

List the same parts from two given strings

Keywords

Publisher

published 1.0.3a year ago
M
Q
P

Description

Compares a string against an array of strings and picks the most similar

Keywords

Publisher

published 1.0.1a year ago
M
Q
P

Description

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

Keywords

Publisher

published 1.2.010 months ago
M
Q
P

Description

Find similar objects and partial duplicates in collections

Keywords

Publisher

published 1.0.02 years ago
M
Q
P

Description

Propse a word when the input word is not in the dictionary

Keywords

Publisher

published 0.0.54 years ago
M
Q
P

Description

Natural Language Processing with Datamuse and Wordnet

Keywords

Publisher

published 1.1.09 months ago
M
Q
P

Description

Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.

Keywords

Publisher

published 1.1.06 months ago