Patents by Inventor Meenakshi Nagarajan

Meenakshi Nagarajan 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).

  • Publication number: 20160162465
    Abstract: A new information in a language and relating to a subject matter domain is parsed into a constituent set of complete grammatical constructs. In a subset of the complete grammatical constructs, a set of linguistic styles of the language is identified according to a subset of a set of word-style associations related to the language and independent of the subject matter domain. A first weight is assigned to a first linguistic style and a second weight to a second linguistic style from the set of linguistic styles. A first intention information is mapped to the first style using a first style-intention rule, and a second intention information to the second style using a second style-intention rule. A complete grammatical construct in the subset is tagged with the first intention information responsive to a weight associated with the first intention information exceeding an intention selection threshold.
    Type: Application
    Filed: December 8, 2014
    Publication date: June 9, 2016
    Applicants: International Business Machines Corporation, Baylor College of Medicine, The Board of Regents, The University of Texas System
    Inventors: MEENAKSHI NAGARAJAN, William Scott Spangler, Benjamin J. Bachman, Lawrence A. Donehower, Olivier Lichtarge, Sam J. Regenbogen, Angela D. Wilkins, Curtis R. Pickering
  • Patent number: 9355089
    Abstract: A new information in a language and relating to a subject matter domain is parsed into a constituent set of complete grammatical constructs. In a subset of the complete grammatical constructs, a set of linguistic styles of the language is identified according to a subset of a set of word-style associations related to the language and independent of the subject matter domain. A first weight is assigned to a first linguistic style and a second weight to a second linguistic style from the set of linguistic styles. A first intention information is mapped to the first style using a first style-intention rule, and a second intention information to the second style using a second style-intention rule. A complete grammatical construct in the subset is tagged with the first intention information responsive to a weight associated with the first intention information exceeding an intention selection threshold.
    Type: Grant
    Filed: December 8, 2014
    Date of Patent: May 31, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Meenakshi Nagarajan, William Scott Spangler, Benjamin J. Bachman, Lawrence A. Donehower, Olivier Lichtarge, Sam J. Regenbogen, Angela D. Wilkins, Curtis R. Pickering
  • Patent number: 9128933
    Abstract: A named entity input is received and a target sense for which the named entity input is to be extracted from a set of documents is identified. An extraction complexity feature is generated based on the named entity input, the target sense, and the set of documents. The extraction complexity feature indicates how difficult or complex it is deemed to be to identify the named entity input for the target sense in the set of documents.
    Type: Grant
    Filed: February 10, 2012
    Date of Patent: September 8, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Amir J. Padovitz, Bala Meenakshi Nagarajan
  • Publication number: 20150220643
    Abstract: Embodiments of the present invention relate to scoring of messages published to digital media based on past performance of similar messages. In one embodiment, an input token is received. A plurality of messages is selected from a corpus of messages. Each of the plurality of messages has a publication time and contents. The contents of each of the plurality of messages include the input token. A plurality of root messages is determined from the plurality of messages. Each of the plurality of root messages relates to at least one related message. The at least one related message is one of the plurality of messages. Each of the plurality of root messages is the earliest message of the corpus of messages related to its at least one related message. A score is determined for the input token based on the plurality of root messages.
    Type: Application
    Filed: January 31, 2014
    Publication date: August 6, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Alfredo Alba, Clemens Drews, Daniel Gruhl, Neal R. Lewis, Meenakshi Nagarajan
  • Publication number: 20150220510
    Abstract: Embodiments of the present invention relate to interactive optimization of messages published to digital media based on past performance of similar messages. In one embodiment, an input token is received. At least one candidate substitute token is retrieved from a dictionary. The dictionary comprises a mapping from the input token to the at least one candidate substitute token. A score associated with the at least one candidate substitute token is determined. A score associated with the input token is determined. The score associated with the input token, the at least one candidate substitute token, and the score associated with the at least one candidate substitute token are outputted.
    Type: Application
    Filed: January 31, 2014
    Publication date: August 6, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Alfredo Alba, Timothy Bethea, Clemens Drews, Daniel Gruhl, Neal R. Lewis, Meenakshi Nagarajan
  • Patent number: 8688791
    Abstract: The present invention generally relates to methods and systems for analysis of real-time user-generated text messages. The methods and systems allow analysis to be performed using term associations and geographical and temporal constraints.
    Type: Grant
    Filed: February 16, 2011
    Date of Patent: April 1, 2014
    Assignee: Wright State University
    Inventors: Amit Sheth, Karthik Gomadam, Meenakshi Nagarajan
  • Publication number: 20120143869
    Abstract: A named entity input is received and a target sense for which the named entity input is to be extracted from a set of documents is identified. An extraction complexity feature is generated based on the named entity input, the target sense, and the set of documents. The extraction complexity feature indicates how difficult or complex it is deemed to be to identify the named entity input for the target sense in the set of documents.
    Type: Application
    Filed: February 10, 2012
    Publication date: June 7, 2012
    Applicant: Microsoft Corporation
    Inventors: Amir J. Padovitz, Bala Meenakshi Nagarajan
  • Patent number: 8140567
    Abstract: A named entity input is received and a target sense for which the named entity input is to be extracted from a set of documents is identified. An extraction complexity feature is generated based on the named entity input, the target sense, and the set of documents. The extraction complexity feature indicates how difficult or complex it is deemed to be to identify the named entity input for the target sense in the set of documents.
    Type: Grant
    Filed: April 13, 2010
    Date of Patent: March 20, 2012
    Assignee: Microsoft Corporation
    Inventors: Amir J. Padovitz, Bala Meenakshi Nagarajan
  • Publication number: 20120042022
    Abstract: The present invention generally relates to methods and systems for analysis of real-time user-generated text messages. The methods and systems allow analysis to be performed using term associations and geographical and temporal constraints.
    Type: Application
    Filed: February 16, 2011
    Publication date: February 16, 2012
    Applicant: WRIGHT STATE UNIVERSITY
    Inventors: Amit Sheth, Karthik Gomadam, Meenakshi Nagarajan
  • Publication number: 20110252034
    Abstract: A named entity input is received and a target sense for which the named entity input is to be extracted from a set of documents is identified. An extraction complexity feature is generated based on the named entity input, the target sense, and the set of documents. The extraction complexity feature indicates how difficult or complex it is deemed to be to identify the named entity input for the target sense in the set of documents.
    Type: Application
    Filed: April 13, 2010
    Publication date: October 13, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Amir J. Padovitz, Bala Meenakshi Nagarajan