Natural Language Query Formulation Or Dialogue Systems (epo) Patents (Class 707/E17.139)
  • Patent number: 8285697
    Abstract: A data object submitted for storage is analyzed, and a set of values is extracted from the data object that can correspond to a set of attributes. The analysis of the data object can also identify possible new ontology terms. One or more extracted values are presented to the entity which submitted the data object for approval and feedback. This feedback can be used to characterize the data object with appropriate terms, train the extraction process for future extractions, and/or expand the set of known ontology terms.
    Type: Grant
    Filed: January 23, 2008
    Date of Patent: October 9, 2012
    Assignee: Google Inc.
    Inventor: Joel Truher
  • Publication number: 20100070521
    Abstract: Cross-lingual information retrieval is disclosed, comprising: translating a received query from a source natural language into a target natural language; performing a first information retrieval operation on a corpus of documents in the target natural language using the translated query to retrieve a set of pseudo-feedback documents in the target natural language; re-translating the received query from the source natural language into the target natural language using a translation model derived from the set of pseudo-feedback documents in the target natural language; and performing a second information retrieval operation on the corpus of documents in the target natural language using the re-translated query to retrieve an updated set of documents in the target natural language
    Type: Application
    Filed: September 18, 2008
    Publication date: March 18, 2010
    Inventors: Stephane Clinchant, Jean-Michel Renders
  • 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
  • Publication number: 20090192968
    Abstract: Embodiments of the present invention relate to knowledge representation systems which include a knowledge base in which knowledge is represented in a structured, machine-readable format that encodes meaning.
    Type: Application
    Filed: September 29, 2008
    Publication date: July 30, 2009
    Applicant: TRUE KNOWLEDGE LTD.
    Inventor: William Tunstall-Pedoe