Norway Porridge Makers

    28 packages found

    Calculate the hamming distance of two hex strings or buffers

    published 1.0.0 8 years ago
    M
    Q
    P

    Some algorithms to compare strings.

    published 0.1.2 8 years ago
    M
    Q
    P

    Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.

    published 1.1.4 2 years ago
    M
    Q
    P

    A JS module for calculating several distances between two (n-dimensional) points

    published 0.2.0 7 years ago
    M
    Q
    P

    Distance/Similarity functions for Bag of Words, Strings, Numbers, Dates and Vectors.

    published 2.0.1 2 years ago
    M
    Q
    P

    Javascript version of hermetrics.py

    published 1.0.0 3 years ago
    M
    Q
    P

    Computes the Hamming distance between two sequences.

    published 1.1.0 8 years ago
    M
    Q
    P

    Efficiently find hashes within a certain hamming distance, typically used for perceptual hashing.

    published 0.1.0 8 years ago
    M
    Q
    P

    Node.js implementation of a sample framer (Array or Buffer) and signal windowing functions (e.g. Hamming).

    published 0.0.1 7 years ago
    M
    Q
    P

    Returns true if the hamming distance between two strings or arrays of equal length is smaller than the given limit

    published 1.0.0 3 years ago
    M
    Q
    P

    Determine whether a given query string contains keywords in a given item string, with a specified margin for spelling error based on the hamming distance.

    published 0.1.2 5 years ago
    M
    Q
    P

    Applies a windowing function to an array of data, making it ready to be FFT'd.

    published 0.1.4 9 years ago
    M
    Q
    P

    extended hamming code

    published 1.0.1 5 months ago
    M
    Q
    P

    TypeScript/JavaScript implementation of Hamming Backups: A 2-of-3 variant of SeedXOR

    published 0.0.1 3 months ago
    M
    Q
    P

    TypeScript library spectral analysis such as PSD and FFT

    published 1.0.12 a year ago
    M
    Q
    P

    As an example, a common strategy for de-duplicating images is to compute perceptual hashes for each of the images and compare those hashes with each other. Such hashes are small compared with the images (often 32, 64, 128 bits). If the hashing function is

    published 0.0.7 3 years ago
    M
    Q
    P

    Applies a windowing function to an array of data, making it ready to be FFT'd.

    published 0.2.7 a year ago
    M
    Q
    P

    Calculate the Hamming distance between two strings.

    published 0.0.2 5 years ago
    M
    Q
    P

    Calculate the Levenshtein distance between two strings.

    published 0.0.2 9 months ago
    M
    Q
    P

    hamming-code allows you to encode and decode binary strings codes with hamming code algorithm

    published 0.0.2 6 years ago
    M
    Q
    P