Speech recognition system with huge vocabulary
View Patent ↗The invention deals with speech recognition, such as a system for recognizing words in continuous speech. A speech recognition system is disclosed which is capable of recognizing a huge number of words, and in principle even an unlimited number of words. The speech recognition system comprises a word recognizer for deriving a best path through a word graph, and wherein words are assigned to the speech based on the best path. The word score being obtained from applying a phonemic language model to each word of the word graph. Moreover, the invention deals with an apparatus and a method for identifying words from a sound block and to computer readable code for implementing the method.
1. A speech recognition system for identifying words from a sound block, the speech recognition system comprising:
a word recognizer for deriving a best path through a word graph, each word in the word graph having assigned a word score and a phonetic transcription, and wherein words are assigned to the sound block based on the best path, wherein the word score of each word in the word graph includes the word score as obtained from applying a phonemic language model to each word of the word graph;
a phoneme recognizer for extracting from the sound block a phoneme graph, the phoneme graph assigning a phoneme to each edge, and wherein the phonetic transcription of the words in the word graph are based on the phoneme graph; and
a word-phoneme graph generator for converting the phoneme graph to a word-phoneme graph, the word-phoneme graph assigning a word and associated phonetic transcription to each edge.
2. The speech recognition system according to claim 1 , wherein the speech recognition system is based on a lexicon of allowed words comprising more than 200,000 words.
3. The speech recognition system according to claim 1 , wherein an acoustic phoneme score is assigned to each phoneme.
4. The speech recognition system according to claim 1 , wherein phoneme sequence hypotheses are determined and added to the phoneme graph thereby providing an extended phoneme graph, and wherein the word-phoneme graph is based on the extended phoneme graph.
5. The speech recognition system according to claim 4 , wherein the extended phoneme graph is filtered by applying a lexicon of allowed words, so as to remove phoneme sequences of the extended phoneme graph comprising words which are not present in the lexicon.
6. The speech recognition system according to claim 1 , wherein a time-synchronous word-phoneme graph is provided, and wherein words having no connection either forward or backward in time are removed from the word-phoneme graph.
7. The speech recognition system according to claim 1 , further comprising a word graph generator for converting the word-phoneme graph to the word graph, the word graph assigning a word to each edge.
8. The speech recognition system according to claim 1 , wherein the phonemic language model is an m-gram language model or a compact variagram.
9. A method of identifying words from a sound block, the method comprising:
deriving, with at least one processor, a best path through a word graph where each word in the word graph has assigned a word score and a phonetic transcription, and wherein words are assigned to the sound block based on the best path, wherein the word score of each word in the word graph includes the word score as obtained from applying a phonemic language model to each word of the word graph;
extracting from the sound block a phoneme graph, the phoneme graph assigning a phoneme to each edge, and wherein the phonetic transcriptions of the words in the word graph are based on the phoneme graph; and
converting the phoneme graph to a word-phoneme graph, the word-phoneme graph assigning a word and associated phonetic transcription to each edge.
10. The method according to claim 9 , further comprising:
assigning an acoustic phoneme score to each phoneme.
11. The method according to claim 9 , further comprising:
determining and adding phoneme sequence hypotheses to the phoneme graph thereby providing an extended phoneme graph, and wherein the word-phoneme graph is based on the extended phoneme graph.
12. The method according to claim 11 , further comprising:
filtering the extended phoneme graph by applying a lexicon of allowed words, so as to remove phoneme sequences of the extended phoneme graph comprising words which are not present in the lexicon.
13. The method according to claim 9 , wherein the word-phoneme graph includes time-synchronous information, the method further comprising:
removing from the word-phoneme graph based, at least in part, on the time-synchronous information, words having no connection either forward or backward in time.
14. The method according to claim 9 , further comprising:
converting the word-phoneme graph to the word graph, the word graph assigning a word to each edge.
15. The method according to claim 9 , wherein the phonemic language model is an m-gram language model or a compact variagram.