void
ps_search_init(ps_search_t *search, ps_searchfuncs_t *vt,
cmd_ln_t *config, acmod_t *acmod, dict_t *dict,
dict2pid_t *d2p)
{
search->vt = vt;
search->config = config;
search->acmod = acmod;
if (d2p)
search->d2p = dict2pid_retain(d2p);
else
search->d2p = NULL;
if (dict) {
search->dict = dict_retain(dict);
search->start_wid = dict_startwid(dict);
search->finish_wid = dict_finishwid(dict);
search->silence_wid = dict_silwid(dict);
search->n_words = dict_size(dict);
}
else {
search->dict = NULL;
search->start_wid = search->finish_wid = search->silence_wid = -1;
search->n_words = 0;
}
}
/*
* Add silence and noise filler words to the FSG.
* Return the number of transitions added..
*/
static int32
word_fsg_add_filler(word_fsg_t * fsg, float32 silprob, float32 fillprob, logmath_t * logmath)
{
dict_t *dict;
int32 src;
int32 wid, silwid, n_word;
int32 n_trans;
int32 logsilp, logfillp;
E_INFO("Adding filler words to FSG\n");
assert(fsg);
dict = fsg->dict;
silwid = dict_silwid(dict);
n_word = dict_size(dict);
logsilp = (int32) (logs3(logmath, silprob) * fsg->lw);
logfillp = (int32) (logs3(logmath, fillprob) * fsg->lw);
/*
* Add silence and filler word self-loop transitions to each state.
* NOTE: No check to see if these words already exist in FSG!
*/
n_trans = 0;
if (silwid >= 0) {
for (src = 0; src < fsg->n_state; src++) {
word_fsg_trans_add(fsg, src, src, logsilp, silwid);
n_trans++;
if (fillprob > 0.0) {
/* Add other filler (noise) words */
for (wid = silwid + 1; wid < n_word; wid++) {
word_fsg_trans_add(fsg, src, src, logfillp, wid);
n_trans++;
}
}
}
}
return n_trans;
}
void
ps_search_base_reinit(ps_search_t *search, dict_t *dict,
dict2pid_t *d2p)
{
dict_free(search->dict);
dict2pid_free(search->d2p);
/* FIXME: _retain() should just return NULL if passed NULL. */
if (dict) {
search->dict = dict_retain(dict);
search->start_wid = dict_startwid(dict);
search->finish_wid = dict_finishwid(dict);
search->silence_wid = dict_silwid(dict);
search->n_words = dict_size(dict);
}
else {
search->dict = NULL;
search->start_wid = search->finish_wid = search->silence_wid = -1;
search->n_words = 0;
}
if (d2p)
search->d2p = dict2pid_retain(d2p);
else
search->d2p = NULL;
}
int32 vithist_utt_end (vithist_t *vh, kbcore_t *kbc)
{
int32 f, i, b, l;
int32 sv, nsv, scr, bestscore, bestvh, vhid;
vithist_entry_t *ve, *bestve=0;
s3lmwid_t endwid;
lm_t *lm;
dict_t *dict;
/* Find last frame with entries in vithist table */
for (f = vh->n_frm-1; f >= 0; --f) {
sv = vh->frame_start[f]; /* First vithist entry in frame f */
nsv = vh->frame_start[f+1]; /* First vithist entry in next frame (f+1) */
if (sv < nsv)
break;
}
if (f < 0)
return -1;
if (f != vh->n_frm-1)
E_ERROR("No word exit in frame %d, using exits from frame %d\n", vh->n_frm-1, f);
/* Terminate in a final </s> node (make this optional?) */
lm = kbcore_lm (kbc);
endwid = lm_finishwid (lm);
bestscore = MAX_NEG_INT32;
bestvh = -1;
for (i = sv; i < nsv; i++) {
b = VITHIST_ID2BLK (i);
l = VITHIST_ID2BLKOFFSET (i);
ve = vh->entry[b] + l;
scr = ve->score;
scr += lm_tg_score (lm, ve->lmstate.lm3g.lwid[1], ve->lmstate.lm3g.lwid[0], endwid);
if (bestscore < scr) {
bestscore = scr;
bestvh = i;
bestve = ve;
}
}
assert (bestvh >= 0);
dict = kbcore_dict (kbc);
if (f != vh->n_frm-1) {
E_ERROR("No word exit in frame %d, using exits from frame %d\n", vh->n_frm-1, f);
/* Add a dummy silwid covering the remainder of the utterance */
assert (vh->frame_start[vh->n_frm-1] == vh->frame_start[vh->n_frm]);
vh->n_frm -= 1;
vithist_rescore (vh, kbc, dict_silwid (dict), vh->n_frm, bestve->score, bestvh, -1);
vh->n_frm += 1;
vh->frame_start[vh->n_frm] = vh->n_entry;
return vithist_utt_end (vh, kbc);
}
/* Create an </s> entry */
vhid = vh->n_entry;
ve = vithist_entry_alloc (vh);
ve->wid = dict_finishwid (dict);
ve->sf = (bestve->ef == BAD_S3FRMID) ? 0 : bestve->ef + 1;
ve->ef = vh->n_frm;
ve->ascr = 0;
ve->lscr = bestscore - bestve->score;
ve->score = bestscore;
ve->pred = bestvh;
ve->type = 0;
ve->valid = 1;
ve->lmstate.lm3g.lwid[0] = endwid;
ve->lmstate.lm3g.lwid[1] = ve->lmstate.lm3g.lwid[0];
return vhid;
}
