Neural Processing Mechanisms

    32 packages found

    Description

    Javascript fuzzy matching, scoring, sorting, and approximating library

    Keywords

    Publisher

    published 0.0.16 years ago
    M
    Q
    P

    Description

    Probabilistic data structures for large or streaming data sets.

    Keywords

    Publisher

    published 1.0.24 years ago
    M
    Q
    P

    Description

    Abbreviate currency values in a configurable, locale-friendly way.

    Keywords

    Publisher

    published 1.0.22 years ago
    M
    Q
    P

    Description

    Converts a select box into a fuzzy searchable dropdown.

    Keywords

    Publisher

    published 1.0.06 years ago
    M
    Q
    P

    Description

    command-t style approximate string matcher as a Node.js function

    Keywords

    Publisher

    published 1.0.06 years ago
    M
    Q
    P

    Description

    Convert a number to k-metric or a k-metric number to a long number

    Keywords

    Publisher

    published 1.0.62 years ago
    M
    Q
    P

    Description

    Textile's Streaming Approximate Histograms

    Keywords

    Publisher

    published 1.0.73 years ago
    M
    Q
    P

    Description

    Zero out (round-out/approximate) numerical values: 123,456,789 → 123,000,000

    Keywords

    Publisher

    published 0.0.15 years ago
    M
    Q
    P

    Description

    approximate human readable time

    Keywords

    Publisher

    published 0.0.15 years ago
    M
    Q
    P

    Description

    Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.

    Keywords

    Publisher

    published 0.0.16 years ago
    M
    Q
    P

    Description

    This package adds new features to the mongodb database through the use of fuzzy techniques and approximate string matching.

    Keywords

    Publisher

    published 2.0.13 years ago
    M
    Q
    P

    Description

    Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.

    Keywords

    Publisher

    published 0.0.44 years ago
    M
    Q
    P