IP Library Granted Patent US 10,176,167
Granted Patent B2
US 10,176,167 · App. 14/298,725 · Granted Jan 8, 2019

System and method for inferring user intent from speech inputs

Inventor: Gunnar Evermann (Boston, MA)
Assignee: Apple Inc.
G06F17/279G10L15/1822G10L15/26
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 10,176,167
App. No.
14/298,725
Granted
Jan 8, 2019
Kind
B2
Abstract

A text string with a first and a second portion is provided. A domain of the text string is determined by applying a first word-matching process to the first portion of the text string. It is then determined whether the second portion of the text string matches a word of a set of words associated with the domain by applying a second word-matching process to the second portion of the text string. Upon determining that the second portion of the text string matches the word of the set of words, it is determined whether a user intent from the text string based at least in part on the domain and the word of the set of words.

Claims (55)

1. A method for determining, from a text string, a user intent for performing a task, the method comprising:

at an electronic device with one or more processors and memory storing one or more programs for execution by the one or more processors:

providing a text string corresponding to a single speech input, wherein the text string comprises a first portion and a second portion, wherein the second portion is less than the entire text string;

determining a domain of the text string using natural language processing by applying a first word-matching process to at least the first portion of the text string;

determining whether the second portion of the text string matches at least one word of a set of words associated with the domain by applying a second word-matching process to the second portion of the text string, wherein the second word-matching process is not applied to the first portion of the text string;

upon determining that the second portion of the text string matches at least one word of the set of words, determining a user intent from the text string based at least in part on the domain and the at least one word of the set of words;

applying the determined user intent to determine one or more corresponding tasks; and

performing, the one or more tasks to satisfy the determined user intent.

2. The method of claim 1 , wherein word-matching criteria applied by the second word-matching process is more relaxed than word-matching criteria applied by the first word-matching process.

3. The method of claim 1 , wherein the first word-matching process requires exact matches between words, and the second word-matching process does not require exact matches between words.

4. The method of claim 1 , wherein the second word-matching process applies approximate string matching techniques.

5. The method of claim 1 , wherein the second word-matching process comprises determining an edit distance between a word of the second portion of the text string and a word of the set of words associated with the domain.

6. The method of claim 5 , wherein the edit distance is a Levenshtein distance.

7. The method of claim 1 , wherein the second word-matching process applies phonetic matching techniques.

8. The method of claim 1 , wherein applying the first word-matching process to the at least the first portion of the text string comprises applying the first word-matching process to only the first portion of the text string.

9. The method of claim 1 , further comprising:

determining whether the second portion of the text string matches at least one word of the set of words associated with the domain by applying the first word-matching process to the second portion of the text string; and

in accordance with a determination that the second portion of the text string fails to match at least one word of the set of words by applying the first word-matching process to the second portion of the text string, determining whether the second portion of the text string matches at least one word of the set of words by applying the second word-matching process to the second portion of the text string.

10. An electronic device, comprising:

one or more processors;

memory; and

one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:

providing a text string corresponding to a single speech input, wherein the text string comprises a first portion and a second portion, wherein the second portion is less than the entire text string;

determining a domain of the text string using natural language processing by applying a first word-matching process to at least the first portion of the text string;

determining whether the second portion of the text string matches at least one word of a set of words associated with the domain by applying a second word-matching process to the second portion of the text string, wherein the second word-matching process is not applied to the first portion of the text string;

upon determining that the second portion of the text string matches at least one word of the set of words, determining a user intent from the text string based at least in part on the domain and the at least one word of the set of words;

applying the determined user intent to determine one or more corresponding tasks; and

performing, the one or more tasks to satisfy the determined user intent.

11. The electronic device of claim 10 , wherein word-matching criteria applied by the second word-matching process is more relaxed than word-matching criteria applied by the first word-matching process.

12. The electronic device of claim 10 , wherein the first word-matching process requires exact matches between words, and the second word-matching process does not require exact matches between words.

13. The electronic device of claim 10 , wherein the second word-matching process applies approximate string matching techniques.

14. The electronic device of claim 10 , wherein the second word-matching process applies phonetic matching techniques.

15. The electronic device of claim 10 , wherein applying the first word-matching process to the at least the first portion of the text string comprises applying the first word-matching process to only the first portion of the text string.

16. The device of claim 10 , wherein the one or more programs further include instructions for:

determining whether the second portion of the text string matches at least one word of the set of words associated with the domain by applying the first word-matching process to the second portion of the text string; and

in accordance with a determination that the second portion of the text string fails to match at least one word of the set of words by applying the first word-matching process to the second portion of the text string, determining whether the second portion of the text string matches at least one word of the set of words by applying the second word-matching process to the second portion of the text string.

17. The device of claim 10 , wherein the second word-matching process comprises determining an edit distance between a word of the second portion of the text string and a word of the set of words associated with the domain.

18. The device of claim 17 , wherein the edit distance is a Levenshtein distance.

19. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with one or more processors and memory, cause the device to:

provide a text string corresponding to a single speech input, wherein the text string comprises a first portion and a second portion, wherein the second portion is less than the entire text string;

determine a domain of the text string using natural language processing by applying a first word-matching process to at least the first portion of the text string;

determine whether the second portion of the text string matches at least one word of a set of words associated with the domain by applying a second word-matching process to the second portion of the text string, wherein the second word-matching process is not applied to the first portion of the text string;

upon determining that the second portion of the text string matches at least one word of the set of words, determine a user intent from the text string based at least in part on the domain and the at least one word of the set of words;

apply the determined user intent to determine one or more corresponding tasks; and

perform, the one or more tasks to satisfy the determined user intent.

20. The non-transitory computer readable storage medium of claim 19 , wherein word-matching criteria applied by the second word-matching process is more relaxed than word-matching criteria applied by the first word-matching process.

21. The non-transitory computer readable storage medium of claim 19 , wherein the first word-matching process requires exact matches between words, and the second word-matching process does not require exact matches between words.

22. The non-transitory computer readable storage medium of claim 19 , wherein the second word-matching process applies approximate string matching techniques.

23. The non-transitory computer readable storage medium of claim 19 , wherein the second word-matching process applies phonetic matching techniques.

24. The non-transitory computer readable storage medium of claim 19 , wherein applying the first word-matching process to the at least the first portion of the text string comprises applying the first word-matching process to only the first portion of the text string.

25. The computer readable storage medium of claim 19 , wherein the instructions further cause the device to:

determine whether the second portion of the text string matches at least one word of the set of words associated with the domain by applying the first word-matching process to the second portion of the text string; and

in accordance with a determination that the second portion of the text string fails to match at least one word of the set of words by applying the first word-matching process to the second portion of the text string, determine whether the second portion of the text string matches at least one word of the set of words by applying the second word-matching process to the second portion of the text string.

26. The computer readable storage medium of claim 19 , wherein the second word-matching process comprises determining an edit distance between a word of the second portion of the text string and a word of the set of words associated with the domain.

27. The computer readable storage medium of claim 26 , wherein the edit distance is a Levenshtein distance.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 13, 2015
From: EVERMANN, GUNNAR
To: APPLE INC.
Reel/Frame 036101/0362 →
Continuity (2)
Provisional Application 61832896 · Jun 9, 2013
Related Publication 20140365209A1 · Dec 11, 2014
Cited By (43)
US 12,197,712 US 12,197,817 US 12,200,297 US 12,204,932 US 12,211,502 US 12,216,894 US 12,219,314 US 12,223,282 US 12,236,952 US 12,254,887 US 12,260,234 US 12,277,954 US 12,293,763 US 12,301,635 US 12,333,404 US 12,361,220 US 12,361,943 US 12,367,879 US 12,380,876 US 12,386,434 US 12,386,491 US 12,406,084 US 12,411,880 US 12,431,128 US 12,431,130 US 12,477,470 US 12,500,856 US 12,524,809 US 12,556,890 US 12,567,415 US 12,572,551 US 12,592,231 US 12,603,093 US 12,608,171 US 12,613,621 US 12,613,730 US 12,619,452 US 12,620,179 US 12,639,757 US 12,640,151 US 12,670,639 US 12,675,637 US 12,675,839