#include <search.h>
Collaboration diagram for __node__:
Data Fields | |
| __node__ * | next |
| Link to next hypothesis, used in stack. | |
| __node__ * | prev |
| Link to previous hypothesis, used in stack. | |
| boolean | endflag |
| TRUE if this is a final sentence result. | |
| WORD_ID | seq [MAXSEQNUM] |
| Word sequence. | |
| short | seqnum |
| Length of seq. | |
| LOGPROB | score |
| Total score (forward+backward, LM+AM). | |
| short | bestt |
| Best connection frame of last word in word trellis. | |
| short | estimated_next_t |
| Estimated next connection time frame (= beginning of last word on word trellis): next word hypothesis will be looked up near this frame on word trellis. | |
| LOGPROB * | g |
| Current forward viterbi score in each frame. | |
| TRELLIS_ATOM * | tre |
| Trellis word of last word. | |
| LOGPROB * | g_prev |
| Viterbi score back to last 1 phoneme. | |
| HMM_Logical * | last_ph |
| Last applied triphone. | |
Definition at line 131 of file search.h.
1.4.2