fsg_search_internal.h

/* -*- c-basic-offset:4; indent-tabs-mode: nil -*- */
/* ====================================================================
 * Copyright (c) 1999-2004 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 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.
 *
 * ====================================================================
 *
 */

/*
 * fsg_search_internal.h -- Search structures for FSG decoding.
 */


#ifndef __S2_FSG_SEARCH_H__
#define __S2_FSG_SEARCH_H__


/* SphinxBase headers. */
#include <sphinxbase/glist.h>
#include <sphinxbase/cmd_ln.h>
#include <sphinxbase/fsg_model.h>

/* Local headers. */
#include "pocketsphinx_internal.h"
#include "hmm.h"
#include "fsg_history.h"
#include "fsg_lextree.h"

typedef struct fsg_seg_s {
    ps_seg_t base;  
    fsg_hist_entry_t **hist;   
    int16 n_hist;  
    int16 cur;      
} fsg_seg_t;

typedef struct fsg_search_s {
    ps_search_t base;

    hmm_context_t *hmmctx; 
    fsg_model_t *fsg;           
    struct fsg_lextree_s *lextree;
    struct fsg_history_s *history;
    glist_t pnode_active;       
    glist_t pnode_active_next;  
    int32 beam_orig;            
    int32 pbeam_orig;           
    int32 wbeam_orig;           
    float32 beam_factor;        
    int32 beam, pbeam, wbeam;   
    int32 lw, pip, wip;         
    frame_idx_t frame;          
    uint8 final;                
    uint8 bestpath;             
    float32 ascale;             
    int32 bestscore;            
    int32 bpidx_start;          
    int32 ascr, lscr;           
    int32 n_hmm_eval;           
    int32 n_sen_eval;           
    ptmr_t perf; 
    int32 n_tot_frame;
        
} fsg_search_t;

/* Access macros */
#define fsg_search_frame(s)     ((s)->frame)

ps_search_t *fsg_search_init(const char *name,
                             fsg_model_t *fsg,
                             cmd_ln_t *config,
                             acmod_t *acmod,
                             dict_t *dict,
                             dict2pid_t *d2p);

void fsg_search_free(ps_search_t *search);

int fsg_search_reinit(ps_search_t *fsgs, dict_t *dict, dict2pid_t *d2p);

int fsg_search_start(ps_search_t *search);

int fsg_search_step(ps_search_t *search, int frame_idx);

int fsg_search_finish(ps_search_t *search);

char const *fsg_search_hyp(ps_search_t *search, int32 *out_score);

#endif