Converting partial word lists into a phoneme tree for speech recognition
First Claim
Patent Images
1. A computer implemented method of converting a text form into a phoneme tree, comprising:
- parsing a data source in the text form to obtain a plurality of partial word lists of the data source, the data source comprising content of a web page;
compiling the plurality of partial word lists to create a plurality of phoneme graphs, each phoneme graph corresponding to a respective partial word list, each phoneme graph including a root node, a plurality of phonemes, and an end node;
combining the plurality of phoneme graphs to form the phoneme tree, wherein the phoneme tree includes at least a first phoneme graph and a second phoneme graph sharing a common root node and a common end node.
7 Assignments
0 Petitions
Accused Products
Abstract
The present invention discloses converting a text form into a speech. In the present invention, partial word lists of a data source are obtained by parsing the data source in parallel or in series. The partial word lists are then compiled to obtain phoneme graphs corresponding, respectively, to the partial word lists, and then the obtained phoneme graphs are combined. Speech recognition is then conducted according to the combination results. According to the present invention, computational complexity may be reduced and recognition efficiency may be improved during speech recognition.
-
Citations
8 Claims
-
1. A computer implemented method of converting a text form into a phoneme tree, comprising:
-
parsing a data source in the text form to obtain a plurality of partial word lists of the data source, the data source comprising content of a web page; compiling the plurality of partial word lists to create a plurality of phoneme graphs, each phoneme graph corresponding to a respective partial word list, each phoneme graph including a root node, a plurality of phonemes, and an end node; combining the plurality of phoneme graphs to form the phoneme tree, wherein the phoneme tree includes at least a first phoneme graph and a second phoneme graph sharing a common root node and a common end node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
Specification