| H93-1018 | two important advantages of a | time-synchronous search | . First , it is necessary that |
| H90-1003 | used to speed up all of these | time-synchronous search | algorithms by a large factor |
| H90-1016 | reduce the computational cost for a | time-synchronous search | with a statistical grarnmar I |
| H93-1018 | fast match algorithm with the | time-synchronous search | because we consider starting |
| H93-1018 | compromise between the strict | time-synchronous search | and the best-first stack search |
| H93-1018 | use some inexpensive approximate | time-synchronous search | in the forward direction to speed |
| H93-1018 | more serious problem with the | time-synchronous search | is that it must follow a very |
| H93-1018 | shown to be effective . ) 2.1 . | Time-Synchronous Search | In the time-synchronous Viterbi |
