×

Learning new words

  • US 10,133,725 B2
  • Filed: 04/03/2017
  • Issued: 11/20/2018
  • Est. Priority Date: 06/12/2016
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method, comprising:

  • receiving, by a term learning server, a batch of differentially private sketches of n-grams, each n-gram a sequence of characters forming a subset of one term in a plurality of terms unknown to the term learning server;

    for each received differentially private n-gram sketch, determining a matching differentially private n-gram sketch to the received sketch, wherein the matching differentially private n-gram sketch, W, has k rows and m columns, wherein each row ∈

    [k] corresponds to a hash function h in the set of k hash functions, H={h1, . . . , hk};

    adding the received differentially private n-gram sketch data to the matching differentially private sketch n-gram sketch;

    determining a frequency of each matching differentially private n-gram sketch among the batch;

    selecting the matching differentially private n-grams having a frequency greater than a threshold value;

    generating a plurality of combinations of differentially private n-grams from the selected matching differentially private sketches of n-grams having a frequency greater than a threshold value;

    determining one or more new terms using the plurality of combinations of differentially private n-grams; and

    adding at least one of the one or more new terms to an asset catalog to form an updated asset catalog.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×