Use of a unified language model
First Claim
1. A computer readable medium having instructions to process information, the instructions comprising:
- a unified language model comprising;
a topic identification context-free grammar comprising non-terminal tokens representing semantic or syntactic concepts related to actions to be performed using slots and a plurality of informational context-free grammars associated with the slots of the topic identification context-free grammar, each informational context-free grammar having terminals associated with a slot; and
a N-gram language model having the non-terminal tokens; and
a language processing module capable of receiving an input signal indicative of language and accessing the unified language model to recognize the language and predict an action associated with the topic identification context-free grammar and a terminal associated with one of the slots, the language processing module providing an output signal indicative of the language, the action and an indication of the informational context-free grammar having the terminal associated with one of the slots.
1 Assignment
0 Petitions
Accused Products
Abstract
A language processing system includes a unified language model. The unified language model comprises a plurality of context-free grammars having non-terminal tokens representing semantic or syntactic concepts and terminals, and an N-gram language model having non-terminal tokens. A language processing module capable of receiving an input signal indicative of language accesses the unified language model to recognize the language. The language processing module generates hypotheses for the received language as a function of words of the unified language model and/or provides an output signal indicative of the language and at least some of the semantic or syntactic concepts contained therein.
52 Citations
24 Claims
-
1. A computer readable medium having instructions to process information, the instructions comprising:
-
a unified language model comprising;
a topic identification context-free grammar comprising non-terminal tokens representing semantic or syntactic concepts related to actions to be performed using slots and a plurality of informational context-free grammars associated with the slots of the topic identification context-free grammar, each informational context-free grammar having terminals associated with a slot; and
a N-gram language model having the non-terminal tokens; and
a language processing module capable of receiving an input signal indicative of language and accessing the unified language model to recognize the language and predict an action associated with the topic identification context-free grammar and a terminal associated with one of the slots, the language processing module providing an output signal indicative of the language, the action and an indication of the informational context-free grammar having the terminal associated with one of the slots. - View Dependent Claims (2, 3, 4)
-
-
5. A method to perform language processing comprising:
-
receiving an input signal indicative of language;
accessing a unified language model to recognize the language and predict non-terminal tokens contained therein, the unified language model comprising a topic identification context-free grammar comprising non-terminal tokens representing semantic or syntactic concepts related to actions to be performed using slots and a plurality of informational context-free grammars associated with the slots of the topic identification context-free grammar, each informational context-free grammar having terminals associated with a slot, and a N-gram language model having the non-terminal tokens;
recognizing the language and predict an action associated with the topic identification context-free grammar and a terminal associated with one of the slots; and
providing an output signal indicative of the language, the action and an indication of the informational context-free grammar having the terminal associated with one of the slots. - View Dependent Claims (6, 7, 8)
-
-
9. A computer readable medium including instructions readable by a computer which, when implemented execute a method to perform language processing for recognizing language and providing an output signal indicative thereof, the method comprising:
-
receiving an input signal indicative of language;
accessing a unified language model to recognize the language and predict non-terminal tokens contained therein, the unified language model comprising a topic identification context-free grammar comprising non-terminal tokens representing semantic or syntactic concepts related to actions to be performed using slots and a plurality of informational context-free grammars associated with the slots of the topic identification context-free grammar, each informational context-free grammar having terminals associated with a slot, and a N-gram language model having the non-terminal tokens;
recognizing the language and predict an action associated with the topic identification context-free grammar and a terminal associated with one of the slots; and
providing an output signal indicative of the language, the action and an indication of the informational context-free grammar having the terminal associated with one of the slots. - View Dependent Claims (10, 11, 12)
-
-
13. A computer readable medium having instructions to execute a method for recognizing language and providing an output signal indicative thereof, the method comprising:
-
receiving an input signal indicative of language;
accessing a unified language model to recognize the language and predict non-terminal tokens contained therein, the unified language model comprising a plurality of related context-free grammars comprising non-terminal tokens representing semantic or syntactic concepts and terminals, the plurality of related context-free grammars arranged in a hierarchical structure such that some of the non-terminal tokens of at least one of the plurality of the related context-free grammars are defined by another of the plurality of related context-free grammars, and a N-gram language model having the non-terminal tokens; and
providing an output signal indicative of the language and an indication of the plurality of related context-free grammars used in recognizing the language, wherein one of the used context-free grammars has a non-terminal token defined by another of the used context-free grammars. - View Dependent Claims (14, 15)
-
-
16. A language processing system comprising:
-
a unified language model comprising;
a plurality of related context-free grammars comprising non-terminal tokens representing semantic or syntactic concepts and terminals, the plurality of related context-free grammars arranged in a hierarchical structure such that some of the non-terminal tokens of at least one of the plurality of the related context-free grammars are defined by another of the plurality of related context-free grammars; and
a N-gram language model having the non-terminal tokens; and
a language processing module capable of receiving an input signal indicative of language and accessing the unified language model to recognize the language and predict non-terminal tokens contained therein, the language processing module further adapted to provide an output signal indicative of the language and an indication of the plurality of related context-free grammars used in recognizing the language, wherein one of the used context-free grammars has a non-terminal token defined by another of the used context-free grammars. - View Dependent Claims (17, 18)
-
-
19. A method to perform language processing, the method comprising:
-
receiving an input signal indicative of language;
accessing a unified language model to recognize the language and predict non-terminal tokens contained therein, the unified language model comprising a plurality of context-free grammars comprising non-terminal tokens representing semantic or syntactic concepts and terminals, wherein some of the non-terminal tokens correspond to actions having a plurality of slots corresponding to information related to the action, the slots being defined by other context-free grammars, and a N-gram language model having the non-terminal tokens; and
providing an output signal indicative of the language, one of the actions and information corresponding to the action that is associated with one of the plurality of slots. - View Dependent Claims (20, 21)
-
-
22. A language processing system comprising:
-
a unified language model comprising;
a plurality of context-free grammars comprising non-terminal tokens representing semantic or syntactic concepts and terminals, wherein some of the non-terminal tokens correspond to actions having a plurality of slots corresponding to information related to the action, the slots being defined by other context-free grammars; and
a N-gram language model having the non-terminal tokens; and
a language processing module capable of receiving an input signal indicative of language and accessing the unified language model to recognize the language and predict non-terminal tokens contained therein, the language processing module further adapted to provide an output signal indicative of the language, one of the actions and information corresponding to the action that is associated with one of the plurality of slots. - View Dependent Claims (23, 24)
-
Specification