Patents by Inventor Naga Srinivas Vemuri

Naga Srinivas Vemuri 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).

  • Grammar compression
    Patent number: 8447736
    Abstract: Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
    Type: Grant
    Filed: August 30, 2011
    Date of Patent: May 21, 2013
    Assignee: Microsoft Corporation
    Inventors: Stelios Paparizos, Christopher Walter Anderson, Wei Liu, Ajay Nair, Alexandros Ntoulas, Naga Srinivas Vemuri
  • GRAMMAR COMPRESSION
    Publication number: 20110313993
    Abstract: Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
    Type: Application
    Filed: August 30, 2011
    Publication date: December 22, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: STELIOS PAPARIZOS, CHRISTOPHER WALTER ANDERSON, WEI LIU, AJAY NAIR, ALEXANDROS NTOULAS, NAGA SRINIVAS VEMURI
  • Grammar compression
    Patent number: 8027957
    Abstract: Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
    Type: Grant
    Filed: June 26, 2008
    Date of Patent: September 27, 2011
    Assignee: Microsoft Corporation
    Inventors: Stelios Paparizos, Christopher Walter Anderson, Wei Liu, Ajay Nair, Alexandros Ntoulas, Naga Srinivas Vemuri
  • PATTERN GENERATION
    Publication number: 20090327269
    Abstract: Generation of patterns used to facilitate search queries is provided herein. A pattern includes a sequence of token classes and new token classes. A sample query is parsed to identify tokens within the sample query that match a token associated with a referenced set of token classes. New token classes are generated for unidentified tokens within the sample query. A pattern is generated by substituting the identified tokens of the sample query with corresponding token classes and substituting the unidentified tokens of the sample query with corresponding new token classes.
    Type: Application
    Filed: June 27, 2008
    Publication date: December 31, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: STELIOS PAPARIZOS, CHRISTOPHER WALTER ANDERSON, WEI LIU, AJAY NAIR, NAGA SRINIVAS VEMURI
  • GRAMMAR COMPRESSION
    Publication number: 20090327256
    Abstract: Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.
    Type: Application
    Filed: June 26, 2008
    Publication date: December 31, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: STELIOS PAPARIZOS, CHRISTOPHER WALTER ANDERSON, WEI LIU, AJAY NAIR, ALEXANDROS NTOULAS, NAGA SRINIVAS VEMURI