src/libpocketsphinx/tst_search.h

Go to the documentation of this file.

/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
 * Copyright (c) 2009 Carnegie Mellon University.  All rights
 * reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer. 
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * This work was supported in part by funding from the Defense Advanced 
 * Research Projects Agency and the National Science Foundation of the 
 * United States of America, and the CMU Sphinx Speech Consortium.
 *
 * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 
 * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
 * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * ====================================================================
 *
 */

#ifndef __TST_SEARCH_H__
#define __TST_SEARCH_H__

/* SphinxBase headers. */
#include <cmd_ln.h>
#include <logmath.h>
#include <ngram_model.h>
#include <listelem_alloc.h>
#include <err.h>

/* Local headers. */
#include "pocketsphinx_internal.h"
#include "lextree.h"
#include "vithist.h"
#include "hmm.h"

typedef struct {
    int32 maxwpf;          
    int32 maxhistpf;       
    int32 maxhmmpf;        
    int32 hmm_hist_binsize;
    int32 hmm_hist_bins;   
    int32 *hmm_hist;       
} histprune_t;

typedef struct {
    int32 hmm;             
    int32 ptrans;          
    int32 word;            
    int32 ptranskip;       
    int32 wordend;         
    int32 n_ciphone;       
    int32 bestscore;       
    int32 bestwordscore;   
    int32 thres;           
    int32 phone_thres;     
    int32 word_thres;      
    int32 *wordbestscores; 
    int32 *wordbestexits;  
} beam_t;

typedef struct tst_stats_s {
    int32 n_hmm_eval;
    int32 n_senone_active_utt;
} tst_stats_t;

struct tst_search_s {
    ps_search_t base;
    ngram_model_t *lmset;  
    fillpen_t *fillpen;    
    int32 n_lextree;        
    lextree_t **curugtree;  
    hash_table_t *ugtree;  
    lextree_t **fillertree; 
    int32 n_lextrans;       
    int32 epl;              
    int32 isLMLA;  
    histprune_t *histprune; 
    beam_t *beam;           
    vithist_t *vithist;     
    bitvec_t *ssid_active;    
    bitvec_t *comssid_active; 
    int16 *composite_senone_scores; 
    FILE *hmmdumpfp; 
    int n_frame;  
    int exit_id;  
    tst_stats_t st; 
};
typedef struct tst_search_s tst_search_t;

ps_search_t *tst_search_init(cmd_ln_t *config,
                             acmod_t *acmod,
                             s3dict_t *dict,
                             dict2pid_t *d2p);

void tst_search_free(ps_search_t *search);


#endif /* __TST_SEARCH_H__ */

---