Registering an utterance and an associated destination anchor with a speech recognition engine

• US 20040148173A1
• Filed: 01/23/2003
• Published: 07/29/2004
• Est. Priority Date: 01/23/2003
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Wu, Gansha
• Granted Patent: US 7,313,527 B2
• Time in Patent Office: Days
• US Class Current: 704/270.1
• CPC Class Codes: G10L 15/06 Creation of reference templates; Training of speech recognition systems, e.g. adaptation to the characteristics of the speaker's voice G10L15/14 takes precedence
• CPC Class Codes: G10L 2015/0636 Threshold criteria for the updating

Abstract

A method for registering an utterance and an associated destination anchor with a speech recognition engine. The method includes getting a list of all nodes with links in a document being displayed by a browser by using a programmatic interface provided by the browser. For each node in the list of all nodes, the method gets a destination anchor for the node. If the destination anchor exists, the method forms the utterance by recursively collecting text from subnodes of the node. The utterance and the destination anchor a registered with the speech recognition engine.

Claims

1. A method for registering an utterance and an associated destination anchor with a speech recognition engine, the method comprising:

getting a list of all nodes with links in a document being displayed by a browser by using a programmatic interface provided by the browser;

for each node in the list of all nodes,

getting a destination anchor for the node;

if the destination anchor exists, forming the utterance by recursively collecting text from subnodes of the node; and

registering the utterance and the destination anchor with the speech recognition engine.

2. The method of claim 1, wherein forming the utterance further comprises recursively examining the subnodes of the node for alternate text and using the alternate text as the utterance if the collected text is blank.

3. The method of claim 1, further comprising traversing parent nodes of the node and accumulating position offsets to obtain a position of the node.

4. The method of claim 3, further comprising marking the position of the node as relative to a container node if the container node is a parent node of the node, otherwise marking the position of the node as absolute.

5. The method of claim 3, wherein registering further comprises registering the position of the node with the speech recognition engine.

6. The method of claim 3, wherein the parent node is temporarily made visible if the parent node is hidden.

7. The method of claim 3, further comprising adding a visible tag string in the vicinity of the position of the node and further registering the visible tag string with the speech recognition engine.

8. A computer-readable medium having a sequence of instructions, the sequences of instructions, when executed by a processor, causing the processor to perform a method for registering an utterance and an associated destination anchor with a speech recognition engine, the method comprising:

getting a list of all nodes with links in a document being displayed by a browser by using a programmatic interface provided by the browser;

for each node in the list of all nodes

getting a destination anchor for the node;

if the destination anchor exists, forming the utterance by recursively collecting text from subnodes of the node; and

registering the utterance and the destination anchor with the speech recognition engine.

9. The computer-readable medium of claim 8, wherein forming the utterance further comprises recursively examining the subnodes of the node for alternate text and using the alternate text as the utterance if the collected text is blank.

10. The computer-readable medium of claim 8, wherein the method further comprises traversing parent nodes of the node and accumulating position offsets to obtain a position of the node.

11. The computer-readable medium of claim 10, wherein the method further comprises marking the position of the node as relative to a container node if the container node is a parent node of the node, otherwise marking the position of the node as absolute.

12. The computer-readable medium of claim 10, wherein registering further comprises registering the position of the node with the speech recognition engine.

13. The computer-readable medium of claim 10, wherein the parent node is temporarily made visible if the parent node is hidden.

14. The computer-readable medium of claim 10, wherein the method further comprises adding a visible tag string in the vicinity of the position of the node and further registering the visible tag string with the speech recognition engine.

15. A speech recognition system comprising:

a document parser to get a list of all nodes with links in a document being displayed by a browser by using a programmatic interface provided by the browser;

a node parser to create a destination anchor for the node and, if the destination anchor exists, to form the utterance by recursively collecting text from subnodes of the node, for each node in the list of all nodes; and

a registration engine to register the utterance and the destination anchor with a finite state grammar controller.

16. The speech recognition system of claim 15, wherein the node parser is to form the utterance by further recursively examining the subnodes of the node for alternate text and using the alternate text as the utterance if the collected text is blank.

17. The speech recognition system of claim 15, further comprising a position parser to traverse parent nodes of the node and to accumulate position offsets to obtain a position of the node.

18. The speech recognition system of claim 17, wherein the position parser is further to mark the position of the node as relative to a container node if the container node is a parent node of the node, otherwise to mark the position of the node as absolute.

19. The speech recognition system of claim 17, wherein the registration engine is further to register the position of the node with the finite state grammar controller.

20. The speech recognition system of claim 17, wherein the position parser is further to temporarily make the parent node visible if the parent node is hidden.

21. The speech recognition system of claim 17, further comprising a tag generator to add a visible tag string in the vicinity of the position of the node and the registration engine is further to register the visible tag string with the finite state grammar controller.