Patents by Inventor Jurij Ganitkevic

Jurij Ganitkevic has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10223349
    Abstract: A processing system is described which induces a context free grammar (CFG) based on a set of descriptions. The descriptions pertain to a particular subject. Thus, the CFG targets the particular subject, and is accordingly referred to as a subject-targeted context free grammar (ST-CFG). The processing system can use the ST-CFG to determine whether a new description is a proper description of the subject. The processing system also provides synthesizing functionality for building an ST-CFG based on one or more smaller component ST-CFGs.
    Type: Grant
    Filed: February 20, 2013
    Date of Patent: March 5, 2019
    Assignee: Microsoft Technology Licensing LLC
    Inventors: Christopher B. Quirk, Pallavi Choudhury, Jurij Ganitkevic, Luke S. Zettlemoyer
  • Publication number: 20140236571
    Abstract: A processing system is described which induces a context free grammar (CFG) based on a set of descriptions. The descriptions pertain to a particular subject. Thus, the CFG targets the particular subject, and is accordingly referred to as a subject-targeted context free grammar (ST-CFG). The processing system can use the ST-CFG to determine whether a new description is a proper description of the subject. The processing system also provides synthesizing functionality for building an ST-CFG based on one or more smaller component ST-CFGs.
    Type: Application
    Filed: February 20, 2013
    Publication date: August 21, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: Christopher B. Quirk, Pallavi Choudhury, Jurij Ganitkevic, Luke S. Zettlemoyer
  • Patent number: 8812517
    Abstract: A way of detecting a watermark present in a structured result, such as a search result or a machine translation. The structured result is received and a hash is computed based upon at least part of the result. The resulting bit sequence is tested against a null hypothesis that the bit sequence was generated by a random variable with a binomial distribution with a parameter p=0.5. The result of this test is compared to a significance level, which indicates whether the structured result is watermarked.
    Type: Grant
    Filed: November 15, 2011
    Date of Patent: August 19, 2014
    Assignee: Google Inc.
    Inventors: Ashish Venugopal, Jurij Ganitkevic, Franz Josef Och, David Robert Talbot, Jakob David Uszkoreit
  • Patent number: 8788507
    Abstract: A way of generating a watermark for a structured result, such as a search result or a machine translation. A hash function is used to generate a bit sequence for each of a plurality of structured results. A ranking score is generated for each resulting bit sequence. The ranking score can be based on the detectability of the bit sequence compared to a randomly-generated bit sequence and the quality of each of the structured results. A structured result is selected as the watermarked structured result based upon the ranking score.
    Type: Grant
    Filed: November 15, 2011
    Date of Patent: July 22, 2014
    Assignee: Google Inc.
    Inventors: Ashish Venugopal, Jurij Ganitkevic, Franz Josef Och, David Robert Talbot, Jakob David Uszkoreit