|
SphinxBase
5prealpha
|
Word level FSG definition. More...
#include <fsg_model.h>
Data Fields | |
| int | refcount |
| Reference count. | |
| char * | name |
| A unique string identifier for this FSG. | |
| int32 | n_word |
| Number of unique words in this FSG. | |
| int32 | n_word_alloc |
| Number of words allocated in vocab. | |
| char ** | vocab |
| Vocabulary for this FSG. | |
| bitvec_t * | silwords |
| Indicates which words are silence/fillers. | |
| bitvec_t * | altwords |
| Indicates which words are pronunciation alternates. | |
| logmath_t * | lmath |
| Pointer to log math computation object. | |
| int32 | n_state |
| number of states in FSG | |
| int32 | start_state |
| Must be in the range [0..n_state-1]. | |
| int32 | final_state |
| Must be in the range [0..n_state-1]. | |
| float32 | lw |
| Language weight that's been applied to transition logprobs. | |
| trans_list_t * | trans |
| Transitions out of each state, if any. | |
| listelem_alloc_t * | link_alloc |
| Allocator for FSG links. | |
Word level FSG definition.
States are simply integers 0..n_state-1. A transition emits a word and has a given probability of being taken. There can also be null or epsilon transitions, with no associated emitted word.
Definition at line 99 of file fsg_model.h.