libjulius/include/julius/search.h

Go to the documentation of this file.

/*
 * Copyright (c) 1991-2007 Kawahara Lab., Kyoto University
 * Copyright (c) 2000-2005 Shikano Lab., Nara Institute of Science and Technology
 * Copyright (c) 2005-2007 Julius project team, Nagoya Institute of Technology
 * All rights reserved
 */

#ifndef __J_SEARCH_H__
#define __J_SEARCH_H__

typedef struct __nextword__ {
  WORD_ID id;                   
  LOGPROB lscore;               
  int next_state;               
  boolean can_insert_sp;        
  TRELLIS_ATOM *tre;            
} NEXTWORD;

#ifdef VISUALIZE

typedef struct __popnode__ {
  TRELLIS_ATOM *tre;            
  LOGPROB score;                
  struct __popnode__ *last;     
  struct __popnode__ *next;     
} POPNODE;
#endif /* VISUALIZE */

typedef struct __node__ {
  struct __node__    *next;     
  struct __node__    *prev;     
  boolean endflag;              
  WORD_ID seq[MAXSEQNUM];       
  short seqnum;                 
  LOGPROB score;                
  short bestt;                  
  short estimated_next_t;       
  LOGPROB *g;                   
  LOGPROB final_g;              
  int state;                    
  TRELLIS_ATOM *tre;            
  
#ifndef PASS2_STRICT_IWCD
  /* for inter-word context dependency, the last phone on previous word
     need to be calculated later */
  LOGPROB *g_prev;              
#endif
  HMM_Logical *last_ph;         
  boolean last_ph_sp_attached;  
  LOGPROB lscore;               
  LOGPROB totallscore;          
#ifdef CONFIDENCE_MEASURE
#ifdef CM_MULTIPLE_ALPHA
  LOGPROB cmscore[MAXSEQNUM][100]; 
#else
  LOGPROB cmscore[MAXSEQNUM];   
#endif /* CM_MULTIPLE_ALPHA */
#endif /* CONFIDENCE_MEASURE */
#ifdef VISUALIZE
  POPNODE *popnode;             
#endif
#ifdef GRAPHOUT_PRECISE_BOUNDARY
  short *wordend_frame;         
  LOGPROB *wordend_gscore;      
#endif
  WordGraph *prevgraph;         
  WordGraph *lastcontext;       
#ifndef GRAPHOUT_PRECISE_BOUNDARY
  LOGPROB tail_g_score;         
#endif

  struct __recogprocess__ *region;              

} NODE;

/*
  HOW SCORES ARE CALCULATED:
  
              0         bestt                            T-1
              |-h(n)---->|<------------g(n)--------------|
==============================================================
              |\                                         |
              .....                                  .....  
                                                            <word trellis>
              |    \estimated_next_t                     |  =backward trellis
--------------------\------------------------------------|  (1st pass)
              |      \                                   |   
seq[seqnum-1] |       \_                                 |   
              |         \bestt                           |   
=========================+====================================================
              |           \                              |<-g[0..T-1]
              |            \                             |   
seq[seqnum-2] |             \__                          |
              |                \                         |
--------------------------------\------------------------|
     (last_ph)|                  \__                     |
              |_ _ _ _ _ _ _ _ _ _ _\ _ _ _ _ _ _ _ _ _ _|
seq[seqnum-3] |                      \______             |<--g_prev[0..T-1]
              |                             \___         |  
              |                                 \        |  
-------------------------------------------------\-------|  <forward trellis>
              ......                                ......  (2nd pass)

              |                                        \_|
===============================================================       
*/

#endif /* __J_SEARCH_H__ */

---