IP Library Granted Patent US 8,700,404
Granted Patent B1
US 8,700,404 · App. 11/212,266 · Granted Apr 15, 2014

System and method for using semantic and syntactic graphs for utterance classification

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,700,404
App. No.
11/212,266
Granted
Apr 15, 2014
Kind
B1
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.

Claims (59)

1. A method comprising:

receiving a user utterance as part of a natural language dialog with a human user;

applying a word n-gram classifier to the user utterance to obtain a first call type for the utterance;

when a confidence associated with the first call type meets a threshold level, associating the user utterance with the first call type to yield a classified utterance;

when the confidence associated with the first call type does not meet the threshold level, performing the steps of:

(i) generating a semantic and syntactic graph associated with the user utterance;

(ii) converting the semantic and syntactic graph into a first finite state transducer;

(iii) 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 n-grams;

(iv) extracting the n-grams as features from the third finite state transducer, to yield extracted n-grams; and

(v) associating the user 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 the human user in the natural language dialog based on the classified utterance.

2. The method of claim 1 , wherein the semantic and syntactic graph further comprises lexical information.

3. The method of claim 2 , wherein the semantic and syntactic graph further comprises named entities and semantic role labels.

4. The method of claim 2 , wherein the semantic and syntactic graph further comprises one of speech tags and a syntactic parse of the utterance.

5. The method of claim 1 , wherein generating the semantic and syntactic graph extends a feature set of a classifier that performs classifying the user utterance.

6. The method of claim 1 , wherein generating a semantic and syntactic graph associated with the user utterance further comprises adding transitions encoding semantic and syntactic categories of words to a word graph.

7. The method of claim 1 , wherein generating a semantic and syntactic graph associated with the user utterance further comprises utilizing one of: part of speech tags, a syntactic parse of the utterance, generic named entity tags, supertags and word stems in the graph.

8. The method of claim 1 , wherein extracting the n-grams as features from the semantic and syntactic graph further comprises enumerating all paths of the third finite state transducer.

9. The method of claim 1 , wherein classifying the user utterance further comprises classifying the user utterance using one of: the extracted n-grams, the semantic, and syntactic graph and writing rules.

10. 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:

receiving a user utterance as part of a natural language dialog with a human user;

applying a word n-gram classifier to the user utterance to obtain a first call type for the utterance;

when a confidence associated with the first call type meets a threshold level, associating the user utterance with the first call type to yield a classified utterance;

when the confidence associated with the first call type does not meet the threshold level, performing the steps of:

(i) generating a semantic and syntactic graph associated with the user utterance;

(ii) converting the semantic and syntactic graph into a first finite state transducer;

(iii) 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 n-grams;

(iv) extracting the n-grams as features from the third finite state transducer, to yield extracted n-grams; and

(v) associating the user 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 the human user in the natural language dialog based on the classified utterance.

11. The system of claim 10 , wherein the semantic and syntactic graph further comprises lexical information.

12. The system of claim 11 , wherein the semantic and syntactic graph further comprises named entities and semantic role labels.

13. The system of claim 11 , wherein the semantic and syntactic graph further comprises one of speech tags and a syntactic parse of the utterance.

14. The system of claim 10 , wherein generating the semantic and syntactic graph further extends a feature set of a classifier that classifies the user utterance.

15. The system of claim 10 , wherein generating the semantic and syntactic graph associated with the received utterance further adds transitions encoding semantic and syntactic categories of words to a word graph.

16. The system of claim 10 , wherein generating the semantic and syntactic graph associated with the user utterance further utilizes one of: part of speech tags, a syntactic parse of the utterance, generic named entity tags, supertags, and word stems in the graph.

17. The system of claim 10 , wherein extracting the n-grams as features from the semantic and syntactic graph further enumerates all paths of the third finite state transducer.

18. The system of claim 10 , wherein classifying the user utterance further classifies the user utterance using one of: the extracted n-grams, the semantic and syntactic graph and writing rules.

19. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising:

receiving a user utterance as part of a natural language dialog with a human user;

applying a word n-gram classifier to the user utterance to obtain a first call type for the utterance;

when a confidence associated with the first call type meets a threshold level, associating the user utterance with the first call type to yield a classified utterance;

when the confidence associated with the first call type does not meet the threshold level, performing the steps of:

(i) generating a semantic and syntactic graph associated with the user utterance;

(ii) converting the semantic and syntactic graph into a first finite state transducer;

(iii) 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 n-grams;

(iv) extracting the n-grams as features from the third finite state transducer, to yield extracted n-grams; and

(v) associating the user 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 the human user in the natural language dialog based on the classified utterance.

20. The computer-readable storage device of claim 19 , wherein the semantic and syntactic graph further comprises lexical information.

21. The computer-readable storage device of claim 20 , wherein the semantic and syntactic graph further comprises named entities and semantic role labels.

22. The computer-readable storage device of claim 20 , wherein the semantic and syntactic graph further comprises one of speech tags and a syntactic parse of the utterance.

23. The computer-readable storage device of claim 19 , wherein generating a semantic and syntactic graph extends a feature set of a classifier that performs classifying the user utterance.

24. The computer-readable storage device of claim 19 , wherein generating a semantic and syntactic graph associated with the user utterance further comprises adding transitions encoding semantic and syntactic categories of words to a word graph.

25. The computer-readable storage device of claim 19 , wherein generating a semantic and syntactic graph associated with the user utterance further comprises utilizing one of: part of speech tags, a syntactic parse of the utterance, generic named entity tags, supertags, and word stems in the graph.

26. The computer-readable storage device of claim 19 , wherein extracting n-grams as features from the semantic and syntactic graph further comprises enumerating all paths of the third finite state transducer.

27. The computer-readable storage device of claim 19 , wherein classifying the user utterance further comprises classifying the user utterance based on one of: the extracted n-grams, the semantic and syntactic graph and writing rules.

Assignments (6)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 9, 2023
From: NUANCE COMMUNICATIONS, INC.
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 065533/0389 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 26, 2017
From: AT&T INTELLECTUAL PROPERTY II, L.P.
To: NUANCE COMMUNICATIONS, INC.
Reel/Frame 041512/0608 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 16, 2015
From: AT&T CORP.
To: AT&T PROPERTIES, LLC
Reel/Frame 034966/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 16, 2015
From: AT&T PROPERTIES, LLC
To: AT&T INTELLECTUAL PROPERTY II, L.P.
Reel/Frame 034966/0063 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 15, 2005
From: CHOTIMONGKOL, ANANLADA; HAKKANI-TUR, DILEK Z.; TUR, GOKHAN
To: AT&T CORP.
Reel/Frame 017237/0275 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 11, 2005
From: CHOTIMONGKOL, ANANLADA; HAKKANI-TUR, DILEK Z.; TUR, GOKHAN
To: AT&T CORP.
Reel/Frame 017242/0520 →