|
PocketSphinx
0.6
|
| Acoustic model structure | |
| Segmentation "iterator" for A* search results | |
| Back pointer table (forward pass lattice; actually a tree) | |
| Segmentation "iterator" for backpointer table results | |
| Lexical tree node data type | |
| CI phone information | |
| Segmentation "iterator" for backpointer table results | |
| Building composite triphone (as well as word internal triphones) with the dictionary | |
| Structure for a dictionary | |
| Structure for one dictionary word | |
| Collection of lextrees for an FSG | |
| Implementation of FSG search (and "FSG set") structure | |
| Segmentation "iterator" for FSG history | |
| Structure to store distance (density) values for a given input observation wrt density values in some given codebook | |
| Multivariate gaussian mixture density parameters | |
| Shared information between a set of HMMs | |
| An individual HMM among the HMM search space | |
| Linked list of DAG link pointers | |
| The main model definition structure | |
| Multi-stream mixture gaussian | |
| N-Gram search module structure | |
| Various statistics for profiling | |
| Structures for storing the left context | |
| Structures needed for mapping <ci,lc,rc,wpos> into pid | |
| Renormalization event | |
| Phone loop structure | |
| Phone loop search structure | |
| Triphone information, including base phones as a subset | |
| A* search structure | |
| Decoder object | |
| Links between DAG nodes | |
| DAG nodes | |
| Partial path structure used in N-best (A*) search | |
| Word graph structure used in bestpath/nbest search | |
| Feature space linear transform structure | |
| Base structure for search module | |
| V-table for search algorithm | |
| Base structure for hypothesis segmentation iterator | |
| Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure | |
| 8-bit senone PDF structure | |
| Phone loop search structure | |
| Transition matrix data structure | |
| Cross word triphone model structure |