The search algorithm is the standard Viterbi search ( Viterbi 1967 ) , except that the match involves a network-to-network alignment problem rather than sequence-to-sequence .
error bounds for convolutional codes and an asymptotically optimal decoding algorithmquot
A Viterbi
The lexicon is entered as phonetic pronunciations that are then augmented to account for a number of phonological rules . The search algorithm is the standard Viterbi search ( Viterbi 1967 ) , except that the match involves a network-to-network alignment problem rather than sequence-to-sequence . When we first integrated this recognizer with TINA , we used a `` wire '' connection , in that the recognizer produced a single best output , which was then passed to TINA for parsing .
The search algorithm is the standard Viterbi search ( @@CITATION ) , except that the match involves a network-to-network alignment problem rather than sequence-to-sequence .