105 packages found

    Description

    Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

    Keywords

    Publisher

    published 1.0.73 months ago
    M
    Q
    P

    Description

    Fastest Levenshtein distance implementation in JS.

    Keywords

    Publisher

    published 1.0.12a year ago
    M
    Q
    P

    Description

    Efficient implementation of Levenshtein algorithm with locale-specific collator support.

    Keywords

    Publisher

    published 3.0.0a year ago
    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.02 years ago
    M
    Q
    P

    Description

    Match human-quality input to potential matches by edit distance.

    Keywords

    Publisher

    published 1.2.2a month 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 4.0.47 months ago
    M
    Q
    P

    Description

    Levenshtein edit distance. No cruft. Real fast.

    Keywords

    Publisher

    published 3.0.04 months ago
    M
    Q
    P

    Description

    Return all word matches between two arrays within given Levenshtein distance

    Keywords

    Publisher

    published 1.0.3a month 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 5.0.02 months ago
    M
    Q
    P

    Description

    All mismatch between two strings

    Keywords

    Publisher

    published 2.1.12 months ago
    M
    Q
    P

    Description

    Javascript version of hermetrics.py

    Keywords

    Publisher

    published 1.0.0a year ago
    M
    Q
    P

    Description

    [![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)

    Keywords

    Publisher

    published 1.1.1a year ago
    M
    Q
    P

    Description

    Compute the edit distance between strings by approximate matching.

    Keywords

    Publisher

    published 0.2.3a year ago
    M
    Q
    P

    Description

    Sort array of strings by Levenshtein (Sift4) distance

    Keywords

    Publisher

    published 1.1.06 years ago
    M
    Q
    P

    Description

    An N-API/C++ port of the Damerau-Levenshtein implementation from natural

    Keywords

    Publisher

    published 1.0.14a year ago
    M
    Q
    P

    Description

    NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings

    Keywords

    Publisher

    published 1.1.7a year ago
    M
    Q
    P

    Description

    Fuzzy string matching algorithms and utilities, port of the fuzzywuzzy Python library.

    Keywords

    Publisher

    published 2.0.018 days ago
    M
    Q
    P

    Description

    Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein

    Keywords

    Publisher

    published 1.4.04 years ago
    M
    Q
    P

    Description

    diff strings and lists with levenshtein distance

    Keywords

    Publisher

    published 1.1.74 years 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.63 years ago
    M
    Q
    P