第2パスの文仮説 [詳細]
#include <search.h>
NODEのコラボレーション図
変数 | |
| struct __node__ * | next |
| Link to next hypothesis, used in stack. | |
| struct __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. | |
| LOGPROB | final_g |
| Extra forward score on end of frame for multipath mode. | |
| int | state |
| (dfa) Current DFA state ID | |
| 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. | |
| boolean | last_ph_sp_attached |
| Last phone which the inter-word sp has been attached for multipath mode. | |
| LOGPROB | lscore |
| N-gram score of last word (will be used for 1-phoneme backscan and graph output, always 0 for dfa. | |
| LOGPROB | totallscore |
| (n-gram) Accumulated language score (LM only) | |
| WordGraph * | prevgraph |
| Graph word corresponding to the last word. | |
| WordGraph * | lastcontext |
| Graph word of next previous word. | |
| LOGPROB | tail_g_score |
| forward g score for later score adjustment | |
| struct __recogprocess__ * | region |
説明
この構造体の説明は次のファイルから生成されました:
- libjulius/include/julius/search.h
