System and method for using semantic and syntactic graphs for utterance classification
First Claim
Patent Images
1. A method comprising:
- generating, via a processor, a semantic and syntactic graph associated with a first call type;
converting the semantic and syntactic graph into a first finite state transducer;
composing the first finite state transducer with a second finite state transducer to form a third finite state transducer, wherein the second finite state transducer comprises all possible n-grams, and wherein the third finite state transducer comprises a subset of the all-possible n-grams;
extracting the subset of the all-possible n-grams as features from the third finite state transducer, to yield extracted n-grams;
associating an utterance with a second call type based on the extracted n-grams, to yield a classified utterance, wherein the second call type is determined based on semantic and syntactic features in the extracted n-grams; and
responding to a user in a natural language dialog based on the classified utterance.
4 Assignments
0 Petitions
Accused Products
Abstract
Disclosed herein is a system, method and computer readable medium storing instructions related to semantic and syntactic information in a language understanding system. The method embodiment of the invention is a method for classifying utterances during a natural language dialog between a human and a computing device. The method comprises receiving a user utterance; generating a semantic and syntactic graph associated with the received utterance, extracting all n-grams as features from the generated semantic and syntactic graph and classifying the utterance. Classifying the utterance may be performed any number of ways such as using the extracted n-grams, a syntactic and semantic graphs or writing rules.
-
Citations
20 Claims
-
1. A method comprising:
-
generating, via a processor, a semantic and syntactic graph associated with a first call type; converting the semantic and syntactic graph into a first finite state transducer; composing the first finite state transducer with a second finite state transducer to form a third finite state transducer, wherein the second finite state transducer comprises all possible n-grams, and wherein the third finite state transducer comprises a subset of the all-possible n-grams; extracting the subset of the all-possible n-grams as features from the third finite state transducer, to yield extracted n-grams; associating an utterance with a second call type based on the extracted n-grams, to yield a classified utterance, wherein the second call type is determined based on semantic and syntactic features in the extracted n-grams; and responding to a user in a natural language dialog based on the classified utterance. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system comprising:
-
a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising; generating a semantic and syntactic graph associated with a first call type; converting the semantic and syntactic graph into a first finite state transducer; composing the first finite state transducer with a second finite state transducer to form a third finite state transducer, wherein the second finite state transducer comprises all possible n-grams, and wherein the third finite state transducer comprises a subset of the all-possible n-grams; extracting the subset of the all-possible n-grams as features from the third finite state transducer, to yield extracted n-grams; associating an utterance with a second call type based on the extracted n-grams, to yield a classified utterance, wherein the second call type is determined based on semantic and syntactic features in the extracted n-grams; and responding to a user in a natural language dialog based on the classified utterance. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising:
-
generating a semantic and syntactic graph associated with a first call type; converting the semantic and syntactic graph into a first finite state transducer; composing the first finite state transducer with a second finite state transducer to form a third finite state transducer, wherein the second finite state transducer comprises all possible n-grams, and wherein the third finite state transducer comprises a subset of the all-possible n-grams; extracting the subset of the all-possible n-grams as features from the third finite state transducer, to yield extracted n-grams; associating an utterance with a second call type based on the extracted n-grams, to yield a classified utterance, wherein the second call type is determined based on semantic and syntactic features in the extracted n-grams; and responding to a user in a natural language dialog based on the classified utterance. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification