Assisted speech input

• US 8,856,006 B1
• Filed: 09/24/2012
• Issued: 10/07/2014
• Est. Priority Date: 01/06/2012
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Patel, Nirmal, Balez, Mat, Starner, Thad Eugene
• Primary Examiner(s): PULLIAS, JESSE SCOTT
• Application Number:
  US13/625,120
• Time in Patent Office: 743 Days
• Field of Search: 704/9, 704231-257
• US Class Current: 704/257
• CPC Class Codes: G10L 15/18 using natural language modelling
• CPC Class Codes: G10L 15/22 Procedures used during a speech recognition process, e.g. man-machine dialogue
• CPC Class Codes: G10L 2015/227 of the speaker; Human-factor methodology

Abstract

Methods and systems are provided for assisted speech input. In one example, the method may involve (a) designating a first node of a tree as a current node. Each node in the tree is associated with a speech input data, and the first node includes one or more child nodes. The method may further involve (b) removing all nodes from a first group of nodes, (c) copying each child node of the current node to the first group, (d) removing all nodes from a second group of nodes, (e) moving a selection of nodes from the first group to the second group, and (f) presenting information associated with each node in the second group. The method may include additional elements depending on whether there is a match between a received speech input and a child node of the current node.

Claims

1. A computing device comprising:

a non-transitory computer readable medium; and

program instructions stored on the non-transitory computer readable medium and executable by at least one processor to;

(a) designate a first node of a tree as a current node, wherein each node in the tree is associated with a speech input data, wherein the first node comprises one or more child nodes;

(b) remove all nodes from a first group of nodes;

(c) copy each child node of the current node to the first group;

(d) remove all nodes from a second group of nodes;

(e) move a selection of nodes from the first group to the second group; and

(f) present information associated with each node in the second group.

2. The computing device of claim 1, wherein the program instructions are further executable by the at least one processor to:

receive an arbitrary speech input;

determine that the arbitrary speech input corresponds to speech input data associated with a second node that is a child node of the current node; and

add the speech input of the current child node to an input-grammar segment.

3. The computing device of claim 2, wherein the program instructions are further executable by the at least one processor to:

determine that the second node comprises one or more child nodes; and

designate the second node as the current node.

4. The computing device of claim 3, wherein the program instructions are further executable by the at least one processor to:

perform (b)-(f).

5. The computing device of claim 2, wherein the program instructions are further executable by the at least one processor to:

determine that the second node does not comprise one or more child nodes, and

execute a function associated with the second node.

6. The computing device of claim 1, wherein the program instructions are further executable by the at least one processor to:

receive an arbitrary speech input;

determine that the arbitrary speech input does not correspond to speech input data associated with a child node of the current node; and

perform functions (d)-(f).

7. The computing device of claim 1, wherein the program instructions are further executable by the at least one processor to:

receive an arbitrary speech input;

determine a match between the arbitrary speech input and a speech input data associated with a child node of the current node; and

add the speech input associated a child nodes to an input-grammar segment.

8. The computing device of claim 7, wherein the received arbitrary speech input matches a speech input data associated with a child node in the second group.

9. The computing device of claim 7, wherein the received arbitrary speech input matches a speech input data associated with a child node in the first group.

10. The computing device of claim 7, wherein the program instructions are further executable by the at least one processor to:

receive initial speech input data before presenting information associated with each node in the second group; and

determine that the initial speech input data matches speech input data associated with a child node of the current node.

11. The computing device of claim 1, wherein program instructions executable by the at least one processor to move a selection of nodes from the first group to the second group comprise program instructions executable by the at least one processor to determine the selection of nodes from the first group to the second group based on a frequency of speech inputs associated with nodes in the first group of nodes.

12. The computing device of claim 1, further comprising a head-mountable display (HMD), wherein the program instructions executable by the at least one processor to present information associated with each node in the second group comprise instructions executable by the at least one processor to display the nodes in the second group on a graphical display of the HMD.

13. A non-transitory computer-readable medium having stored thereon instructions executable by a computing device to cause the computing device to cause the computing device to perform functions comprising:

(a) designating a first node of a tree as a current node, wherein each node in the tree is associated with a speech input, wherein the first node comprises one or more child nodes;

(b) removing all nodes from a first group of nodes;

(c) copying each child node of the current node to the first group;

(d) removing all nodes from a second group of nodes;

(e) moving a selection of nodes from the first group to the second group; and

(f) presenting information associated with each node in the second group.

14. The non-transitory computer-readable medium of claim 13, wherein the instructions are further executable to cause the computing device to perform functions comprising:

receiving an arbitrary speech input;

determining that the arbitrary speech input corresponds to speech input data associated with a second node that is a child node of the current node; and

adding the speech input data associated with the second node to an input-grammar segment.

15. The non-transitory computer-readable medium of claim 14, wherein the instructions are further executable to cause the computing device to perform functions comprising:

determining that the second node does not comprise one or more child nodes, and

executing a function associated with the second node.

16. The non-transitory computer-readable medium of claim 13, wherein the instructions are further executable to cause the computing device to:

receiving an arbitrary speech input;

determining that the arbitrary speech input does not correspond to speech input data associated with a child node of the current node; and

performing (d)-(g).

17. A computer-implemented method comprising:

(a) designating a first node of a tree as a current node, wherein each node in the tree is associated with a speech input, wherein the first node comprises one or more child nodes;

(b) removing all nodes from a first group of nodes;

(c) copying each child node of the current node to the first group;

(d) removing all nodes from a second group of nodes;

(e) moving a selection of nodes from the first group to the second group;

(f) causing a computing device to present information associated with each node in the second group.

18. The method of claim 17, further comprising:

receiving an arbitrary speech input;

determining that the arbitrary speech input corresponds to speech input data associated with a second node that is a child node of the current node; and

adding the speech input associated with the second node to an input-grammar segment.

19. The method of claim 18, wherein the received arbitrary speech input matches a speech input data associated with a child node in the second group.

20. The method of claim 18, wherein the received arbitrary speech input matches a speech input data associated with a child node in the first group.