julius/search.h

説明を見る。

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

#ifndef __SENT_SEARCH_H__
#define __SENT_SEARCH_H__

typedef struct __nextword__ {
  WORD_ID id;                   
#ifdef USE_NGRAM
  LOGPROB lscore;               
#else  /* USE_DFA */
  int next_state;               
  boolean can_insert_sp;        
#endif
  TRELLIS_ATOM *tre;            
} NEXTWORD;

#ifdef VISUALIZE

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

#ifdef GRAPHOUT
#define FANOUTSTEP 7            


typedef struct __word_graph__ {
  WORD_ID wid;                  
  int lefttime;                 
  int righttime;                
  LOGPROB fscore_head;          
  LOGPROB fscore_tail;          
  LOGPROB gscore_head;          
  LOGPROB gscore_tail;          
#ifdef USE_NGRAM
  LOGPROB lscore;               
#endif
#ifdef CM_SEARCH
  LOGPROB cmscore;              
#endif
  HMM_Logical *headphone;       
  HMM_Logical *tailphone;       
  struct __word_graph__ **leftword; 
  int leftwordnum;              
  int leftwordmaxnum;           
  struct __word_graph__ **rightword; 
  int rightwordnum;             
  int rightwordmaxnum;          
  struct __word_graph__ *next;  
  boolean mark;                 
  int id;                       
  boolean saved;                
#ifdef GRAPHOUT_DYNAMIC
  boolean purged;               
#endif
} WordGraph;
#endif /* GRAPHOUT */

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;                   
#ifdef MULTIPATH_VERSION
  LOGPROB final_g;              
#endif
#ifdef USE_DFA
  int state;                    
#endif
  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;         
#ifdef MULTIPATH_VERSION
  boolean last_ph_sp_attached;  
#endif
#ifdef USE_NGRAM
  LOGPROB lscore;               
  LOGPROB totallscore;          
#endif /* USE_NGRAM */
#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
#ifdef GRAPHOUT_PRECISE_BOUNDARY
  short *wordend_frame;         
  LOGPROB *wordend_gscore;      
#endif
  WordGraph *prevgraph;         
  WordGraph *lastcontext;       
#ifndef GRAPHOUT_PRECISE_BOUNDARY
  LOGPROB tail_g_score;         
#endif
#endif /* GRAPHOUT */
} 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 /* __SENT_SEARCH_H__ */

---