Formal Grammars, E.g., Finite State Automata, Context Free Grammars, Word Networks, Etc. (epo) Patents (Class 704/E15.022)
  • Patent number: 11908475
    Abstract: A method, system, and non-transitory computer readable media for converting input from a user into a human interface device (HID) output to cause a corresponding action at an mapped device includes receiving one or more user input from a user at an input device, analyzing the user input selecting a command from a command profile that maps at least one of the received user inputs to one or more mapped tasks, executing the one or more mapped tasks associated with the selected command, and causing one or more corresponding actions at one or more mapped devices associated with the one or more mapped tasks.
    Type: Grant
    Filed: February 10, 2023
    Date of Patent: February 20, 2024
    Assignee: CEPHABLE INC.
    Inventor: Alexander Dunn
  • Patent number: 8849665
    Abstract: A machine translation method, system for using the method, and computer readable media are disclosed. The method includes the steps of receiving a source language sentence, selecting a set of target language n-grams using a lexical classifier and based on the source language sentence. When selecting the set of target language n-grams, in at least one n-gram, n is greater than 1. The method continues by combining the selected set of target language n-grams as a finite state acceptor (FSA), weighting the FSA with data from the lexical classifier, and generating an n-best list of target sentences from the FSA. As an alternate to using the FSA, N strings may be generated from the n-grams and ranked using a language model. The N strings may be represented by an FSA for efficiency but it is not necessary.
    Type: Grant
    Filed: January 30, 2008
    Date of Patent: September 30, 2014
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Srinivas Bangalore, Emil Ettelaie
  • Publication number: 20100042404
    Abstract: A method of generating a natural language model for use in a spoken dialog system is disclosed. The method comprises using sample utterances and creating a number of hand crafted rules for each call-type defined in a labeling guide. A first NLU model is generated and tested using the hand crafted rules and sample utterances. A second NLU model is built using the sample utterances as new training data and using the hand crafted rules. The second NLU model is tested for performance using a first batch of labeled data. A series of NLU models are built by adding a previous batch of labeled data to training data and using a new batch of labeling data as test data to generate the series of NLU models with training data that increases constantly. If not all the labeling data is received, the method comprises repeating the step of building a series of NLU models until all labeling data is received.
    Type: Application
    Filed: October 20, 2009
    Publication date: February 18, 2010
    Applicant: AT&T Corp.
    Inventors: Narendra K. Gupta, Mazin G. Rahim, Gokhan Tur, Antony Van der Mude
  • Publication number: 20090182561
    Abstract: A speech recognition device and a method thereof are adapted to recognize a Chinese word. The speech recognition device includes a lexicon model, a language model, a speech recognition module, and a parsing module. The lexicon model keeps a plurality of words. The speech recognition module performs a speech recognition processing on a voice signal conforming to a syntax structure of Chinese word description. The speech recognition processing searches words related to the Chinese word description from the lexicon model according to a feature of the Chinese word description, and produces a literal word series in digital data form by referring a syntax combination probability. The language model based on the syntax structure of Chinese word description provides the syntax combination probability according to combination relations between the searched words. The parsing module analyzes the syntax structure of the literal word series for retrieving the Chinese word.
    Type: Application
    Filed: September 16, 2008
    Publication date: July 16, 2009
    Applicant: DELTA ELECTRONICS, INC.
    Inventors: Liang-Sheng Huang, Chao-Jen Huang, Jia-Lin Shen
  • Publication number: 20090138257
    Abstract: A document analysis, commenting, and reporting system provides tools that automate quality assurance analysis tailored to specific document types. As one example, the specific document type may be a requirements specification and the system may tag different parts of requirements, including actors, entities, modes, and a remainder. However, the flexibility of the system permits analysis of any other document type, such as instruction manuals and best practices guides. The system helps avoid confusion over the document when it is delivered because of non-standard terms, ambiguous language, conflicts between document sections, incomplete or inaccurate descriptions, size and complexity of the document, and other issues.
    Type: Application
    Filed: November 27, 2007
    Publication date: May 28, 2009
    Inventors: Kunal Verma, Alex Kass
  • Publication number: 20090094018
    Abstract: A method and a device including a display, a memory, a processor and a keypad, wherein the device is configured to identify a flexible phrase having at least one empty field, receive input corresponding to at least one field value and insert said at least one field value into said at least one empty field thereby completing the flexible phrase.
    Type: Application
    Filed: October 8, 2007
    Publication date: April 9, 2009
    Applicant: Nokia Corporation
    Inventors: Rile Hu, Yue Zhong Tang, Xia Wang, Juha Iso-Sipila
  • Publication number: 20090034693
    Abstract: Embodiments are provided for utilizing speech analytics for automatically managing messages in a communications network. A message from a calling party to an unavailable called party is recorded in a messaging management module. The messaging management module automatically identifies a category for assigning to the content of the message based on information associated with the unavailable called party or a calling party and associates a language model with the message content based on the category. An analysis module utilizes the language model to identify grammar making up the message content. The messaging management module automatically performs a messaging management function on the message content based on a set of rules. The messaging management function may include automatically determining a priority for the message (enabling the message to be retrieved out of order) or automatically triggering an action in response to the message which is directed to the unavailable called party.
    Type: Application
    Filed: July 31, 2007
    Publication date: February 5, 2009
    Inventor: David J. Anderson
  • Publication number: 20080154581
    Abstract: Methods and systems for dynamic natural language understanding. A hierarchical structure of semantic categories is exploited to assist in the natural language understanding. Optionally, the natural language to be understood includes a request.
    Type: Application
    Filed: March 12, 2008
    Publication date: June 26, 2008
    Applicant: Intelligate, Ltd.
    Inventors: Ofer Lavi, Gadiel Auerbach, Eldad Persky
  • Publication number: 20080126078
    Abstract: A grammatical inference system for inferring a grammar from a plurality of example sentences. The system selects sentences having a common suffix or prefix component; identifies the other of said suffix or prefix component of each selected sentence; generating rules for generating the example sentences and the other components; reduces the right hand side of each rule on the basis of the right hand sides of the other rules; and generates a grammar on the basis of the reduced rules.
    Type: Application
    Filed: April 29, 2004
    Publication date: May 29, 2008
    Inventor: Bradford Craig Starkie
  • Publication number: 20080046242
    Abstract: A computer-loadable data structure is provided that represents a state-and-transition-based description of a speech grammar. The data structure includes first and second transition entries that both represent transitions from a first state. The second transition entry is contiguous with the first transition entry in the data structure and includes a last-transition value. The last-transition value indicating that the second transition is the last transition from the first state in the data structure.
    Type: Application
    Filed: September 18, 2007
    Publication date: February 21, 2008
    Applicant: Microsoft Corporation
    Inventors: Philipp Schmid, Ralph Lipe