H90-1016 processor chips . However , the speech recognition search requires a large amount of computation
H90-1003 strategy increases the speed of the recognition search by a factor of 40 with no additional
H93-1018 Another approach to the speech recognition search problem is to reduce the computation
H89-1043 with word-lattice parsing . The recognition search space size is an equally significant
H89-1042 of a grammar to constrain the recognition search . These conditions are not those
H90-1017 An important component of the recognition search is the Rapid Matcher . In the
H89-1043 word lattice as representing the recognition search space . In word-lattice parsing
E09-1085 far are committed and the speech recognition search space is cleared . Note that
H90-1017 recognizer . 2.2 Recognition The recognition search to find the most likely sentence
H89-1043 can be used to reduce the speech recognition search space and therefore improve recognition
H90-1017 the use of rapid match to reduce recognition search was the single most important
D12-1070 Method Decoding of the speech recognition search space ASR is performed by T3
H91-1016 drive the word Izansifions in the recognition search rather than a bigram grammar
H92-1049 search , communicates with the recognition search via network sockets . We have
H92-1049 in a separate process from the recognition search , communicates with the recognition
D12-1070 it into a WFST - based speech recognition search space to give both resource-poor
H91-1052 statistical language modeling , and recognition search techniques , as well as adaptation
H90-1017 rapid match algorithm to reduce recognition search space , C code optimization ,
H93-1018 commonly used algorithms for speech recognition search are the time-synchronous beam
H93-1042 1381-word vocabulary . The progressive recognition search \ -LSB- 13 \ -RSB- is a three-pass
hide detail