Search results

75 packages found

string extrapolated relations based on string similarity range between 0 and 1

published 0.1.0 6 years ago
M
Q
P

Fastest implementation of Sørensen–Dice coefficient.

published 1.0.3 6 years ago
M
Q
P

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

published 1.0.0 6 years ago
M
Q
P

Basic usage. Basic scope. Easy to use.

published 1.1.0 6 years ago
M
Q
P

Measure the difference between two strings using the Levenshtein distance algorithm

published 2.0.0 3 years ago
M
Q
P

Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name

published 1.2.1 7 years ago
M
Q
P

Potsiu! is a simple utility function that allows you to update indexes of specific positions on a string after you apply some transformation to it. It is quite handy if you have data in which string indexes are specified, but for some reason you want to p

published 1.0.1 4 years ago
M
Q
P

Compare two strings using multiple methods (Jaro-Winkler Algorithm,Cosine Similarity,Levenshtein Algorithm)

published 0.1.1 5 years ago
M
Q
P

Compute similarity of two string

published 0.0.2 10 years ago
M
Q
P

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

published 0.6.0 8 years ago
M
Q
P

An optimized port of the SimMetrics Java library

published 0.9.0 6 years ago
M
Q
P

A node for comparing the similarity of two strings, based on the aceakash/string-similarity npm module.

published 0.0.1 7 years ago
M
Q
P

An optimized port of the SimMetrics Java library

published 0.8.13 8 years ago
M
Q
P

Returns the percentage of resemblance (likeness, similarity) between two strings / objects

published 1.0.0 9 years ago
M
Q
P

An optimized port of the SimMetrics Java library

published 0.8.10 9 years ago
M
Q
P