This diagram illustrates how a speech-recognition algorithm might identify a word by comparin
g a series of input vectors (i.e., speech samples) with a five-state stored HMM. Here we see three possible paths, all starting at the same state. The orange line indicates the "best path" through this HMM, the one that most closely matches the characteristics of the HMM. For this solution, the first two inputs keep the path in the first state of the HMM. In physical terms, if this HMM represented the word six, the orange path might suggest that the speaker lengthened the
s
Flexible C++
Matthew Wilson
My approach to software engineering is far more pragmatic than it
is
theoretical--and no language better exemplifies this than C++.
BYTE Digest editors every month analyze and evaluate the best articles from Information Week, EE Times, Dr. Dobb's Journal, Network Computing, Sys Admin,
and dozens of other CMP publications—bringing
you critical news and information about wireless communication,
computer security, software development, embedded systems,
and more!
