Naughty Pinching Mannequins

    15 packages found

    Measure the difference between two strings using the Levenshtein distance algorithm

    published 4.0.0 a year 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 a year ago
    M
    Q
    P

    Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.

    published 1.0.0 2 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 3 years ago
    M
    Q
    P

    Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first

    published 0.1.9 6 years ago
    M
    Q
    P

    Simply sort by similarity, starring Levenshtein via leven

    published 4.0.0 a month 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.4 2 months ago
    M
    Q
    P

    Finds similar word(s) in a list of words

    published 1.2.4 3 months ago
    M
    Q
    P

    Measure the difference between two strings using the Levenshtein distance algorithm

    published 2.0.0 a year ago
    M
    Q
    P

    String's percent similarity

    published 1.0.1 4 years ago
    M
    Q
    P

    Uses Levenshtein Distance to find the closest string match or matches in an array

    published 1.3.3 a year ago
    M
    Q
    P

    Fast implementation of the Levenshtein edit distance

    published 0.2.0 9 months 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 5 years ago
    M
    Q
    P

    Compare Strings Similarity Based on Levenshtein Distance Algorithm

    published 1.1.0 5 years ago
    M
    Q
    P

    Find the difference between two arrays and compute the minimal steps to transform one array to another.

    published 0.1.4 2 years ago
    M
    Q
    P