Nuptial Predicament Mediation

    34 packages found

    Measure the difference between two strings using the Levenshtein distance algorithm

    published 4.0.0 4 months ago
    M
    Q
    P

    Fastest Levenshtein distance implementation in JS.

    published 1.0.12 a year ago
    M
    Q
    P

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

    published 1.2.2 5 months ago
    M
    Q
    P

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

    published 5.0.0 6 months ago
    M
    Q
    P

    Levenshtein edit distance. No cruft. Real fast.

    published 3.0.0 8 months ago
    M
    Q
    P

    [![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 1.1.1 2 years ago
    M
    Q
    P

    diff strings and lists with levenshtein distance

    published 1.1.7 4 years ago
    M
    Q
    P

    Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript

    published 1.1.0 5 months ago
    M
    Q
    P

    Measure the difference between two strings using the Levenshtein distance algorithm

    published 2.0.0 4 months ago
    M
    Q
    P

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

    published 1.1.6 3 years ago
    M
    Q
    P

    Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers

    published 2.0.3 2 months ago
    M
    Q
    P

    Customizable edit distance calculator

    published 0.1.2 2 years ago
    M
    Q
    P

    Wagner–Fischer algorithm in JavaScript

    published 1.0.0 6 years ago
    M
    Q
    P

    An implementation of weighted Damerau–Levenshtein distance.

    published 0.1.2 2 years ago
    M
    Q
    P

    Compare and Convert Part-of-Speech Tagged Sentences to Expected Grammar.

    published 0.0.3 2 years ago
    M
    Q
    P

    Customizable comparison of a string against another full string or substring.

    published 1.0.2 6 years ago
    M
    Q
    P

    Compute the Levenshtein distance between two strings.

    published 0.0.2 4 years ago
    M
    Q
    P

    String and tree edit distance

    published 1.0.4 9 months ago
    M
    Q
    P

    Super-fast Levenshtein edit distance with a maximum

    published 0.0.1 3 years ago
    M
    Q
    P

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

    published 1.2.0 3 years ago
    M
    Q
    P