<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>PocketSphinx: src/libpocketsphinx/ngram_search_fwdtree.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">PocketSphinx <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('ngram__search__fwdtree_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libpocketsphinx/ngram_search_fwdtree.c</h1> </div>
</div>
<div class="contents">
<a href="ngram__search__fwdtree_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 2008 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037
<a name="l00042"></a>00042 <span class="comment">/* System headers. */</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include <string.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <assert.h></span>
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <span class="comment">/* SphinxBase headers. */</span>
<a name="l00047"></a>00047 <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span>
<a name="l00048"></a>00048 <span class="preprocessor">#include <sphinxbase/listelem_alloc.h></span>
<a name="l00049"></a>00049 <span class="preprocessor">#include <sphinxbase/err.h></span>
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="comment">/* Local headers. */</span>
<a name="l00052"></a>00052 <span class="preprocessor">#include "<a class="code" href="ngram__search__fwdtree_8h.html" title="Lexicon tree based Viterbi search.">ngram_search_fwdtree.h</a>"</span>
<a name="l00053"></a>00053 <span class="preprocessor">#include "<a class="code" href="phone__loop__search_8h.html" title="Fast and rough context-independent phoneme loop search.">phone_loop_search.h</a>"</span>
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="comment">/* Turn this on to dump channels for debugging */</span>
<a name="l00056"></a>00056 <span class="preprocessor">#define __CHAN_DUMP__ 0</span>
<a name="l00057"></a>00057 <span class="preprocessor"></span><span class="preprocessor">#if __CHAN_DUMP__</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define chan_v_eval(chan) hmm_dump_vit_eval(&(chan)->hmm, stderr)</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00060"></a>00060 <span class="preprocessor"></span><span class="preprocessor">#define chan_v_eval(chan) hmm_vit_eval(&(chan)->hmm)</span>
<a name="l00061"></a>00061 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00062"></a>00062 <span class="preprocessor"></span>
<a name="l00063"></a>00063 <span class="comment">/*</span>
<a name="l00064"></a>00064 <span class="comment"> * Allocate that part of the search channel tree structure that is independent of the</span>
<a name="l00065"></a>00065 <span class="comment"> * LM in use.</span>
<a name="l00066"></a>00066 <span class="comment"> */</span>
<a name="l00067"></a>00067 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00068"></a>00068 init_search_tree(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00069"></a>00069 {
<a name="l00070"></a>00070 int32 w, ndiph, i, n_words, n_ci;
<a name="l00071"></a>00071 <a class="code" href="structdict__t.html" title="a structure for a dictionary.">dict_t</a> *dict = ps_search_dict(ngs);
<a name="l00072"></a>00072 bitvec_t *dimap;
<a name="l00073"></a>00073
<a name="l00074"></a>00074 n_words = ps_search_n_words(ngs);
<a name="l00075"></a>00075 ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a> = ckd_calloc(n_words, <span class="keyword">sizeof</span>(*ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>));
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="comment">/* Find #single phone words, and #unique first diphones (#root channels) in dict. */</span>
<a name="l00078"></a>00078 ndiph = 0;
<a name="l00079"></a>00079 ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a> = 0;
<a name="l00080"></a>00080 n_ci = bin_mdef_n_ciphone(ps_search_acmod(ngs)->mdef);
<a name="l00081"></a>00081 <span class="comment">/* Allocate a bitvector with flags for each possible diphone. */</span>
<a name="l00082"></a>00082 dimap = bitvec_alloc(n_ci * n_ci);
<a name="l00083"></a>00083 <span class="keywordflow">for</span> (w = 0; w < n_words; w++) {
<a name="l00084"></a>00084 <span class="keywordflow">if</span> (!dict_real_word(dict, w))
<a name="l00085"></a>00085 <span class="keywordflow">continue</span>;
<a name="l00086"></a>00086 <span class="keywordflow">if</span> (dict_is_single_phone(dict, w))
<a name="l00087"></a>00087 ++ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>;
<a name="l00088"></a>00088 <span class="keywordflow">else</span> {
<a name="l00089"></a>00089 <span class="keywordtype">int</span> ph0, ph1;
<a name="l00090"></a>00090 ph0 = dict_first_phone(dict, w);
<a name="l00091"></a>00091 ph1 = dict_second_phone(dict, w);
<a name="l00092"></a>00092 <span class="comment">/* Increment ndiph the first time we see a diphone. */</span>
<a name="l00093"></a>00093 <span class="keywordflow">if</span> (bitvec_is_clear(dimap, ph0 * n_ci + ph1)) {
<a name="l00094"></a>00094 bitvec_set(dimap, ph0 * n_ci + ph1);
<a name="l00095"></a>00095 ++ndiph;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097 }
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099 E_INFO(<span class="stringliteral">"%d unique initial diphones\n"</span>, ndiph);
<a name="l00100"></a>00100 bitvec_free(dimap);
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="comment">/* Add remaining dict words (</s>, <s>, <sil>, noise words) to single-phone words */</span>
<a name="l00103"></a>00103 ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a> += dict_num_fillers(dict) + 2;
<a name="l00104"></a>00104 ngs-><a class="code" href="structngram__search__s.html#abc8a67e3f64adc470c78dfdd23be4126" title="Number of root_chan allocated.">n_root_chan_alloc</a> = ndiph + 1;
<a name="l00105"></a>00105 <span class="comment">/* Verify that these are all *actually* single-phone words,</span>
<a name="l00106"></a>00106 <span class="comment"> * otherwise really bad things will happen to us. */</span>
<a name="l00107"></a>00107 <span class="keywordflow">for</span> (w = 0; w < n_words; ++w) {
<a name="l00108"></a>00108 <span class="keywordflow">if</span> (dict_real_word(dict, w))
<a name="l00109"></a>00109 <span class="keywordflow">continue</span>;
<a name="l00110"></a>00110 <span class="keywordflow">if</span> (!dict_is_single_phone(dict, w)) {
<a name="l00111"></a>00111 E_WARN(<span class="stringliteral">"Filler word %d = %s has more than one phone, ignoring it.\n"</span>,
<a name="l00112"></a>00112 w, dict_wordstr(dict, w));
<a name="l00113"></a>00113 --ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="comment">/* Allocate and initialize root channels */</span>
<a name="l00118"></a>00118 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a> =
<a name="l00119"></a>00119 ckd_calloc(ngs-><a class="code" href="structngram__search__s.html#abc8a67e3f64adc470c78dfdd23be4126" title="Number of root_chan allocated.">n_root_chan_alloc</a>, <span class="keyword">sizeof</span>(*ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>));
<a name="l00120"></a>00120 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#abc8a67e3f64adc470c78dfdd23be4126" title="Number of root_chan allocated.">n_root_chan_alloc</a>; i++) {
<a name="l00121"></a>00121 hmm_init(ngs-><a class="code" href="structngram__search__s.html#acfbdd34e3dadbaa384818402f1dd59bf" title="HMM context.">hmmctx</a>, &ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, TRUE, -1, -1);
<a name="l00122"></a>00122 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].penult_phn_wid = -1;
<a name="l00123"></a>00123 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a> = NULL;
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="comment">/* Permanently allocate and initialize channels for single-phone</span>
<a name="l00127"></a>00127 <span class="comment"> * words (1/word). */</span>
<a name="l00128"></a>00128 ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a> = ckd_calloc(ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>, <span class="keyword">sizeof</span>(*ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>));
<a name="l00129"></a>00129 i = 0;
<a name="l00130"></a>00130 <span class="keywordflow">for</span> (w = 0; w < n_words; w++) {
<a name="l00131"></a>00131 <span class="keywordflow">if</span> (!dict_is_single_phone(dict, w))
<a name="l00132"></a>00132 <span class="keywordflow">continue</span>;
<a name="l00133"></a>00133 <span class="comment">/* Use SIL as right context for these. */</span>
<a name="l00134"></a>00134 ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#a0c0cf22caf4c97879af86865764f1675" title="second ciphone of this node; one root HMM for each unique right context">ci2phone</a> = bin_mdef_silphone(ps_search_acmod(ngs)->mdef);
<a name="l00135"></a>00135 ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a> = dict_first_phone(dict, w);
<a name="l00136"></a>00136 hmm_init(ngs-><a class="code" href="structngram__search__s.html#acfbdd34e3dadbaa384818402f1dd59bf" title="HMM context.">hmmctx</a>, &ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, TRUE,
<a name="l00137"></a>00137 bin_mdef_pid2ssid(ps_search_acmod(ngs)->mdef, ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>),
<a name="l00138"></a>00138 bin_mdef_pid2tmatid(ps_search_acmod(ngs)->mdef, ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>));
<a name="l00139"></a>00139 ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a> = NULL;
<a name="l00140"></a>00140
<a name="l00141"></a>00141 ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w] = (<a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *) &(ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i]);
<a name="l00142"></a>00142 i++;
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144
<a name="l00145"></a>00145 ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a> = ckd_calloc(ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>,
<a name="l00146"></a>00146 <span class="keyword">sizeof</span>(*ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>));
<a name="l00147"></a>00147 E_INFO(<span class="stringliteral">"%d root, %d non-root channels, %d single-phone words\n"</span>,
<a name="l00148"></a>00148 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>);
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="comment">/*</span>
<a name="l00152"></a>00152 <span class="comment"> * One-time initialization of internal channels in HMM tree.</span>
<a name="l00153"></a>00153 <span class="comment"> */</span>
<a name="l00154"></a>00154 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00155"></a>00155 init_nonroot_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> * hmm, int32 ph, int32 ci, int32 tmatid)
<a name="l00156"></a>00156 {
<a name="l00157"></a>00157 hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a> = NULL;
<a name="l00158"></a>00158 hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a> = NULL;
<a name="l00159"></a>00159 hmm->info.<a class="code" href="structchan__s.html#a136796f6a13c0d6989120f9aa25b85f1" title="list of words whose last phone follows this one; this field indicates the first of the list; the rest...">penult_phn_wid</a> = -1;
<a name="l00160"></a>00160 hmm-><a class="code" href="structchan__s.html#a33da51d8524073abc792519d0738ca0b" title="ciphone for this node">ciphone</a> = ci;
<a name="l00161"></a>00161 hmm_init(ngs-><a class="code" href="structngram__search__s.html#acfbdd34e3dadbaa384818402f1dd59bf" title="HMM context.">hmmctx</a>, &hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>, FALSE, ph, tmatid);
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="comment">/*</span>
<a name="l00165"></a>00165 <span class="comment"> * Allocate and initialize search channel-tree structure.</span>
<a name="l00166"></a>00166 <span class="comment"> * At this point, all the root-channels have been allocated and partly initialized</span>
<a name="l00167"></a>00167 <span class="comment"> * (as per init_search_tree()), and channels for all the single-phone words have been</span>
<a name="l00168"></a>00168 <span class="comment"> * allocated and initialized. None of the interior channels of search-trees have</span>
<a name="l00169"></a>00169 <span class="comment"> * been allocated.</span>
<a name="l00170"></a>00170 <span class="comment"> * This routine may be called on every utterance, after reinit_search_tree() clears</span>
<a name="l00171"></a>00171 <span class="comment"> * the search tree created for the previous utterance. Meant for reconfiguring the</span>
<a name="l00172"></a>00172 <span class="comment"> * search tree to suit the currently active LM.</span>
<a name="l00173"></a>00173 <span class="comment"> */</span>
<a name="l00174"></a>00174 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00175"></a>00175 create_search_tree(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00176"></a>00176 {
<a name="l00177"></a>00177 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm;
<a name="l00178"></a>00178 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00179"></a>00179 int32 w, i, j, p, ph, tmatid;
<a name="l00180"></a>00180 int32 n_words;
<a name="l00181"></a>00181 <a class="code" href="structdict__t.html" title="a structure for a dictionary.">dict_t</a> *dict = ps_search_dict(ngs);
<a name="l00182"></a>00182 <a class="code" href="structdict2pid__t.html" title="Building composite triphone (as well as word internal triphones) with the dictionary.">dict2pid_t</a> *d2p = ps_search_dict2pid(ngs);
<a name="l00183"></a>00183
<a name="l00184"></a>00184 n_words = ps_search_n_words(ngs);
<a name="l00185"></a>00185
<a name="l00186"></a>00186 E_INFO(<span class="stringliteral">"Creating search tree\n"</span>);
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="keywordflow">for</span> (w = 0; w < n_words; w++)
<a name="l00189"></a>00189 ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[w] = -1;
<a name="l00190"></a>00190
<a name="l00191"></a>00191 E_INFO(<span class="stringliteral">"before: %d root, %d non-root channels, %d single-phone words\n"</span>,
<a name="l00192"></a>00192 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>);
<a name="l00193"></a>00193
<a name="l00194"></a>00194 ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a> = 0;
<a name="l00195"></a>00195 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a> = 0;
<a name="l00196"></a>00196 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a> = 0;
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keywordflow">for</span> (w = 0; w < n_words; w++) {
<a name="l00199"></a>00199 <span class="keywordtype">int</span> ciphone, ci2phone;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="comment">/* Ignore dictionary words not in LM */</span>
<a name="l00202"></a>00202 <span class="keywordflow">if</span> (!ngram_model_set_known_wid(ngs-><a class="code" href="structngram__search__s.html#a6127a6d8fb53832e67456c11aa6ad9c4" title="Set of language models.">lmset</a>, dict_basewid(dict, w)))
<a name="l00203"></a>00203 <span class="keywordflow">continue</span>;
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <span class="comment">/* Handle single-phone words individually; not in channel tree */</span>
<a name="l00206"></a>00206 <span class="keywordflow">if</span> (dict_is_single_phone(dict, w)) {
<a name="l00207"></a>00207 E_DEBUG(1,(<span class="stringliteral">"single_phone_wid[%d] = %s\n"</span>,
<a name="l00208"></a>00208 ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>, dict_wordstr(dict, w)));
<a name="l00209"></a>00209 ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>++] = w;
<a name="l00210"></a>00210 <span class="keywordflow">continue</span>;
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <span class="comment">/* Find a root channel matching the initial diphone, or</span>
<a name="l00214"></a>00214 <span class="comment"> * allocate one if not found. */</span>
<a name="l00215"></a>00215 ciphone = dict_first_phone(dict, w);
<a name="l00216"></a>00216 ci2phone = dict_second_phone(dict, w);
<a name="l00217"></a>00217 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>; ++i) {
<a name="l00218"></a>00218 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a> == ciphone
<a name="l00219"></a>00219 && ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#a0c0cf22caf4c97879af86865764f1675" title="second ciphone of this node; one root HMM for each unique right context">ci2phone</a> == ci2phone)
<a name="l00220"></a>00220 <span class="keywordflow">break</span>;
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 <span class="keywordflow">if</span> (i == ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>) {
<a name="l00223"></a>00223 rhmm = &(ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>]);
<a name="l00224"></a>00224 rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>.tmatid = bin_mdef_pid2tmatid(ps_search_acmod(ngs)->mdef, ciphone);
<a name="l00225"></a>00225 <span class="comment">/* Begin with CI phone? Not sure this makes a difference... */</span>
<a name="l00226"></a>00226 hmm_mpx_ssid(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0) =
<a name="l00227"></a>00227 bin_mdef_pid2ssid(ps_search_acmod(ngs)->mdef, ciphone);
<a name="l00228"></a>00228 rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a> = ciphone;
<a name="l00229"></a>00229 rhmm-><a class="code" href="structroot__chan__s.html#a0c0cf22caf4c97879af86865764f1675" title="second ciphone of this node; one root HMM for each unique right context">ci2phone</a> = ci2phone;
<a name="l00230"></a>00230 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>++;
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232 <span class="keywordflow">else</span>
<a name="l00233"></a>00233 rhmm = &(ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i]);
<a name="l00234"></a>00234
<a name="l00235"></a>00235 E_DEBUG(3,(<span class="stringliteral">"word %s rhmm %d\n"</span>, dict_wordstr(dict, w), rhmm - ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>));
<a name="l00236"></a>00236 <span class="comment">/* Now, rhmm = root channel for w. Go on to remaining phones */</span>
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (dict_pronlen(dict, w) == 2) {
<a name="l00238"></a>00238 <span class="comment">/* Next phone is the last; not kept in tree; add w to penult_phn_wid set */</span>
<a name="l00239"></a>00239 <span class="keywordflow">if</span> ((j = rhmm->penult_phn_wid) < 0)
<a name="l00240"></a>00240 rhmm->penult_phn_wid = w;
<a name="l00241"></a>00241 <span class="keywordflow">else</span> {
<a name="l00242"></a>00242 <span class="keywordflow">for</span> (; ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j] >= 0; j = ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j]);
<a name="l00243"></a>00243 ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j] = w;
<a name="l00244"></a>00244 }
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246 <span class="keywordflow">else</span> {
<a name="l00247"></a>00247 <span class="comment">/* Add remaining phones, except the last, to tree */</span>
<a name="l00248"></a>00248 ph = <a class="code" href="dict2pid_8c.html#a720e15c92ef6930e722bccb014e11b7b" title="Return the senone sequence ID for the given word position.">dict2pid_internal</a>(d2p, w, 1);
<a name="l00249"></a>00249 tmatid = bin_mdef_pid2tmatid(ps_search_acmod(ngs)->mdef, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, 1));
<a name="l00250"></a>00250 hmm = rhmm-><a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a>;
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (hmm == NULL) {
<a name="l00252"></a>00252 rhmm-><a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a> = hmm = listelem_malloc(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>);
<a name="l00253"></a>00253 init_nonroot_chan(ngs, hmm, ph, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, 1), tmatid);
<a name="l00254"></a>00254 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>++;
<a name="l00255"></a>00255 }
<a name="l00256"></a>00256 <span class="keywordflow">else</span> {
<a name="l00257"></a>00257 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *prev_hmm = NULL;
<a name="l00258"></a>00258
<a name="l00259"></a>00259 <span class="keywordflow">for</span> (; hmm && (hmm_nonmpx_ssid(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) != ph); hmm = hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a>)
<a name="l00260"></a>00260 prev_hmm = hmm;
<a name="l00261"></a>00261 <span class="keywordflow">if</span> (!hmm) { <span class="comment">/* thanks, rkm! */</span>
<a name="l00262"></a>00262 prev_hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a> = hmm = listelem_malloc(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>);
<a name="l00263"></a>00263 init_nonroot_chan(ngs, hmm, ph, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, 1), tmatid);
<a name="l00264"></a>00264 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>++;
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267 E_DEBUG(3,(<span class="stringliteral">"phone %s = %d\n"</span>,
<a name="l00268"></a>00268 bin_mdef_ciphone_str(ps_search_acmod(ngs)->mdef,
<a name="l00269"></a>00269 dict_second_phone(dict, w)), ph));
<a name="l00270"></a>00270 <span class="keywordflow">for</span> (p = 2; p < dict_pronlen(dict, w) - 1; p++) {
<a name="l00271"></a>00271 ph = <a class="code" href="dict2pid_8c.html#a720e15c92ef6930e722bccb014e11b7b" title="Return the senone sequence ID for the given word position.">dict2pid_internal</a>(d2p, w, p);
<a name="l00272"></a>00272 tmatid = bin_mdef_pid2tmatid(ps_search_acmod(ngs)->mdef, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, p));
<a name="l00273"></a>00273 <span class="keywordflow">if</span> (!hmm->next) {
<a name="l00274"></a>00274 hmm->next = listelem_malloc(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>);
<a name="l00275"></a>00275 hmm = hmm->next;
<a name="l00276"></a>00276 init_nonroot_chan(ngs, hmm, ph, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, p), tmatid);
<a name="l00277"></a>00277 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>++;
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279 <span class="keywordflow">else</span> {
<a name="l00280"></a>00280 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *prev_hmm = NULL;
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <span class="keywordflow">for</span> (hmm = hmm->next; hmm && (hmm_nonmpx_ssid(&hmm->hmm) != ph);
<a name="l00283"></a>00283 hmm = hmm->alt)
<a name="l00284"></a>00284 prev_hmm = hmm;
<a name="l00285"></a>00285 <span class="keywordflow">if</span> (!hmm) { <span class="comment">/* thanks, rkm! */</span>
<a name="l00286"></a>00286 prev_hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a> = hmm = listelem_malloc(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>);
<a name="l00287"></a>00287 init_nonroot_chan(ngs, hmm, ph, <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, p), tmatid);
<a name="l00288"></a>00288 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>++;
<a name="l00289"></a>00289 }
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291 E_DEBUG(3,(<span class="stringliteral">"phone %s = %d\n"</span>,
<a name="l00292"></a>00292 bin_mdef_ciphone_str(ps_search_acmod(ngs)->mdef,
<a name="l00293"></a>00293 <a class="code" href="dict_8h.html#a8785ab6264a5c6cf0b8da6bf79a46de4" title="The CI phones of the word w at position p.">dict_pron</a>(dict, w, p)), ph));
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295
<a name="l00296"></a>00296 <span class="comment">/* All but last phone of w in tree; add w to hmm->info.penult_phn_wid set */</span>
<a name="l00297"></a>00297 <span class="keywordflow">if</span> ((j = hmm->info.penult_phn_wid) < 0)
<a name="l00298"></a>00298 hmm->info.penult_phn_wid = w;
<a name="l00299"></a>00299 <span class="keywordflow">else</span> {
<a name="l00300"></a>00300 <span class="keywordflow">for</span> (; ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j] >= 0; j = ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j]);
<a name="l00301"></a>00301 ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[j] = w;
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a> = ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>;
<a name="l00307"></a>00307
<a name="l00308"></a>00308 <span class="comment">/* Add filler words to the array of 1ph words. */</span>
<a name="l00309"></a>00309 <span class="keywordflow">for</span> (w = 0; w < n_words; ++w) {
<a name="l00310"></a>00310 <span class="comment">/* Skip anything that doesn't actually have a single phone. */</span>
<a name="l00311"></a>00311 <span class="keywordflow">if</span> (!dict_is_single_phone(dict, w))
<a name="l00312"></a>00312 <span class="keywordflow">continue</span>;
<a name="l00313"></a>00313 <span class="comment">/* Also skip "real words" and things that are in the LM. */</span>
<a name="l00314"></a>00314 <span class="keywordflow">if</span> (dict_real_word(dict, w))
<a name="l00315"></a>00315 <span class="keywordflow">continue</span>;
<a name="l00316"></a>00316 <span class="keywordflow">if</span> (ngram_model_set_known_wid(ngs-><a class="code" href="structngram__search__s.html#a6127a6d8fb53832e67456c11aa6ad9c4" title="Set of language models.">lmset</a>, dict_basewid(dict, w)))
<a name="l00317"></a>00317 <span class="keywordflow">continue</span>;
<a name="l00318"></a>00318 E_DEBUG(1,(<span class="stringliteral">"single_phone_wid[%d] = %s\n"</span>,
<a name="l00319"></a>00319 ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>, dict_wordstr(dict, w)));
<a name="l00320"></a>00320 ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>++] = w;
<a name="l00321"></a>00321 }
<a name="l00322"></a>00322
<a name="l00323"></a>00323 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a> >= ngs-><a class="code" href="structngram__search__s.html#a4b2b42349e9e3df7e93b4a7d6994f63f" title="Maximum possible number of non-root channels.">max_nonroot_chan</a>) {
<a name="l00324"></a>00324 <span class="comment">/* Give some room for channels for new words added dynamically at run time */</span>
<a name="l00325"></a>00325 ngs-><a class="code" href="structngram__search__s.html#a4b2b42349e9e3df7e93b4a7d6994f63f" title="Maximum possible number of non-root channels.">max_nonroot_chan</a> = ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a> + 128;
<a name="l00326"></a>00326 E_INFO(<span class="stringliteral">"after: max nonroot chan increased to %d\n"</span>, ngs-><a class="code" href="structngram__search__s.html#a4b2b42349e9e3df7e93b4a7d6994f63f" title="Maximum possible number of non-root channels.">max_nonroot_chan</a>);
<a name="l00327"></a>00327
<a name="l00328"></a>00328 <span class="comment">/* Free old active channel list array if any and allocate new one */</span>
<a name="l00329"></a>00329 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>)
<a name="l00330"></a>00330 ckd_free_2d(ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>);
<a name="l00331"></a>00331 ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a> = ckd_calloc_2d(2, ngs-><a class="code" href="structngram__search__s.html#a4b2b42349e9e3df7e93b4a7d6994f63f" title="Maximum possible number of non-root channels.">max_nonroot_chan</a>,
<a name="l00332"></a>00332 <span class="keyword">sizeof</span>(**ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>));
<a name="l00333"></a>00333 }
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <span class="keywordflow">if</span> (!ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>)
<a name="l00336"></a>00336 E_ERROR(<span class="stringliteral">"No word from the language model has pronunciation in the dictionary\n"</span>);
<a name="l00337"></a>00337
<a name="l00338"></a>00338 E_INFO(<span class="stringliteral">"after: %d root, %d non-root channels, %d single-phone words\n"</span>,
<a name="l00339"></a>00339 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a>, ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>);
<a name="l00340"></a>00340 }
<a name="l00341"></a>00341
<a name="l00342"></a>00342 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00343"></a>00343 reinit_search_subtree(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> * hmm)
<a name="l00344"></a>00344 {
<a name="l00345"></a>00345 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *child, *sibling;
<a name="l00346"></a>00346
<a name="l00347"></a>00347 <span class="comment">/* First free all children under hmm */</span>
<a name="l00348"></a>00348 <span class="keywordflow">for</span> (child = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>; child; child = sibling) {
<a name="l00349"></a>00349 sibling = child-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a>;
<a name="l00350"></a>00350 reinit_search_subtree(ngs, child);
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="comment">/* Now free hmm */</span>
<a name="l00354"></a>00354 hmm_deinit(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>);
<a name="l00355"></a>00355 listelem_free(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>, hmm);
<a name="l00356"></a>00356 }
<a name="l00357"></a>00357
<a name="l00358"></a>00358 <span class="comment">/*</span>
<a name="l00359"></a>00359 <span class="comment"> * Delete search tree by freeing all interior channels within search tree and</span>
<a name="l00360"></a>00360 <span class="comment"> * restoring root channel state to the init state (i.e., just after init_search_tree()).</span>
<a name="l00361"></a>00361 <span class="comment"> */</span>
<a name="l00362"></a>00362 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00363"></a>00363 reinit_search_tree(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00364"></a>00364 {
<a name="l00365"></a>00365 int32 i;
<a name="l00366"></a>00366 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, *sibling;
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>; i++) {
<a name="l00369"></a>00369 hmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a>;
<a name="l00370"></a>00370
<a name="l00371"></a>00371 <span class="keywordflow">while</span> (hmm) {
<a name="l00372"></a>00372 sibling = hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a>;
<a name="l00373"></a>00373 reinit_search_subtree(ngs, hmm);
<a name="l00374"></a>00374 hmm = sibling;
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376
<a name="l00377"></a>00377 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].penult_phn_wid = -1;
<a name="l00378"></a>00378 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a> = NULL;
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380 ngs-><a class="code" href="structngram__search__s.html#a043723786367f5026dce99c261f7086d" title="Number of valid non-root channels.">n_nonroot_chan</a> = 0;
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="keywordtype">void</span>
<a name="l00384"></a><a class="code" href="ngram__search__fwdtree_8h.html#a72c89a2a1f189495abee00e1853cddcc">00384</a> <a class="code" href="ngram__search__fwdtree_8c.html#a72c89a2a1f189495abee00e1853cddcc" title="Initialize N-Gram search for fwdtree decoding.">ngram_fwdtree_init</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00385"></a>00385 {
<a name="l00386"></a>00386 <span class="comment">/* Allocate bestbp_rc, lastphn_cand, last_ltrans */</span>
<a name="l00387"></a>00387 ngs->bestbp_rc = ckd_calloc(bin_mdef_n_ciphone(ps_search_acmod(ngs)->mdef),
<a name="l00388"></a>00388 <span class="keyword">sizeof</span>(*ngs->bestbp_rc));
<a name="l00389"></a>00389 ngs->lastphn_cand = ckd_calloc(ps_search_n_words(ngs),
<a name="l00390"></a>00390 <span class="keyword">sizeof</span>(*ngs->lastphn_cand));
<a name="l00391"></a>00391 init_search_tree(ngs);
<a name="l00392"></a>00392 create_search_tree(ngs);
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00396"></a>00396 deinit_search_tree(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00397"></a>00397 {
<a name="l00398"></a>00398 <span class="keywordtype">int</span> i, w, n_words;
<a name="l00399"></a>00399
<a name="l00400"></a>00400 n_words = ps_search_n_words(ngs);
<a name="l00401"></a>00401 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#abc8a67e3f64adc470c78dfdd23be4126" title="Number of root_chan allocated.">n_root_chan_alloc</a>; i++) {
<a name="l00402"></a>00402 hmm_deinit(&ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>[i].<a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>) {
<a name="l00405"></a>00405 <span class="keywordflow">for</span> (i = w = 0; w < n_words; ++w) {
<a name="l00406"></a>00406 <span class="keywordflow">if</span> (!dict_is_single_phone(ps_search_dict(ngs), w))
<a name="l00407"></a>00407 <span class="keywordflow">continue</span>;
<a name="l00408"></a>00408 hmm_deinit(&ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>[i].<a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00409"></a>00409 ++i;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411 ckd_free(ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a>);
<a name="l00412"></a>00412 ngs-><a class="code" href="structngram__search__s.html#a1ffa3c9100252122ae8a2a713c50b527" title="Root HMMs for single-phone words.">rhmm_1ph</a> = NULL;
<a name="l00413"></a>00413 }
<a name="l00414"></a>00414 ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a> = 0;
<a name="l00415"></a>00415 ngs-><a class="code" href="structngram__search__s.html#abc8a67e3f64adc470c78dfdd23be4126" title="Number of root_chan allocated.">n_root_chan_alloc</a> = 0;
<a name="l00416"></a>00416 ckd_free(ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>);
<a name="l00417"></a>00417 ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a> = NULL;
<a name="l00418"></a>00418 ckd_free(ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>);
<a name="l00419"></a>00419 ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a> = NULL;
<a name="l00420"></a>00420 ckd_free(ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>);
<a name="l00421"></a>00421 ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a> = NULL;
<a name="l00422"></a>00422 }
<a name="l00423"></a>00423
<a name="l00424"></a>00424 <span class="keywordtype">void</span>
<a name="l00425"></a><a class="code" href="ngram__search__fwdtree_8h.html#a0e0e0436b30e1074114e1d37991c5d6b">00425</a> <a class="code" href="ngram__search__fwdtree_8c.html#a0e0e0436b30e1074114e1d37991c5d6b" title="Release memory associated with fwdtree decoding.">ngram_fwdtree_deinit</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00426"></a>00426 {
<a name="l00427"></a>00427 <span class="keywordtype">double</span> n_speech = (double)ngs->n_tot_frame
<a name="l00428"></a>00428 / cmd_ln_int32_r(ps_search_config(ngs), <span class="stringliteral">"-frate"</span>);
<a name="l00429"></a>00429
<a name="l00430"></a>00430 E_INFO(<span class="stringliteral">"TOTAL fwdtree %.2f CPU %.3f xRT\n"</span>,
<a name="l00431"></a>00431 ngs->fwdtree_perf.t_tot_cpu,
<a name="l00432"></a>00432 ngs->fwdtree_perf.t_tot_cpu / n_speech);
<a name="l00433"></a>00433 E_INFO(<span class="stringliteral">"TOTAL fwdtree %.2f wall %.3f xRT\n"</span>,
<a name="l00434"></a>00434 ngs->fwdtree_perf.t_tot_elapsed,
<a name="l00435"></a>00435 ngs->fwdtree_perf.t_tot_elapsed / n_speech);
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="comment">/* Reset non-root channels. */</span>
<a name="l00438"></a>00438 reinit_search_tree(ngs);
<a name="l00439"></a>00439 <span class="comment">/* Free the search tree. */</span>
<a name="l00440"></a>00440 deinit_search_tree(ngs);
<a name="l00441"></a>00441 <span class="comment">/* Free other stuff. */</span>
<a name="l00442"></a>00442 ngs-><a class="code" href="structngram__search__s.html#a4b2b42349e9e3df7e93b4a7d6994f63f" title="Maximum possible number of non-root channels.">max_nonroot_chan</a> = 0;
<a name="l00443"></a>00443 ckd_free_2d(ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>);
<a name="l00444"></a>00444 ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a> = NULL;
<a name="l00445"></a>00445 ckd_free(ngs->cand_sf);
<a name="l00446"></a>00446 ngs->cand_sf = NULL;
<a name="l00447"></a>00447 ckd_free(ngs->bestbp_rc);
<a name="l00448"></a>00448 ngs->bestbp_rc = NULL;
<a name="l00449"></a>00449 ckd_free(ngs->lastphn_cand);
<a name="l00450"></a>00450 ngs->lastphn_cand = NULL;
<a name="l00451"></a>00451 }
<a name="l00452"></a>00452
<a name="l00453"></a>00453 <span class="keywordtype">int</span>
<a name="l00454"></a><a class="code" href="ngram__search__fwdtree_8h.html#aa53827b47025d4e7a63f3ddce763d84e">00454</a> <a class="code" href="ngram__search__fwdtree_8c.html#aa53827b47025d4e7a63f3ddce763d84e" title="Rebuild search structures for updated language models.">ngram_fwdtree_reinit</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00455"></a>00455 {
<a name="l00456"></a>00456 <span class="comment">/* Reset non-root channels. */</span>
<a name="l00457"></a>00457 reinit_search_tree(ngs);
<a name="l00458"></a>00458 <span class="comment">/* Free the search tree. */</span>
<a name="l00459"></a>00459 deinit_search_tree(ngs);
<a name="l00460"></a>00460 <span class="comment">/* Reallocate things that depend on the number of words. */</span>
<a name="l00461"></a>00461 ckd_free(ngs->lastphn_cand);
<a name="l00462"></a>00462 ngs->lastphn_cand = ckd_calloc(ps_search_n_words(ngs),
<a name="l00463"></a>00463 <span class="keyword">sizeof</span>(*ngs->lastphn_cand));
<a name="l00464"></a>00464 ckd_free(ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>);
<a name="l00465"></a>00465 ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a> = ckd_calloc(ps_search_n_words(ngs),
<a name="l00466"></a>00466 <span class="keyword">sizeof</span>(*ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>));
<a name="l00467"></a>00467 <span class="comment">/* Rebuild the search tree. */</span>
<a name="l00468"></a>00468 init_search_tree(ngs);
<a name="l00469"></a>00469 create_search_tree(ngs);
<a name="l00470"></a>00470 <span class="keywordflow">return</span> 0;
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472
<a name="l00473"></a>00473 <span class="keywordtype">void</span>
<a name="l00474"></a><a class="code" href="ngram__search__fwdtree_8h.html#af736200cd01a5d743dbab447ecc85d08">00474</a> <a class="code" href="ngram__search__fwdtree_8c.html#af736200cd01a5d743dbab447ecc85d08" title="Start fwdtree decoding for an utterance.">ngram_fwdtree_start</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l00475"></a>00475 {
<a name="l00476"></a>00476 <a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *base = (<a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *)ngs;
<a name="l00477"></a>00477 int32 i, w, n_words;
<a name="l00478"></a>00478 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00479"></a>00479
<a name="l00480"></a>00480 n_words = ps_search_n_words(ngs);
<a name="l00481"></a>00481
<a name="l00482"></a>00482 <span class="comment">/* Reset utterance statistics. */</span>
<a name="l00483"></a>00483 memset(&ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>, 0, <span class="keyword">sizeof</span>(ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>));
<a name="l00484"></a>00484 ptmr_reset(&ngs->fwdtree_perf);
<a name="l00485"></a>00485 ptmr_start(&ngs->fwdtree_perf);
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="comment">/* Reset backpointer table. */</span>
<a name="l00488"></a>00488 ngs->bpidx = 0;
<a name="l00489"></a>00489 ngs->bss_head = 0;
<a name="l00490"></a>00490
<a name="l00491"></a>00491 <span class="comment">/* Reset word lattice. */</span>
<a name="l00492"></a>00492 <span class="keywordflow">for</span> (i = 0; i < n_words; ++i)
<a name="l00493"></a>00493 ngs->word_lat_idx[i] = NO_BP;
<a name="l00494"></a>00494
<a name="l00495"></a>00495 <span class="comment">/* Reset active HMM and word lists. */</span>
<a name="l00496"></a>00496 ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[0] = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[1] = 0;
<a name="l00497"></a>00497 ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[0] = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[1] = 0;
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="comment">/* Reset scores. */</span>
<a name="l00500"></a>00500 ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> = 0;
<a name="l00501"></a>00501 ngs->renormalized = 0;
<a name="l00502"></a>00502
<a name="l00503"></a>00503 <span class="comment">/* Reset other stuff. */</span>
<a name="l00504"></a>00504 for (i = 0; i < n_words; i++)
<a name="l00505"></a>00505 ngs->last_ltrans[i].sf = -1;
<a name="l00506"></a>00506 ngs-><a class="code" href="structngram__search__s.html#a5255e56d28c239a4e1d9b1721e8a2f8d" title="Number of frames actually present.">n_frame</a> = 0;
<a name="l00507"></a>00507
<a name="l00508"></a>00508 <span class="comment">/* Clear the hypothesis string. */</span>
<a name="l00509"></a>00509 ckd_free(base-><a class="code" href="structps__search__s.html#aa398c736a887af97e42b2a562359adc3" title="Current hypothesis string.">hyp_str</a>);
<a name="l00510"></a>00510 base-><a class="code" href="structps__search__s.html#aa398c736a887af97e42b2a562359adc3" title="Current hypothesis string.">hyp_str</a> = NULL;
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="comment">/* Reset the permanently allocated single-phone words, since they</span>
<a name="l00513"></a>00513 <span class="comment"> * may have junk left over in them from FWDFLAT. */</span>
<a name="l00514"></a>00514 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l00515"></a>00515 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l00516"></a>00516 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l00517"></a>00517 hmm_clear(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00518"></a>00518 }
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="comment">/* Start search with <s>; word_chan[<s>] is permanently allocated */</span>
<a name="l00521"></a>00521 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[dict_startwid(ps_search_dict(ngs))];
<a name="l00522"></a>00522 hmm_clear(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00523"></a>00523 hmm_enter(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0, NO_BP, 0);
<a name="l00524"></a>00524 }
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="comment">/*</span>
<a name="l00527"></a>00527 <span class="comment"> * Mark the active senones for all senones belonging to channels that are active in the</span>
<a name="l00528"></a>00528 <span class="comment"> * current frame.</span>
<a name="l00529"></a>00529 <span class="comment"> */</span>
<a name="l00530"></a>00530 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00531"></a>00531 compute_sen_active(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00532"></a>00532 {
<a name="l00533"></a>00533 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00534"></a>00534 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, **acl;
<a name="l00535"></a>00535 int32 i, w, *awl;
<a name="l00536"></a>00536
<a name="l00537"></a>00537 <a class="code" href="acmod_8c.html#aed43f033f434e34fd90c975909d81cb2" title="Clear set of active senones.">acmod_clear_active</a>(ps_search_acmod(ngs));
<a name="l00538"></a>00538
<a name="l00539"></a>00539 <span class="comment">/* Flag active senones for root channels */</span>
<a name="l00540"></a>00540 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l00541"></a>00541 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx)
<a name="l00542"></a>00542 <a class="code" href="acmod_8c.html#a2a7f67d462279b2bc4774c7967ae61c7" title="Activate senones associated with an HMM.">acmod_activate_hmm</a>(ps_search_acmod(ngs), &rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00543"></a>00543 }
<a name="l00544"></a>00544
<a name="l00545"></a>00545 <span class="comment">/* Flag active senones for nonroot channels in HMM tree */</span>
<a name="l00546"></a>00546 i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[frame_idx & 0x1];
<a name="l00547"></a>00547 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[frame_idx & 0x1];
<a name="l00548"></a>00548 <span class="keywordflow">for</span> (hmm = *(acl++); i > 0; --i, hmm = *(acl++)) {
<a name="l00549"></a>00549 <a class="code" href="acmod_8c.html#a2a7f67d462279b2bc4774c7967ae61c7" title="Activate senones associated with an HMM.">acmod_activate_hmm</a>(ps_search_acmod(ngs), &hmm->hmm);
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551
<a name="l00552"></a>00552 <span class="comment">/* Flag active senones for individual word channels */</span>
<a name="l00553"></a>00553 i = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[frame_idx & 0x1];
<a name="l00554"></a>00554 awl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[frame_idx & 0x1];
<a name="l00555"></a>00555 <span class="keywordflow">for</span> (w = *(awl++); i > 0; --i, w = *(awl++)) {
<a name="l00556"></a>00556 <span class="keywordflow">for</span> (hmm = ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]; hmm; hmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>) {
<a name="l00557"></a>00557 <a class="code" href="acmod_8c.html#a2a7f67d462279b2bc4774c7967ae61c7" title="Activate senones associated with an HMM.">acmod_activate_hmm</a>(ps_search_acmod(ngs), &hmm->hmm);
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559 }
<a name="l00560"></a>00560 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l00561"></a>00561 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l00562"></a>00562 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l00563"></a>00563
<a name="l00564"></a>00564 if (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx)
<a name="l00565"></a>00565 <a class="code" href="acmod_8c.html#a2a7f67d462279b2bc4774c7967ae61c7" title="Activate senones associated with an HMM.">acmod_activate_hmm</a>(ps_search_acmod(ngs), &rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00566"></a>00566 }
<a name="l00567"></a>00567 }
<a name="l00568"></a>00568
<a name="l00569"></a>00569 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00570"></a>00570 renormalize_scores(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx, int32 norm)
<a name="l00571"></a>00571 {
<a name="l00572"></a>00572 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00573"></a>00573 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, **acl;
<a name="l00574"></a>00574 int32 i, w, *awl;
<a name="l00575"></a>00575
<a name="l00576"></a>00576 <span class="comment">/* Renormalize root channels */</span>
<a name="l00577"></a>00577 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l00578"></a>00578 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx) {
<a name="l00579"></a>00579 hmm_normalize(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, norm);
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581 }
<a name="l00582"></a>00582
<a name="l00583"></a>00583 <span class="comment">/* Renormalize nonroot channels in HMM tree */</span>
<a name="l00584"></a>00584 i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[frame_idx & 0x1];
<a name="l00585"></a>00585 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[frame_idx & 0x1];
<a name="l00586"></a>00586 <span class="keywordflow">for</span> (hmm = *(acl++); i > 0; --i, hmm = *(acl++)) {
<a name="l00587"></a>00587 hmm_normalize(&hmm->hmm, norm);
<a name="l00588"></a>00588 }
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="comment">/* Renormalize individual word channels */</span>
<a name="l00591"></a>00591 i = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[frame_idx & 0x1];
<a name="l00592"></a>00592 awl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[frame_idx & 0x1];
<a name="l00593"></a>00593 <span class="keywordflow">for</span> (w = *(awl++); i > 0; --i, w = *(awl++)) {
<a name="l00594"></a>00594 <span class="keywordflow">for</span> (hmm = ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]; hmm; hmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>) {
<a name="l00595"></a>00595 hmm_normalize(&hmm->hmm, norm);
<a name="l00596"></a>00596 }
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l00599"></a>00599 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l00600"></a>00600 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l00601"></a>00601 if (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx) {
<a name="l00602"></a>00602 hmm_normalize(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, norm);
<a name="l00603"></a>00603 }
<a name="l00604"></a>00604 }
<a name="l00605"></a>00605
<a name="l00606"></a>00606 ngs->renormalized = TRUE;
<a name="l00607"></a>00607 }
<a name="l00608"></a>00608
<a name="l00609"></a>00609 <span class="keyword">static</span> int32
<a name="l00610"></a>00610 eval_root_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00611"></a>00611 {
<a name="l00612"></a>00612 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00613"></a>00613 int32 i, bestscore;
<a name="l00614"></a>00614
<a name="l00615"></a>00615 bestscore = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l00616"></a>00616 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l00617"></a>00617 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx) {
<a name="l00618"></a>00618 int32 score = chan_v_eval(rhmm);
<a name="l00619"></a>00619 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestscore)
<a name="l00620"></a>00620 bestscore = score;
<a name="l00621"></a>00621 ++ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_root_chan_eval;
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624 <span class="keywordflow">return</span> (bestscore);
<a name="l00625"></a>00625 }
<a name="l00626"></a>00626
<a name="l00627"></a>00627 <span class="keyword">static</span> int32
<a name="l00628"></a>00628 eval_nonroot_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00629"></a>00629 {
<a name="l00630"></a>00630 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, **acl;
<a name="l00631"></a>00631 int32 i, bestscore;
<a name="l00632"></a>00632
<a name="l00633"></a>00633 i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[frame_idx & 0x1];
<a name="l00634"></a>00634 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[frame_idx & 0x1];
<a name="l00635"></a>00635 bestscore = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l00636"></a>00636 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_nonroot_chan_eval += i;
<a name="l00637"></a>00637
<a name="l00638"></a>00638 <span class="keywordflow">for</span> (hmm = *(acl++); i > 0; --i, hmm = *(acl++)) {
<a name="l00639"></a>00639 int32 score = chan_v_eval(hmm);
<a name="l00640"></a>00640 assert(hmm_frame(&hmm->hmm) == frame_idx);
<a name="l00641"></a>00641 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestscore)
<a name="l00642"></a>00642 bestscore = score;
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644
<a name="l00645"></a>00645 <span class="keywordflow">return</span> bestscore;
<a name="l00646"></a>00646 }
<a name="l00647"></a>00647
<a name="l00648"></a>00648 <span class="keyword">static</span> int32
<a name="l00649"></a>00649 eval_word_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00650"></a>00650 {
<a name="l00651"></a>00651 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00652"></a>00652 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm;
<a name="l00653"></a>00653 int32 i, w, bestscore, *awl, j, k;
<a name="l00654"></a>00654
<a name="l00655"></a>00655 k = 0;
<a name="l00656"></a>00656 bestscore = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l00657"></a>00657 awl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[frame_idx & 0x1];
<a name="l00658"></a>00658
<a name="l00659"></a>00659 i = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[frame_idx & 0x1];
<a name="l00660"></a>00660 <span class="keywordflow">for</span> (w = *(awl++); i > 0; --i, w = *(awl++)) {
<a name="l00661"></a>00661 assert(bitvec_is_set(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w));
<a name="l00662"></a>00662 bitvec_clear(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w);
<a name="l00663"></a>00663 assert(ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w] != NULL);
<a name="l00664"></a>00664
<a name="l00665"></a>00665 <span class="keywordflow">for</span> (hmm = ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]; hmm; hmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>) {
<a name="l00666"></a>00666 int32 score;
<a name="l00667"></a>00667
<a name="l00668"></a>00668 assert(hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) == frame_idx);
<a name="l00669"></a>00669 score = chan_v_eval(hmm);
<a name="l00670"></a>00670 <span class="comment">/*printf("eval word chan %d score %d\n", w, score); */</span>
<a name="l00671"></a>00671
<a name="l00672"></a>00672 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestscore)
<a name="l00673"></a>00673 bestscore = score;
<a name="l00674"></a>00674
<a name="l00675"></a>00675 k++;
<a name="l00676"></a>00676 }
<a name="l00677"></a>00677 }
<a name="l00678"></a>00678
<a name="l00679"></a>00679 <span class="comment">/* Similarly for statically allocated single-phone words */</span>
<a name="l00680"></a>00680 j = 0;
<a name="l00681"></a>00681 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l00682"></a>00682 int32 score;
<a name="l00683"></a>00683
<a name="l00684"></a>00684 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l00685"></a>00685 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l00686"></a>00686 if (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l00687"></a>00687 <span class="keywordflow">continue</span>;
<a name="l00688"></a>00688
<a name="l00689"></a>00689 score = chan_v_eval(rhmm);
<a name="l00690"></a>00690 <span class="comment">/* printf("eval 1ph word chan %d score %d\n", w, score); */</span>
<a name="l00691"></a>00691 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestscore && w != ps_search_finish_wid(ngs))
<a name="l00692"></a>00692 bestscore = score;
<a name="l00693"></a>00693
<a name="l00694"></a>00694 j++;
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696
<a name="l00697"></a>00697 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_last_chan_eval += k + j;
<a name="l00698"></a>00698 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_nonroot_chan_eval += k + j;
<a name="l00699"></a>00699 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_word_lastchan_eval +=
<a name="l00700"></a>00700 ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[frame_idx & 0x1] + j;
<a name="l00701"></a>00701
<a name="l00702"></a>00702 <span class="keywordflow">return</span> bestscore;
<a name="l00703"></a>00703 }
<a name="l00704"></a>00704
<a name="l00705"></a>00705 <span class="keyword">static</span> int32
<a name="l00706"></a>00706 evaluate_channels(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, int16 <span class="keyword">const</span> *senone_scores, <span class="keywordtype">int</span> frame_idx)
<a name="l00707"></a>00707 {
<a name="l00708"></a>00708 int32 bs;
<a name="l00709"></a>00709
<a name="l00710"></a>00710 <a class="code" href="hmm_8h.html#a44d0b5515cb269bf9b95f62aada18cbb" title="Change the senone score array for a context.">hmm_context_set_senscore</a>(ngs-><a class="code" href="structngram__search__s.html#acfbdd34e3dadbaa384818402f1dd59bf" title="HMM context.">hmmctx</a>, senone_scores);
<a name="l00711"></a>00711 ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> = eval_root_chan(ngs, frame_idx);
<a name="l00712"></a>00712 <span class="keywordflow">if</span> ((bs = eval_nonroot_chan(ngs, frame_idx)) <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a>)
<a name="l00713"></a>00713 ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> = bs;
<a name="l00714"></a>00714 <span class="keywordflow">if</span> ((bs = eval_word_chan(ngs, frame_idx)) BETTER_THAN ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a>)
<a name="l00715"></a>00715 ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> = bs;
<a name="l00716"></a>00716 ngs-><a class="code" href="structngram__search__s.html#a81ee45f3c184568e2b5f8b79c58e0b9e" title="Best Viterbi path score for last phone.">last_phone_best_score</a> = bs;
<a name="l00717"></a>00717
<a name="l00718"></a>00718 <span class="keywordflow">return</span> ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a>;
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="comment">/*</span>
<a name="l00722"></a>00722 <span class="comment"> * Prune currently active root channels for next frame. Also, perform exit</span>
<a name="l00723"></a>00723 <span class="comment"> * transitions out of them and activate successors.</span>
<a name="l00724"></a>00724 <span class="comment"> * score[] of pruned root chan set to WORST_SCORE elsewhere.</span>
<a name="l00725"></a>00725 <span class="comment"> */</span>
<a name="l00726"></a>00726 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00727"></a>00727 prune_root_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00728"></a>00728 {
<a name="l00729"></a>00729 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l00730"></a>00730 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm;
<a name="l00731"></a>00731 int32 i, nf, w;
<a name="l00732"></a>00732 int32 thresh, newphone_thresh, lastphn_thresh, newphone_score;
<a name="l00733"></a>00733 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> **nacl; <span class="comment">/* next active list */</span>
<a name="l00734"></a>00734 <a class="code" href="structlastphn__cand__s.html">lastphn_cand_t</a> *candp;
<a name="l00735"></a>00735 <a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *pls;
<a name="l00736"></a>00736
<a name="l00737"></a>00737 nf = frame_idx + 1;
<a name="l00738"></a>00738 thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->dynamic_beam;
<a name="l00739"></a>00739 newphone_thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->pbeam;
<a name="l00740"></a>00740 lastphn_thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->lpbeam;
<a name="l00741"></a>00741 nacl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[nf & 0x1];
<a name="l00742"></a>00742 pls = (<a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *)ps_search_lookahead(ngs);
<a name="l00743"></a>00743
<a name="l00744"></a>00744 <span class="keywordflow">for</span> (i = 0, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i < ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>; i++, rhmm++) {
<a name="l00745"></a>00745 E_DEBUG(3,(<span class="stringliteral">"Root channel %d frame %d score %d thresh %d\n"</span>,
<a name="l00746"></a>00746 i, hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), thresh));
<a name="l00747"></a>00747 <span class="comment">/* First check if this channel was active in current frame */</span>
<a name="l00748"></a>00748 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l00749"></a>00749 <span class="keywordflow">continue</span>;
<a name="l00750"></a>00750
<a name="l00751"></a>00751 <span class="keywordflow">if</span> (hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) BETTER_THAN thresh) {
<a name="l00752"></a>00752 hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) = nf; <span class="comment">/* rhmm will be active in next frame */</span>
<a name="l00753"></a>00753 E_DEBUG(3,(<span class="stringliteral">"Preserving root channel %d score %d\n"</span>, i, hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>)));
<a name="l00754"></a>00754 <span class="comment">/* transitions out of this root channel */</span>
<a name="l00755"></a>00755 <span class="comment">/* transition to all next-level channels in the HMM tree */</span>
<a name="l00756"></a>00756 newphone_score = hmm_out_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) + ngs->pip;
<a name="l00757"></a>00757 <span class="keywordflow">if</span> (pls != NULL || newphone_score BETTER_THAN newphone_thresh) {
<a name="l00758"></a>00758 <span class="keywordflow">for</span> (hmm = rhmm-><a class="code" href="structroot__chan__s.html#ae0f0b90a7cb2fcb54cd7b30502dd497e" title="first descendant of this channel">next</a>; hmm; hmm = hmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a>) {
<a name="l00759"></a>00759 int32 pl_newphone_score = newphone_score
<a name="l00760"></a>00760 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, hmm-><a class="code" href="structchan__s.html#a33da51d8524073abc792519d0738ca0b" title="ciphone for this node">ciphone</a>);
<a name="l00761"></a>00761 <span class="keywordflow">if</span> (pl_newphone_score BETTER_THAN newphone_thresh) {
<a name="l00762"></a>00762 <span class="keywordflow">if</span> ((hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l00763"></a>00763 || (pl_newphone_score BETTER_THAN hmm_in_score(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>))) {
<a name="l00764"></a>00764 hmm_enter(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>, pl_newphone_score,
<a name="l00765"></a>00765 hmm_out_history(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), nf);
<a name="l00766"></a>00766 *(nacl++) = hmm;
<a name="l00767"></a>00767 }
<a name="l00768"></a>00768 }
<a name="l00769"></a>00769 }
<a name="l00770"></a>00770 }
<a name="l00771"></a>00771
<a name="l00772"></a>00772 <span class="comment">/*</span>
<a name="l00773"></a>00773 <span class="comment"> * Transition to last phone of all words for which this is the</span>
<a name="l00774"></a>00774 <span class="comment"> * penultimate phone (the last phones may need multiple right contexts).</span>
<a name="l00775"></a>00775 <span class="comment"> * Remember to remove the temporary newword_penalty.</span>
<a name="l00776"></a>00776 <span class="comment"> */</span>
<a name="l00777"></a>00777 <span class="keywordflow">if</span> (pls != NULL || newphone_score BETTER_THAN lastphn_thresh) {
<a name="l00778"></a>00778 <span class="keywordflow">for</span> (w = rhmm->penult_phn_wid; w >= 0;
<a name="l00779"></a>00779 w = ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[w]) {
<a name="l00780"></a>00780 int32 pl_newphone_score = newphone_score
<a name="l00781"></a>00781 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>
<a name="l00782"></a>00782 (pls, dict_last_phone(ps_search_dict(ngs),w));
<a name="l00783"></a>00783 E_DEBUG(3,(<span class="stringliteral">"word %s newphone_score %d\n"</span>, dict_wordstr(ps_search_dict(ngs), w), newphone_score));
<a name="l00784"></a>00784 <span class="keywordflow">if</span> (pl_newphone_score BETTER_THAN lastphn_thresh) {
<a name="l00785"></a>00785 candp = ngs->lastphn_cand + ngs->n_lastphn_cand;
<a name="l00786"></a>00786 ngs->n_lastphn_cand++;
<a name="l00787"></a>00787 candp->wid = w;
<a name="l00788"></a>00788 candp->score =
<a name="l00789"></a>00789 pl_newphone_score - ngs->nwpen;
<a name="l00790"></a>00790 candp->bp = hmm_out_history(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l00791"></a>00791 }
<a name="l00792"></a>00792 }
<a name="l00793"></a>00793 }
<a name="l00794"></a>00794 }
<a name="l00795"></a>00795 }
<a name="l00796"></a>00796 ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[nf & 0x1] = nacl - ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[nf & 0x1];
<a name="l00797"></a>00797 }
<a name="l00798"></a>00798
<a name="l00799"></a>00799 <span class="comment">/*</span>
<a name="l00800"></a>00800 <span class="comment"> * Prune currently active nonroot channels in HMM tree for next frame. Also, perform</span>
<a name="l00801"></a>00801 <span class="comment"> * exit transitions out of such channels and activate successors.</span>
<a name="l00802"></a>00802 <span class="comment"> */</span>
<a name="l00803"></a>00803 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00804"></a>00804 prune_nonroot_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00805"></a>00805 {
<a name="l00806"></a>00806 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, *nexthmm;
<a name="l00807"></a>00807 int32 nf, w, i;
<a name="l00808"></a>00808 int32 thresh, newphone_thresh, lastphn_thresh, newphone_score;
<a name="l00809"></a>00809 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> **acl, **nacl; <span class="comment">/* active list, next active list */</span>
<a name="l00810"></a>00810 <a class="code" href="structlastphn__cand__s.html">lastphn_cand_t</a> *candp;
<a name="l00811"></a>00811 <a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *pls;
<a name="l00812"></a>00812
<a name="l00813"></a>00813 nf = frame_idx + 1;
<a name="l00814"></a>00814
<a name="l00815"></a>00815 thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->dynamic_beam;
<a name="l00816"></a>00816 newphone_thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->pbeam;
<a name="l00817"></a>00817 lastphn_thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->lpbeam;
<a name="l00818"></a>00818 pls = (<a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *)ps_search_lookahead(ngs);
<a name="l00819"></a>00819
<a name="l00820"></a>00820 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[frame_idx & 0x1]; <span class="comment">/* currently active HMMs in tree */</span>
<a name="l00821"></a>00821 nacl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[nf & 0x1] + ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[nf & 0x1];
<a name="l00822"></a>00822
<a name="l00823"></a>00823 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[frame_idx & 0x1], hmm = *(acl++); i > 0;
<a name="l00824"></a>00824 --i, hmm = *(acl++)) {
<a name="l00825"></a>00825 assert(hmm_frame(&hmm->hmm) >= frame_idx);
<a name="l00826"></a>00826
<a name="l00827"></a>00827 <span class="keywordflow">if</span> (hmm_bestscore(&hmm->hmm) BETTER_THAN thresh) {
<a name="l00828"></a>00828 <span class="comment">/* retain this channel in next frame */</span>
<a name="l00829"></a>00829 <span class="keywordflow">if</span> (hmm_frame(&hmm->hmm) != nf) {
<a name="l00830"></a>00830 hmm_frame(&hmm->hmm) = nf;
<a name="l00831"></a>00831 *(nacl++) = hmm;
<a name="l00832"></a>00832 }
<a name="l00833"></a>00833
<a name="l00834"></a>00834 <span class="comment">/* transition to all next-level channel in the HMM tree */</span>
<a name="l00835"></a>00835 newphone_score = hmm_out_score(&hmm->hmm) + ngs->pip;
<a name="l00836"></a>00836 <span class="keywordflow">if</span> (pls != NULL || newphone_score BETTER_THAN newphone_thresh) {
<a name="l00837"></a>00837 <span class="keywordflow">for</span> (nexthmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>; nexthmm; nexthmm = nexthmm-><a class="code" href="structchan__s.html#a52e85d037ca3a8b21ff1eed1d469ca15" title="sibling; i.e., next descendant of parent HMM">alt</a>) {
<a name="l00838"></a>00838 int32 pl_newphone_score = newphone_score
<a name="l00839"></a>00839 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, nexthmm-><a class="code" href="structchan__s.html#a33da51d8524073abc792519d0738ca0b" title="ciphone for this node">ciphone</a>);
<a name="l00840"></a>00840 <span class="keywordflow">if</span> ((pl_newphone_score BETTER_THAN newphone_thresh)
<a name="l00841"></a>00841 && ((hmm_frame(&nexthmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l00842"></a>00842 || (pl_newphone_score
<a name="l00843"></a>00843 BETTER_THAN hmm_in_score(&nexthmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>)))) {
<a name="l00844"></a>00844 <span class="keywordflow">if</span> (hmm_frame(&nexthmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) != nf) {
<a name="l00845"></a>00845 <span class="comment">/* Keep this HMM on the active list */</span>
<a name="l00846"></a>00846 *(nacl++) = nexthmm;
<a name="l00847"></a>00847 }
<a name="l00848"></a>00848 hmm_enter(&nexthmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>, pl_newphone_score,
<a name="l00849"></a>00849 hmm_out_history(&hmm->hmm), nf);
<a name="l00850"></a>00850 }
<a name="l00851"></a>00851 }
<a name="l00852"></a>00852 }
<a name="l00853"></a>00853
<a name="l00854"></a>00854 <span class="comment">/*</span>
<a name="l00855"></a>00855 <span class="comment"> * Transition to last phone of all words for which this is the</span>
<a name="l00856"></a>00856 <span class="comment"> * penultimate phone (the last phones may need multiple right contexts).</span>
<a name="l00857"></a>00857 <span class="comment"> * Remember to remove the temporary newword_penalty.</span>
<a name="l00858"></a>00858 <span class="comment"> */</span>
<a name="l00859"></a>00859 <span class="keywordflow">if</span> (pls != NULL || newphone_score BETTER_THAN lastphn_thresh) {
<a name="l00860"></a>00860 <span class="keywordflow">for</span> (w = hmm->info.penult_phn_wid; w >= 0;
<a name="l00861"></a>00861 w = ngs-><a class="code" href="structngram__search__s.html#ab251bb3d0ddd33dd99ed390b61e481f2" title="Each node in the HMM tree structure may point to a set of words whose last phone would follow that no...">homophone_set</a>[w]) {
<a name="l00862"></a>00862 int32 pl_newphone_score = newphone_score
<a name="l00863"></a>00863 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>
<a name="l00864"></a>00864 (pls, dict_last_phone(ps_search_dict(ngs),w));
<a name="l00865"></a>00865 <span class="keywordflow">if</span> (pl_newphone_score BETTER_THAN lastphn_thresh) {
<a name="l00866"></a>00866 candp = ngs->lastphn_cand + ngs->n_lastphn_cand;
<a name="l00867"></a>00867 ngs->n_lastphn_cand++;
<a name="l00868"></a>00868 candp->wid = w;
<a name="l00869"></a>00869 candp->score =
<a name="l00870"></a>00870 pl_newphone_score - ngs->nwpen;
<a name="l00871"></a>00871 candp->bp = hmm_out_history(&hmm->hmm);
<a name="l00872"></a>00872 }
<a name="l00873"></a>00873 }
<a name="l00874"></a>00874 }
<a name="l00875"></a>00875 }
<a name="l00876"></a>00876 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (hmm_frame(&hmm->hmm) != nf) {
<a name="l00877"></a>00877 hmm_clear(&hmm->hmm);
<a name="l00878"></a>00878 }
<a name="l00879"></a>00879 }
<a name="l00880"></a>00880 ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[nf & 0x1] = nacl - ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[nf & 0x1];
<a name="l00881"></a>00881 }
<a name="l00882"></a>00882
<a name="l00883"></a>00883 <span class="comment">/*</span>
<a name="l00884"></a>00884 <span class="comment"> * Execute the transition into the last phone for all candidates words emerging from</span>
<a name="l00885"></a>00885 <span class="comment"> * the HMM tree. Attach LM scores to such transitions.</span>
<a name="l00886"></a>00886 <span class="comment"> * (Executed after pruning root and non-root, but before pruning word-chan.)</span>
<a name="l00887"></a>00887 <span class="comment"> */</span>
<a name="l00888"></a>00888 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00889"></a>00889 last_phone_transition(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l00890"></a>00890 {
<a name="l00891"></a>00891 int32 i, j, k, nf, bp, bpend, w;
<a name="l00892"></a>00892 <a class="code" href="structlastphn__cand__s.html">lastphn_cand_t</a> *candp;
<a name="l00893"></a>00893 int32 *nawl;
<a name="l00894"></a>00894 int32 thresh;
<a name="l00895"></a>00895 int32 bestscore, dscr;
<a name="l00896"></a>00896 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm;
<a name="l00897"></a>00897 <a class="code" href="structbptbl__s.html" title="Back pointer table (forward pass lattice; actually a tree)">bptbl_t</a> *bpe;
<a name="l00898"></a>00898 int32 n_cand_sf = 0;
<a name="l00899"></a>00899
<a name="l00900"></a>00900 nf = frame_idx + 1;
<a name="l00901"></a>00901 nawl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[nf & 0x1];
<a name="l00902"></a>00902 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_lastphn_cand_utt += ngs->n_lastphn_cand;
<a name="l00903"></a>00903
<a name="l00904"></a>00904 <span class="comment">/* For each candidate word (entering its last phone) */</span>
<a name="l00905"></a>00905 <span class="comment">/* If best LM score and bp for candidate known use it, else sort cands by startfrm */</span>
<a name="l00906"></a>00906 <span class="keywordflow">for</span> (i = 0, candp = ngs->lastphn_cand; i < ngs->n_lastphn_cand; i++, candp++) {
<a name="l00907"></a>00907 int32 start_score;
<a name="l00908"></a>00908
<a name="l00909"></a>00909 <span class="comment">/* This can happen if recognition fails. */</span>
<a name="l00910"></a>00910 <span class="keywordflow">if</span> (candp->bp == -1)
<a name="l00911"></a>00911 <span class="keywordflow">continue</span>;
<a name="l00912"></a>00912 <span class="comment">/* Backpointer entry for it. */</span>
<a name="l00913"></a>00913 bpe = &(ngs->bp_table[candp->bp]);
<a name="l00914"></a>00914
<a name="l00915"></a>00915 <span class="comment">/* Subtract starting score for candidate, leave it with only word score */</span>
<a name="l00916"></a>00916 start_score = <a class="code" href="ngram__search_8c.html#a25a80e488425b2bd4e24eb753c9295a5" title="Get the exit score for a backpointer entry with a given right context.">ngram_search_exit_score</a>
<a name="l00917"></a>00917 (ngs, bpe, dict_first_phone(ps_search_dict(ngs), candp->wid));
<a name="l00918"></a>00918 assert(start_score BETTER_THAN <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>);
<a name="l00919"></a>00919 candp->score -= start_score;
<a name="l00920"></a>00920
<a name="l00921"></a>00921 <span class="comment">/*</span>
<a name="l00922"></a>00922 <span class="comment"> * If this candidate not occurred in an earlier frame, prepare for finding</span>
<a name="l00923"></a>00923 <span class="comment"> * best transition score into last phone; sort by start frame.</span>
<a name="l00924"></a>00924 <span class="comment"> */</span>
<a name="l00925"></a>00925 <span class="comment">/* i.e. if we don't have an entry in last_ltrans for this</span>
<a name="l00926"></a>00926 <span class="comment"> * <word,sf>, then create one */</span>
<a name="l00927"></a>00927 <span class="keywordflow">if</span> (ngs->last_ltrans[candp->wid].sf != bpe-><a class="code" href="structbptbl__s.html#ad1f5831762cf337974ce243902364f42" title="start or end frame">frame</a> + 1) {
<a name="l00928"></a>00928 <span class="comment">/* Look for an entry in cand_sf matching the backpointer</span>
<a name="l00929"></a>00929 <span class="comment"> * for this candidate. */</span>
<a name="l00930"></a>00930 <span class="keywordflow">for</span> (j = 0; j < n_cand_sf; j++) {
<a name="l00931"></a>00931 <span class="keywordflow">if</span> (ngs->cand_sf[j].bp_ef == bpe-><a class="code" href="structbptbl__s.html#ad1f5831762cf337974ce243902364f42" title="start or end frame">frame</a>)
<a name="l00932"></a>00932 <span class="keywordflow">break</span>;
<a name="l00933"></a>00933 }
<a name="l00934"></a>00934 <span class="comment">/* Oh, we found one, so chain onto it. */</span>
<a name="l00935"></a>00935 <span class="keywordflow">if</span> (j < n_cand_sf)
<a name="l00936"></a>00936 candp->next = ngs->cand_sf[j].cand;
<a name="l00937"></a>00937 <span class="keywordflow">else</span> {
<a name="l00938"></a>00938 <span class="comment">/* Nope, let's make a new one, allocating cand_sf if necessary. */</span>
<a name="l00939"></a>00939 <span class="keywordflow">if</span> (n_cand_sf >= ngs->cand_sf_alloc) {
<a name="l00940"></a>00940 <span class="keywordflow">if</span> (ngs->cand_sf_alloc == 0) {
<a name="l00941"></a>00941 ngs->cand_sf =
<a name="l00942"></a>00942 ckd_calloc(CAND_SF_ALLOCSIZE,
<a name="l00943"></a>00943 <span class="keyword">sizeof</span>(*ngs->cand_sf));
<a name="l00944"></a>00944 ngs->cand_sf_alloc = CAND_SF_ALLOCSIZE;
<a name="l00945"></a>00945 }
<a name="l00946"></a>00946 <span class="keywordflow">else</span> {
<a name="l00947"></a>00947 ngs->cand_sf_alloc += CAND_SF_ALLOCSIZE;
<a name="l00948"></a>00948 ngs->cand_sf = ckd_realloc(ngs->cand_sf,
<a name="l00949"></a>00949 ngs->cand_sf_alloc
<a name="l00950"></a>00950 * <span class="keyword">sizeof</span>(*ngs->cand_sf));
<a name="l00951"></a>00951 E_INFO(<span class="stringliteral">"cand_sf[] increased to %d entries\n"</span>,
<a name="l00952"></a>00952 ngs->cand_sf_alloc);
<a name="l00953"></a>00953 }
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955
<a name="l00956"></a>00956 <span class="comment">/* Use the newly created cand_sf. */</span>
<a name="l00957"></a>00957 j = n_cand_sf++;
<a name="l00958"></a>00958 candp->next = -1; <span class="comment">/* End of the chain. */</span>
<a name="l00959"></a>00959 ngs->cand_sf[j].bp_ef = bpe-><a class="code" href="structbptbl__s.html#ad1f5831762cf337974ce243902364f42" title="start or end frame">frame</a>;
<a name="l00960"></a>00960 }
<a name="l00961"></a>00961 <span class="comment">/* Update it to point to this candidate. */</span>
<a name="l00962"></a>00962 ngs->cand_sf[j].cand = i;
<a name="l00963"></a>00963
<a name="l00964"></a>00964 ngs->last_ltrans[candp->wid].dscr = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l00965"></a>00965 ngs->last_ltrans[candp->wid].sf = bpe-><a class="code" href="structbptbl__s.html#ad1f5831762cf337974ce243902364f42" title="start or end frame">frame</a> + 1;
<a name="l00966"></a>00966 }
<a name="l00967"></a>00967 }
<a name="l00968"></a>00968
<a name="l00969"></a>00969 <span class="comment">/* Compute best LM score and bp for new cands entered in the sorted lists above */</span>
<a name="l00970"></a>00970 <span class="keywordflow">for</span> (i = 0; i < n_cand_sf; i++) {
<a name="l00971"></a>00971 <span class="comment">/* For the i-th unique end frame... */</span>
<a name="l00972"></a>00972 bp = ngs->bp_table_idx[ngs->cand_sf[i].bp_ef];
<a name="l00973"></a>00973 bpend = ngs->bp_table_idx[ngs->cand_sf[i].bp_ef + 1];
<a name="l00974"></a>00974 <span class="keywordflow">for</span> (bpe = &(ngs->bp_table[bp]); bp < bpend; bp++, bpe++) {
<a name="l00975"></a>00975 <span class="keywordflow">if</span> (!bpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a>)
<a name="l00976"></a>00976 <span class="keywordflow">continue</span>;
<a name="l00977"></a>00977 <span class="comment">/* For each candidate at the start frame find bp->cand transition-score */</span>
<a name="l00978"></a>00978 <span class="keywordflow">for</span> (j = ngs->cand_sf[i].cand; j >= 0; j = candp->next) {
<a name="l00979"></a>00979 int32 n_used;
<a name="l00980"></a>00980 candp = &(ngs->lastphn_cand[j]);
<a name="l00981"></a>00981 dscr =
<a name="l00982"></a>00982 <a class="code" href="ngram__search_8c.html#a25a80e488425b2bd4e24eb753c9295a5" title="Get the exit score for a backpointer entry with a given right context.">ngram_search_exit_score</a>
<a name="l00983"></a>00983 (ngs, bpe, dict_first_phone(ps_search_dict(ngs), candp->wid));
<a name="l00984"></a>00984 <span class="keywordflow">if</span> (dscr BETTER_THAN <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>) {
<a name="l00985"></a>00985 assert(!dict_filler_word(ps_search_dict(ngs), candp->wid));
<a name="l00986"></a>00986 dscr += ngram_tg_score(ngs-><a class="code" href="structngram__search__s.html#a6127a6d8fb53832e67456c11aa6ad9c4" title="Set of language models.">lmset</a>,
<a name="l00987"></a>00987 dict_basewid(ps_search_dict(ngs), candp->wid),
<a name="l00988"></a>00988 bpe-><a class="code" href="structbptbl__s.html#a91247e4f807cf780afe8f5ac45e720b8" title="wid of this or latest predecessor real word">real_wid</a>,
<a name="l00989"></a>00989 bpe-><a class="code" href="structbptbl__s.html#a83784e3b0121bc365d485151ab277920" title="wid of second-last real word">prev_real_wid</a>,
<a name="l00990"></a>00990 &n_used)>><a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00991"></a>00991 }
<a name="l00992"></a>00992
<a name="l00993"></a>00993 <span class="keywordflow">if</span> (dscr BETTER_THAN ngs->last_ltrans[candp->wid].dscr) {
<a name="l00994"></a>00994 ngs->last_ltrans[candp->wid].dscr = dscr;
<a name="l00995"></a>00995 ngs->last_ltrans[candp->wid].bp = bp;
<a name="l00996"></a>00996 }
<a name="l00997"></a>00997 }
<a name="l00998"></a>00998 }
<a name="l00999"></a>00999 }
<a name="l01000"></a>01000
<a name="l01001"></a>01001 <span class="comment">/* Update best transitions for all candidates; also update best lastphone score */</span>
<a name="l01002"></a>01002 bestscore = ngs-><a class="code" href="structngram__search__s.html#a81ee45f3c184568e2b5f8b79c58e0b9e" title="Best Viterbi path score for last phone.">last_phone_best_score</a>;
<a name="l01003"></a>01003 <span class="keywordflow">for</span> (i = 0, candp = ngs->lastphn_cand; i < ngs->n_lastphn_cand; i++, candp++) {
<a name="l01004"></a>01004 candp->score += ngs->last_ltrans[candp->wid].dscr;
<a name="l01005"></a>01005 candp->bp = ngs->last_ltrans[candp->wid].bp;
<a name="l01006"></a>01006
<a name="l01007"></a>01007 <span class="keywordflow">if</span> (candp->score BETTER_THAN bestscore)
<a name="l01008"></a>01008 bestscore = candp->score;
<a name="l01009"></a>01009 }
<a name="l01010"></a>01010 ngs-><a class="code" href="structngram__search__s.html#a81ee45f3c184568e2b5f8b79c58e0b9e" title="Best Viterbi path score for last phone.">last_phone_best_score</a> = bestscore;
<a name="l01011"></a>01011
<a name="l01012"></a>01012 <span class="comment">/* At this pt, we know the best entry score (with LM component) for all candidates */</span>
<a name="l01013"></a>01013 thresh = bestscore + ngs->lponlybeam;
<a name="l01014"></a>01014 <span class="keywordflow">for</span> (i = ngs->n_lastphn_cand, candp = ngs->lastphn_cand; i > 0; --i, candp++) {
<a name="l01015"></a>01015 <span class="keywordflow">if</span> (candp->score BETTER_THAN thresh) {
<a name="l01016"></a>01016 w = candp->wid;
<a name="l01017"></a>01017
<a name="l01018"></a>01018 <a class="code" href="ngram__search_8c.html#a1ddcc1a9cb3e164ceb2140097ed23a3e" title="Allocate last phone channels for all possible right contexts for word w.">ngram_search_alloc_all_rc</a>(ngs, w);
<a name="l01019"></a>01019
<a name="l01020"></a>01020 k = 0;
<a name="l01021"></a>01021 <span class="keywordflow">for</span> (hmm = ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]; hmm; hmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>) {
<a name="l01022"></a>01022 <span class="keywordflow">if</span> ((hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01023"></a>01023 || (candp->score BETTER_THAN hmm_in_score(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>))) {
<a name="l01024"></a>01024 assert(hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) != nf);
<a name="l01025"></a>01025 hmm_enter(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>,
<a name="l01026"></a>01026 candp->score, candp->bp, nf);
<a name="l01027"></a>01027 k++;
<a name="l01028"></a>01028 }
<a name="l01029"></a>01029 }
<a name="l01030"></a>01030 <span class="keywordflow">if</span> (k > 0) {
<a name="l01031"></a>01031 assert(bitvec_is_clear(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w));
<a name="l01032"></a>01032 assert(!dict_is_single_phone(ps_search_dict(ngs), w));
<a name="l01033"></a>01033 *(nawl++) = w;
<a name="l01034"></a>01034 bitvec_set(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w);
<a name="l01035"></a>01035 }
<a name="l01036"></a>01036 }
<a name="l01037"></a>01037 }
<a name="l01038"></a>01038 ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[nf & 0x1] = nawl - ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[nf & 0x1];
<a name="l01039"></a>01039 }
<a name="l01040"></a>01040
<a name="l01041"></a>01041 <span class="comment">/*</span>
<a name="l01042"></a>01042 <span class="comment"> * Prune currently active word channels for next frame. Also, perform exit</span>
<a name="l01043"></a>01043 <span class="comment"> * transitions out of such channels and active successors.</span>
<a name="l01044"></a>01044 <span class="comment"> */</span>
<a name="l01045"></a>01045 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01046"></a>01046 prune_word_chan(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01047"></a>01047 {
<a name="l01048"></a>01048 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l01049"></a>01049 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, *thmm;
<a name="l01050"></a>01050 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> **phmmp; <span class="comment">/* previous HMM-pointer */</span>
<a name="l01051"></a>01051 int32 nf, w, i, k;
<a name="l01052"></a>01052 int32 newword_thresh, lastphn_thresh;
<a name="l01053"></a>01053 int32 *awl, *nawl;
<a name="l01054"></a>01054
<a name="l01055"></a>01055 nf = frame_idx + 1;
<a name="l01056"></a>01056 newword_thresh = ngs-><a class="code" href="structngram__search__s.html#a81ee45f3c184568e2b5f8b79c58e0b9e" title="Best Viterbi path score for last phone.">last_phone_best_score</a> + ngs->wbeam;
<a name="l01057"></a>01057 lastphn_thresh = ngs-><a class="code" href="structngram__search__s.html#a81ee45f3c184568e2b5f8b79c58e0b9e" title="Best Viterbi path score for last phone.">last_phone_best_score</a> + ngs->lponlybeam;
<a name="l01058"></a>01058
<a name="l01059"></a>01059 awl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[frame_idx & 0x1];
<a name="l01060"></a>01060 nawl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[nf & 0x1] + ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[nf & 0x1];
<a name="l01061"></a>01061
<a name="l01062"></a>01062 <span class="comment">/* Dynamically allocated last channels of multi-phone words */</span>
<a name="l01063"></a>01063 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[frame_idx & 0x1], w = *(awl++); i > 0;
<a name="l01064"></a>01064 --i, w = *(awl++)) {
<a name="l01065"></a>01065 k = 0;
<a name="l01066"></a>01066 phmmp = &(ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]);
<a name="l01067"></a>01067 <span class="keywordflow">for</span> (hmm = ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w]; hmm; hmm = thmm) {
<a name="l01068"></a>01068 assert(hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) >= frame_idx);
<a name="l01069"></a>01069
<a name="l01070"></a>01070 thmm = hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>;
<a name="l01071"></a>01071 <span class="keywordflow">if</span> (hmm_bestscore(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) BETTER_THAN lastphn_thresh) {
<a name="l01072"></a>01072 <span class="comment">/* retain this channel in next frame */</span>
<a name="l01073"></a>01073 hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) = nf;
<a name="l01074"></a>01074 k++;
<a name="l01075"></a>01075 phmmp = &(hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>);
<a name="l01076"></a>01076
<a name="l01077"></a>01077 <span class="comment">/* Could if ((! skip_alt_frm) || (frame_idx & 0x1)) the following */</span>
<a name="l01078"></a>01078 <span class="keywordflow">if</span> (hmm_out_score(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) BETTER_THAN newword_thresh) {
<a name="l01079"></a>01079 <span class="comment">/* can exit channel and recognize word */</span>
<a name="l01080"></a>01080 <a class="code" href="ngram__search_8c.html#ae36649be6f5a2190e759e7ed13bd7b6b" title="Enter a word in the backpointer table.">ngram_search_save_bp</a>(ngs, frame_idx, w,
<a name="l01081"></a>01081 hmm_out_score(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>),
<a name="l01082"></a>01082 hmm_out_history(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>),
<a name="l01083"></a>01083 hmm->info.<a class="code" href="structchan__s.html#acf84a2fa662e7ff626769e7d8152a608" title="right-context id for last phone of words">rc_id</a>);
<a name="l01084"></a>01084 }
<a name="l01085"></a>01085 }
<a name="l01086"></a>01086 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (hmm_frame(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>) == nf) {
<a name="l01087"></a>01087 phmmp = &(hmm-><a class="code" href="structchan__s.html#a260b68eff64150d0ae9ce4db7feb1300" title="first descendant of this channel; or, in the case of the last phone of a word, the next alternative r...">next</a>);
<a name="l01088"></a>01088 }
<a name="l01089"></a>01089 <span class="keywordflow">else</span> {
<a name="l01090"></a>01090 hmm_deinit(&hmm-><a class="code" href="structchan__s.html#a742d6a125ac468b95a1ddd880a956e35" title="Basic HMM structure.">hmm</a>);
<a name="l01091"></a>01091 listelem_free(ngs-><a class="code" href="structngram__search__s.html#abe9fe60f6e48b9a6e3d41856bb1dc109" title="For chan_t.">chan_alloc</a>, hmm);
<a name="l01092"></a>01092 *phmmp = thmm;
<a name="l01093"></a>01093 }
<a name="l01094"></a>01094 }
<a name="l01095"></a>01095 <span class="keywordflow">if</span> ((k > 0) && (bitvec_is_clear(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w))) {
<a name="l01096"></a>01096 assert(!dict_is_single_phone(ps_search_dict(ngs), w));
<a name="l01097"></a>01097 *(nawl++) = w;
<a name="l01098"></a>01098 bitvec_set(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w);
<a name="l01099"></a>01099 }
<a name="l01100"></a>01100 }
<a name="l01101"></a>01101 ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[nf & 0x1] = nawl - ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[nf & 0x1];
<a name="l01102"></a>01102
<a name="l01103"></a>01103 <span class="comment">/*</span>
<a name="l01104"></a>01104 <span class="comment"> * Prune permanently allocated single-phone channels.</span>
<a name="l01105"></a>01105 <span class="comment"> * NOTES: score[] of pruned channels set to WORST_SCORE elsewhere.</span>
<a name="l01106"></a>01106 <span class="comment"> */</span>
<a name="l01107"></a>01107 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l01108"></a>01108 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l01109"></a>01109 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l01110"></a>01110 E_DEBUG(3,(<span class="stringliteral">"Single phone word %s frame %d score %d thresh %d outscore %d nwthresh %d\n"</span>,
<a name="l01111"></a>01111 dict_wordstr(ps_search_dict(ngs),w),
<a name="l01112"></a>01112 hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>),
<a name="l01113"></a>01113 lastphn_thresh, hmm_out_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), newword_thresh));
<a name="l01114"></a>01114 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01115"></a>01115 <span class="keywordflow">continue</span>;
<a name="l01116"></a>01116 <span class="keywordflow">if</span> (hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) BETTER_THAN lastphn_thresh) {
<a name="l01117"></a>01117 hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) = nf;
<a name="l01118"></a>01118
<a name="l01119"></a>01119 <span class="comment">/* Could if ((! skip_alt_frm) || (frame_idx & 0x1)) the following */</span>
<a name="l01120"></a>01120 <span class="keywordflow">if</span> (hmm_out_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) BETTER_THAN newword_thresh) {
<a name="l01121"></a>01121 E_DEBUG(4,(<span class="stringliteral">"Exiting single phone word %s with %d > %d, %d\n"</span>,
<a name="l01122"></a>01122 dict_wordstr(ps_search_dict(ngs),w),
<a name="l01123"></a>01123 hmm_out_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>),
<a name="l01124"></a>01124 lastphn_thresh, newword_thresh));
<a name="l01125"></a>01125 <a class="code" href="ngram__search_8c.html#ae36649be6f5a2190e759e7ed13bd7b6b" title="Enter a word in the backpointer table.">ngram_search_save_bp</a>(ngs, frame_idx, w,
<a name="l01126"></a>01126 hmm_out_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>),
<a name="l01127"></a>01127 hmm_out_history(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>), 0);
<a name="l01128"></a>01128 }
<a name="l01129"></a>01129 }
<a name="l01130"></a>01130 }
<a name="l01131"></a>01131 }
<a name="l01132"></a>01132
<a name="l01133"></a>01133 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01134"></a>01134 prune_channels(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01135"></a>01135 {
<a name="l01136"></a>01136 <span class="comment">/* Clear last phone candidate list. */</span>
<a name="l01137"></a>01137 ngs->n_lastphn_cand = 0;
<a name="l01138"></a>01138 <span class="comment">/* Set the dynamic beam based on maxhmmpf here. */</span>
<a name="l01139"></a>01139 ngs->dynamic_beam = ngs->beam;
<a name="l01140"></a>01140 <span class="keywordflow">if</span> (ngs->maxhmmpf != -1
<a name="l01141"></a>01141 && ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_root_chan_eval + ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_nonroot_chan_eval > ngs->maxhmmpf) {
<a name="l01142"></a>01142 <span class="comment">/* Build a histogram to approximately prune them. */</span>
<a name="l01143"></a>01143 int32 bins[256], bw, nhmms, i;
<a name="l01144"></a>01144 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l01145"></a>01145 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> **acl, *hmm;
<a name="l01146"></a>01146
<a name="l01147"></a>01147 <span class="comment">/* Bins go from zero (best score) to edge of beam. */</span>
<a name="l01148"></a>01148 bw = -ngs->beam / 256;
<a name="l01149"></a>01149 memset(bins, 0, <span class="keyword">sizeof</span>(bins));
<a name="l01150"></a>01150 <span class="comment">/* For each active root channel. */</span>
<a name="l01151"></a>01151 <span class="keywordflow">for</span> (i = 0, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i < ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>; i++, rhmm++) {
<a name="l01152"></a>01152 int32 b;
<a name="l01153"></a>01153
<a name="l01154"></a>01154 <span class="comment">/* Put it in a bin according to its bestscore. */</span>
<a name="l01155"></a>01155 b = (ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> - hmm_bestscore(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>)) / bw;
<a name="l01156"></a>01156 <span class="keywordflow">if</span> (b >= 256)
<a name="l01157"></a>01157 b = 255;
<a name="l01158"></a>01158 ++bins[b];
<a name="l01159"></a>01159 }
<a name="l01160"></a>01160 <span class="comment">/* For each active non-root channel. */</span>
<a name="l01161"></a>01161 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[frame_idx & 0x1]; <span class="comment">/* currently active HMMs in tree */</span>
<a name="l01162"></a>01162 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[frame_idx & 0x1], hmm = *(acl++);
<a name="l01163"></a>01163 i > 0; --i, hmm = *(acl++)) {
<a name="l01164"></a>01164 int32 b;
<a name="l01165"></a>01165
<a name="l01166"></a>01166 <span class="comment">/* Put it in a bin according to its bestscore. */</span>
<a name="l01167"></a>01167 b = (ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> - hmm_bestscore(&hmm->hmm)) / bw;
<a name="l01168"></a>01168 <span class="keywordflow">if</span> (b >= 256)
<a name="l01169"></a>01169 b = 255;
<a name="l01170"></a>01170 ++bins[b];
<a name="l01171"></a>01171 }
<a name="l01172"></a>01172 <span class="comment">/* Walk down the bins to find the new beam. */</span>
<a name="l01173"></a>01173 <span class="keywordflow">for</span> (i = nhmms = 0; i < 256; ++i) {
<a name="l01174"></a>01174 nhmms += bins[i];
<a name="l01175"></a>01175 <span class="keywordflow">if</span> (nhmms > ngs->maxhmmpf)
<a name="l01176"></a>01176 <span class="keywordflow">break</span>;
<a name="l01177"></a>01177 }
<a name="l01178"></a>01178 ngs->dynamic_beam = -(i * bw);
<a name="l01179"></a>01179 }
<a name="l01180"></a>01180
<a name="l01181"></a>01181 prune_root_chan(ngs, frame_idx);
<a name="l01182"></a>01182 prune_nonroot_chan(ngs, frame_idx);
<a name="l01183"></a>01183 last_phone_transition(ngs, frame_idx);
<a name="l01184"></a>01184 prune_word_chan(ngs, frame_idx);
<a name="l01185"></a>01185 }
<a name="l01186"></a>01186
<a name="l01187"></a>01187 <span class="comment">/*</span>
<a name="l01188"></a>01188 <span class="comment"> * Limit the number of word exits in each frame to maxwpf. And also limit the number of filler</span>
<a name="l01189"></a>01189 <span class="comment"> * words to 1.</span>
<a name="l01190"></a>01190 <span class="comment"> */</span>
<a name="l01191"></a>01191 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01192"></a>01192 bptable_maxwpf(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01193"></a>01193 {
<a name="l01194"></a>01194 int32 bp, n;
<a name="l01195"></a>01195 int32 bestscr, worstscr;
<a name="l01196"></a>01196 <a class="code" href="structbptbl__s.html" title="Back pointer table (forward pass lattice; actually a tree)">bptbl_t</a> *bpe, *bestbpe, *worstbpe;
<a name="l01197"></a>01197
<a name="l01198"></a>01198 <span class="comment">/* Don't prune if no pruing. */</span>
<a name="l01199"></a>01199 <span class="keywordflow">if</span> (ngs->maxwpf == -1 || ngs->maxwpf == ps_search_n_words(ngs))
<a name="l01200"></a>01200 <span class="keywordflow">return</span>;
<a name="l01201"></a>01201
<a name="l01202"></a>01202 <span class="comment">/* Allow only one filler word exit (the best) per frame */</span>
<a name="l01203"></a>01203 bestscr = (int32) 0x80000000;
<a name="l01204"></a>01204 bestbpe = NULL;
<a name="l01205"></a>01205 n = 0;
<a name="l01206"></a>01206 <span class="keywordflow">for</span> (bp = ngs->bp_table_idx[frame_idx]; bp < ngs->bpidx; bp++) {
<a name="l01207"></a>01207 bpe = &(ngs->bp_table[bp]);
<a name="l01208"></a>01208 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(ngs), bpe-><a class="code" href="structbptbl__s.html#a143ff0891fafd471000df7c73123b8a7" title="Word index.">wid</a>)) {
<a name="l01209"></a>01209 <span class="keywordflow">if</span> (bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a> BETTER_THAN bestscr) {
<a name="l01210"></a>01210 bestscr = bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a>;
<a name="l01211"></a>01211 bestbpe = bpe;
<a name="l01212"></a>01212 }
<a name="l01213"></a>01213 bpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a> = FALSE;
<a name="l01214"></a>01214 n++; <span class="comment">/* No. of filler words */</span>
<a name="l01215"></a>01215 }
<a name="l01216"></a>01216 }
<a name="l01217"></a>01217 <span class="comment">/* Restore bestbpe to valid state */</span>
<a name="l01218"></a>01218 <span class="keywordflow">if</span> (bestbpe != NULL) {
<a name="l01219"></a>01219 bestbpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a> = TRUE;
<a name="l01220"></a>01220 --n;
<a name="l01221"></a>01221 }
<a name="l01222"></a>01222
<a name="l01223"></a>01223 <span class="comment">/* Allow up to maxwpf best entries to survive; mark the remaining with valid = 0 */</span>
<a name="l01224"></a>01224 n = (ngs->bpidx
<a name="l01225"></a>01225 - ngs->bp_table_idx[frame_idx]) - n; <span class="comment">/* No. of entries after limiting fillers */</span>
<a name="l01226"></a>01226 <span class="keywordflow">for</span> (; n > ngs->maxwpf; --n) {
<a name="l01227"></a>01227 <span class="comment">/* Find worst BPTable entry */</span>
<a name="l01228"></a>01228 worstscr = (int32) 0x7fffffff;
<a name="l01229"></a>01229 worstbpe = NULL;
<a name="l01230"></a>01230 <span class="keywordflow">for</span> (bp = ngs->bp_table_idx[frame_idx]; (bp < ngs->bpidx); bp++) {
<a name="l01231"></a>01231 bpe = &(ngs->bp_table[bp]);
<a name="l01232"></a>01232 <span class="keywordflow">if</span> (bpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a> && (bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a> <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> worstscr)) {
<a name="l01233"></a>01233 worstscr = bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a>;
<a name="l01234"></a>01234 worstbpe = bpe;
<a name="l01235"></a>01235 }
<a name="l01236"></a>01236 }
<a name="l01237"></a>01237 <span class="comment">/* FIXME: Don't panic! */</span>
<a name="l01238"></a>01238 <span class="keywordflow">if</span> (worstbpe == NULL)
<a name="l01239"></a>01239 E_FATAL(<span class="stringliteral">"PANIC: No worst BPtable entry remaining\n"</span>);
<a name="l01240"></a>01240 worstbpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a> = FALSE;
<a name="l01241"></a>01241 }
<a name="l01242"></a>01242 }
<a name="l01243"></a>01243
<a name="l01244"></a>01244 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01245"></a>01245 word_transition(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01246"></a>01246 {
<a name="l01247"></a>01247 int32 i, k, bp, w, nf;
<a name="l01248"></a>01248 int32 rc;
<a name="l01249"></a>01249 int32 thresh, newscore;
<a name="l01250"></a>01250 <a class="code" href="structbptbl__s.html" title="Back pointer table (forward pass lattice; actually a tree)">bptbl_t</a> *bpe;
<a name="l01251"></a>01251 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l01252"></a>01252 <span class="keyword">struct </span><a class="code" href="structbestbp__rc__s.html">bestbp_rc_s</a> *bestbp_rc_ptr;
<a name="l01253"></a>01253 <a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *pls;
<a name="l01254"></a>01254 <a class="code" href="structdict__t.html" title="a structure for a dictionary.">dict_t</a> *dict = ps_search_dict(ngs);
<a name="l01255"></a>01255 <a class="code" href="structdict2pid__t.html" title="Building composite triphone (as well as word internal triphones) with the dictionary.">dict2pid_t</a> *d2p = ps_search_dict2pid(ngs);
<a name="l01256"></a>01256
<a name="l01257"></a>01257 <span class="comment">/*</span>
<a name="l01258"></a>01258 <span class="comment"> * Transition to start of new word instances (HMM tree roots); but only if words</span>
<a name="l01259"></a>01259 <span class="comment"> * other than </s> finished here.</span>
<a name="l01260"></a>01260 <span class="comment"> * But, first, find the best starting score for each possible right context phone.</span>
<a name="l01261"></a>01261 <span class="comment"> */</span>
<a name="l01262"></a>01262 <span class="keywordflow">for</span> (i = bin_mdef_n_ciphone(ps_search_acmod(ngs)->mdef) - 1; i >= 0; --i)
<a name="l01263"></a>01263 ngs->bestbp_rc[i].score = WORST_SCORE;
<a name="l01264"></a>01264 k = 0;
<a name="l01265"></a>01265 pls = (<a class="code" href="structphone__loop__search__s.html" title="Phone loop search structure.">phone_loop_search_t</a> *)ps_search_lookahead(ngs);
<a name="l01266"></a>01266 <span class="comment">/* Ugh, this is complicated. Scan all word exits for this frame</span>
<a name="l01267"></a>01267 <span class="comment"> * (they have already been created by prune_word_chan()). */</span>
<a name="l01268"></a>01268 <span class="keywordflow">for</span> (bp = ngs->bp_table_idx[frame_idx]; bp < ngs->bpidx; bp++) {
<a name="l01269"></a>01269 bpe = &(ngs->bp_table[bp]);
<a name="l01270"></a>01270 ngs->word_lat_idx[bpe-><a class="code" href="structbptbl__s.html#a143ff0891fafd471000df7c73123b8a7" title="Word index.">wid</a>] = NO_BP;
<a name="l01271"></a>01271
<a name="l01272"></a>01272 <span class="keywordflow">if</span> (bpe-><a class="code" href="structbptbl__s.html#a143ff0891fafd471000df7c73123b8a7" title="Word index.">wid</a> == ps_search_finish_wid(ngs))
<a name="l01273"></a>01273 <span class="keywordflow">continue</span>;
<a name="l01274"></a>01274 k++;
<a name="l01275"></a>01275
<a name="l01276"></a>01276 <span class="comment">/* DICT2PID */</span>
<a name="l01277"></a>01277 <span class="comment">/* Array of HMM scores corresponding to all the possible right</span>
<a name="l01278"></a>01278 <span class="comment"> * context expansions of the final phone. It's likely that a</span>
<a name="l01279"></a>01279 <span class="comment"> * lot of these are going to be missing, actually. */</span>
<a name="l01280"></a>01280 <span class="keywordflow">if</span> (bpe-><a class="code" href="structbptbl__s.html#a27b8e54bb7552e6afc15e4f44f42e3b7" title="next-to-last phone of this word">last2_phone</a> == -1) { <span class="comment">/* implies s_idx == -1 */</span>
<a name="l01281"></a>01281 <span class="comment">/* No right context expansion. */</span>
<a name="l01282"></a>01282 <span class="keywordflow">for</span> (rc = 0; rc < bin_mdef_n_ciphone(ps_search_acmod(ngs)->mdef); ++rc) {
<a name="l01283"></a>01283 <span class="keywordflow">if</span> (bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a> BETTER_THAN ngs->bestbp_rc[rc].score) {
<a name="l01284"></a>01284 E_DEBUG(4,(<span class="stringliteral">"bestbp_rc[0] = %d lc %d\n"</span>,
<a name="l01285"></a>01285 bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a>, bpe-><a class="code" href="structbptbl__s.html#aa7704ba76d3dcde6b8a24855362a4289" title="last phone of this word">last_phone</a>));
<a name="l01286"></a>01286 ngs->bestbp_rc[rc].score = bpe-><a class="code" href="structbptbl__s.html#aa5643c0c19ce4d39d51ddf7376f4d508" title="Score (best among all right contexts)">score</a>;
<a name="l01287"></a>01287 ngs->bestbp_rc[rc].path = bp;
<a name="l01288"></a>01288 ngs->bestbp_rc[rc].lc = bpe-><a class="code" href="structbptbl__s.html#aa7704ba76d3dcde6b8a24855362a4289" title="last phone of this word">last_phone</a>;
<a name="l01289"></a>01289 }
<a name="l01290"></a>01290 }
<a name="l01291"></a>01291 }
<a name="l01292"></a>01292 <span class="keywordflow">else</span> {
<a name="l01293"></a>01293 <a class="code" href="structxwdssid__t.html" title="cross word triphone model structure">xwdssid_t</a> *rssid = <a class="code" href="dict2pid_8h.html#a453a98931cad95a19b4c4ab770fc79f1" title="Access macros; not designed for arbitrary use.">dict2pid_rssid</a>(d2p, bpe-><a class="code" href="structbptbl__s.html#aa7704ba76d3dcde6b8a24855362a4289" title="last phone of this word">last_phone</a>, bpe-><a class="code" href="structbptbl__s.html#a27b8e54bb7552e6afc15e4f44f42e3b7" title="next-to-last phone of this word">last2_phone</a>);
<a name="l01294"></a>01294 int32 *rcss = &(ngs->bscore_stack[bpe-><a class="code" href="structbptbl__s.html#abf9e4bcf1927aa09fb2b30c59e99f551" title="Start of BScoreStack for various right contexts.">s_idx</a>]);
<a name="l01295"></a>01295 <span class="keywordflow">for</span> (rc = 0; rc < bin_mdef_n_ciphone(ps_search_acmod(ngs)->mdef); ++rc) {
<a name="l01296"></a>01296 <span class="keywordflow">if</span> (rcss[rssid-><a class="code" href="structxwdssid__t.html#a502f9241a70383aa260d3390e4ff58fb" title="Index into ssid[] above for each ci phone.">cimap</a>[rc]] BETTER_THAN ngs->bestbp_rc[rc].score) {
<a name="l01297"></a>01297 E_DEBUG(4,(<span class="stringliteral">"bestbp_rc[%d] = %d lc %d\n"</span>,
<a name="l01298"></a>01298 rc, rcss[rssid-><a class="code" href="structxwdssid__t.html#a502f9241a70383aa260d3390e4ff58fb" title="Index into ssid[] above for each ci phone.">cimap</a>[rc]], bpe-><a class="code" href="structbptbl__s.html#aa7704ba76d3dcde6b8a24855362a4289" title="last phone of this word">last_phone</a>));
<a name="l01299"></a>01299 ngs->bestbp_rc[rc].score = rcss[rssid-><a class="code" href="structxwdssid__t.html#a502f9241a70383aa260d3390e4ff58fb" title="Index into ssid[] above for each ci phone.">cimap</a>[rc]];
<a name="l01300"></a>01300 ngs->bestbp_rc[rc].path = bp;
<a name="l01301"></a>01301 ngs->bestbp_rc[rc].lc = bpe-><a class="code" href="structbptbl__s.html#aa7704ba76d3dcde6b8a24855362a4289" title="last phone of this word">last_phone</a>;
<a name="l01302"></a>01302 }
<a name="l01303"></a>01303 }
<a name="l01304"></a>01304 }
<a name="l01305"></a>01305 }
<a name="l01306"></a>01306 <span class="keywordflow">if</span> (k == 0)
<a name="l01307"></a>01307 <span class="keywordflow">return</span>;
<a name="l01308"></a>01308
<a name="l01309"></a>01309 nf = frame_idx + 1;
<a name="l01310"></a>01310 thresh = ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + ngs->dynamic_beam;
<a name="l01311"></a>01311 <span class="comment">/*</span>
<a name="l01312"></a>01312 <span class="comment"> * Hypothesize successors to words finished in this frame.</span>
<a name="l01313"></a>01313 <span class="comment"> * Main dictionary, multi-phone words transition to HMM-trees roots.</span>
<a name="l01314"></a>01314 <span class="comment"> */</span>
<a name="l01315"></a>01315 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l01316"></a>01316 bestbp_rc_ptr = &(ngs->bestbp_rc[rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>]);
<a name="l01317"></a>01317
<a name="l01318"></a>01318 newscore = bestbp_rc_ptr->score + ngs->nwpen + ngs->pip
<a name="l01319"></a>01319 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>);
<a name="l01320"></a>01320 <span class="keywordflow">if</span> (newscore BETTER_THAN thresh) {
<a name="l01321"></a>01321 <span class="keywordflow">if</span> ((hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01322"></a>01322 || (newscore BETTER_THAN hmm_in_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>))) {
<a name="l01323"></a>01323 hmm_enter(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, newscore,
<a name="l01324"></a>01324 bestbp_rc_ptr->path, nf);
<a name="l01325"></a>01325 <span class="comment">/* DICT2PID: Another place where mpx ssids are entered. */</span>
<a name="l01326"></a>01326 <span class="comment">/* Look up the ssid to use when entering this mpx triphone. */</span>
<a name="l01327"></a>01327 hmm_mpx_ssid(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0) =
<a name="l01328"></a>01328 dict2pid_ldiph_lc(d2p, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>, rhmm-><a class="code" href="structroot__chan__s.html#a0c0cf22caf4c97879af86865764f1675" title="second ciphone of this node; one root HMM for each unique right context">ci2phone</a>, bestbp_rc_ptr->lc);
<a name="l01329"></a>01329 assert(hmm_mpx_ssid(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0) != <a class="code" href="bin__mdef_8h.html#a8ee283c316e9f4aa8e6d18c1d44026bc" title="Invalid senone sequence ID (limited to 16 bits for PocketSphinx).">BAD_SSID</a>);
<a name="l01330"></a>01330 }
<a name="l01331"></a>01331 }
<a name="l01332"></a>01332 }
<a name="l01333"></a>01333
<a name="l01334"></a>01334 <span class="comment">/*</span>
<a name="l01335"></a>01335 <span class="comment"> * Single phone words; no right context for these. Cannot use bestbp_rc as</span>
<a name="l01336"></a>01336 <span class="comment"> * LM scores have to be included. First find best transition to these words.</span>
<a name="l01337"></a>01337 <span class="comment"> */</span>
<a name="l01338"></a>01338 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>; i++) {
<a name="l01339"></a>01339 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l01340"></a>01340 ngs->last_ltrans[w].dscr = (int32) 0x80000000;
<a name="l01341"></a>01341 }
<a name="l01342"></a>01342 <span class="keywordflow">for</span> (bp = ngs->bp_table_idx[frame_idx]; bp < ngs->bpidx; bp++) {
<a name="l01343"></a>01343 bpe = &(ngs->bp_table[bp]);
<a name="l01344"></a>01344 <span class="keywordflow">if</span> (!bpe-><a class="code" href="structbptbl__s.html#a4948439666e1e2204a6d1c6d9cfd1cd0" title="For absolute pruning.">valid</a>)
<a name="l01345"></a>01345 <span class="keywordflow">continue</span>;
<a name="l01346"></a>01346
<a name="l01347"></a>01347 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>; i++) {
<a name="l01348"></a>01348 int32 n_used;
<a name="l01349"></a>01349 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l01350"></a>01350 newscore = <a class="code" href="ngram__search_8c.html#a25a80e488425b2bd4e24eb753c9295a5" title="Get the exit score for a backpointer entry with a given right context.">ngram_search_exit_score</a>
<a name="l01351"></a>01351 (ngs, bpe, dict_first_phone(dict, w));
<a name="l01352"></a>01352 E_DEBUG(4, (<span class="stringliteral">"initial newscore for %s: %d\n"</span>,
<a name="l01353"></a>01353 dict_wordstr(dict, w), newscore));
<a name="l01354"></a>01354 <span class="keywordflow">if</span> (newscore != WORST_SCORE)
<a name="l01355"></a>01355 newscore += ngram_tg_score(ngs-><a class="code" href="structngram__search__s.html#a6127a6d8fb53832e67456c11aa6ad9c4" title="Set of language models.">lmset</a>,
<a name="l01356"></a>01356 dict_basewid(dict, w),
<a name="l01357"></a>01357 bpe-><a class="code" href="structbptbl__s.html#a91247e4f807cf780afe8f5ac45e720b8" title="wid of this or latest predecessor real word">real_wid</a>,
<a name="l01358"></a>01358 bpe-><a class="code" href="structbptbl__s.html#a83784e3b0121bc365d485151ab277920" title="wid of second-last real word">prev_real_wid</a>,
<a name="l01359"></a>01359 &n_used)>><a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l01360"></a>01360
<a name="l01361"></a>01361 <span class="comment">/* FIXME: Not sure how WORST_SCORE could be better, but it</span>
<a name="l01362"></a>01362 <span class="comment"> * apparently happens. */</span>
<a name="l01363"></a>01363 <span class="keywordflow">if</span> (newscore BETTER_THAN ngs->last_ltrans[w].dscr) {
<a name="l01364"></a>01364 ngs->last_ltrans[w].dscr = newscore;
<a name="l01365"></a>01365 ngs->last_ltrans[w].bp = bp;
<a name="l01366"></a>01366 }
<a name="l01367"></a>01367 }
<a name="l01368"></a>01368 }
<a name="l01369"></a>01369
<a name="l01370"></a>01370 <span class="comment">/* Now transition to in-LM single phone words */</span>
<a name="l01371"></a>01371 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a988672d895f1ee61dbf790b2065df4df" title="Number single phone dict words also in LM; these come first in single_phone_wid.">n_1ph_LMwords</a>; i++) {
<a name="l01372"></a>01372 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l01373"></a>01373 <span class="comment">/* Never transition into the start word (for one thing, it is</span>
<a name="l01374"></a>01374 <span class="comment"> a non-event in the language model.) */</span>
<a name="l01375"></a>01375 <span class="keywordflow">if</span> (w == dict_startwid(ps_search_dict(ngs)))
<a name="l01376"></a>01376 <span class="keywordflow">continue</span>;
<a name="l01377"></a>01377 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l01378"></a>01378 newscore = ngs->last_ltrans[w].dscr + ngs->pip
<a name="l01379"></a>01379 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>);
<a name="l01380"></a>01380 <span class="keywordflow">if</span> (newscore BETTER_THAN thresh) {
<a name="l01381"></a>01381 bpe = ngs->bp_table + ngs->last_ltrans[w].bp;
<a name="l01382"></a>01382 <span class="keywordflow">if</span> ((hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01383"></a>01383 || (newscore BETTER_THAN hmm_in_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>))) {
<a name="l01384"></a>01384 hmm_enter(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>,
<a name="l01385"></a>01385 newscore, ngs->last_ltrans[w].bp, nf);
<a name="l01386"></a>01386 <span class="comment">/* DICT2PID: another place where mpx ssids are entered. */</span>
<a name="l01387"></a>01387 <span class="comment">/* Look up the ssid to use when entering this mpx triphone. */</span>
<a name="l01388"></a>01388 hmm_mpx_ssid(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0) =
<a name="l01389"></a>01389 dict2pid_ldiph_lc(d2p, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>, rhmm-><a class="code" href="structroot__chan__s.html#a0c0cf22caf4c97879af86865764f1675" title="second ciphone of this node; one root HMM for each unique right context">ci2phone</a>,
<a name="l01390"></a>01390 dict_last_phone(dict, bpe-><a class="code" href="structbptbl__s.html#a143ff0891fafd471000df7c73123b8a7" title="Word index.">wid</a>));
<a name="l01391"></a>01391 assert(hmm_mpx_ssid(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>, 0) != <a class="code" href="bin__mdef_8h.html#a8ee283c316e9f4aa8e6d18c1d44026bc" title="Invalid senone sequence ID (limited to 16 bits for PocketSphinx).">BAD_SSID</a>);
<a name="l01392"></a>01392 }
<a name="l01393"></a>01393 }
<a name="l01394"></a>01394 }
<a name="l01395"></a>01395
<a name="l01396"></a>01396 <span class="comment">/* Remaining words: <sil>, noise words. No mpx for these! */</span>
<a name="l01397"></a>01397 w = ps_search_silence_wid(ngs);
<a name="l01398"></a>01398 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l01399"></a>01399 bestbp_rc_ptr = &(ngs->bestbp_rc[ps_search_acmod(ngs)->mdef->sil]);
<a name="l01400"></a>01400 newscore = bestbp_rc_ptr->score + ngs->silpen + ngs->pip
<a name="l01401"></a>01401 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>);
<a name="l01402"></a>01402 <span class="keywordflow">if</span> (newscore BETTER_THAN thresh) {
<a name="l01403"></a>01403 <span class="keywordflow">if</span> ((hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01404"></a>01404 || (newscore BETTER_THAN hmm_in_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>))) {
<a name="l01405"></a>01405 hmm_enter(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>,
<a name="l01406"></a>01406 newscore, bestbp_rc_ptr->path, nf);
<a name="l01407"></a>01407 }
<a name="l01408"></a>01408 }
<a name="l01409"></a>01409 <span class="keywordflow">for</span> (w = dict_filler_start(dict); w <= dict_filler_end(dict); w++) {
<a name="l01410"></a>01410 <span class="keywordflow">if</span> (w == ps_search_silence_wid(ngs))
<a name="l01411"></a>01411 <span class="keywordflow">continue</span>;
<a name="l01412"></a>01412 <span class="comment">/* Never transition into the start word (for one thing, it is</span>
<a name="l01413"></a>01413 <span class="comment"> a non-event in the language model.) */</span>
<a name="l01414"></a>01414 <span class="keywordflow">if</span> (w == dict_startwid(ps_search_dict(ngs)))
<a name="l01415"></a>01415 <span class="keywordflow">continue</span>;
<a name="l01416"></a>01416 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l01417"></a>01417 <span class="comment">/* If this was not actually a single-phone word, rhmm will be NULL. */</span>
<a name="l01418"></a>01418 if (rhmm == NULL)
<a name="l01419"></a>01419 <span class="keywordflow">continue</span>;
<a name="l01420"></a>01420 newscore = bestbp_rc_ptr->score + ngs->fillpen + ngs->pip
<a name="l01421"></a>01421 + <a class="code" href="phone__loop__search_8h.html#ab49609ce2ff4d1827f57693f463e360b" title="Return lookahead heuristic score for a specific phone.">phone_loop_search_score</a>(pls, rhmm-><a class="code" href="structroot__chan__s.html#ad67c37bf4183f518acd7760c09a806f6" title="first ciphone of this node; all words rooted at this node begin with this ciphone">ciphone</a>);
<a name="l01422"></a>01422 <span class="keywordflow">if</span> (newscore BETTER_THAN thresh) {
<a name="l01423"></a>01423 <span class="keywordflow">if</span> ((hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) < frame_idx)
<a name="l01424"></a>01424 || (newscore BETTER_THAN hmm_in_score(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>))) {
<a name="l01425"></a>01425 hmm_enter(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>,
<a name="l01426"></a>01426 newscore, bestbp_rc_ptr->path, nf);
<a name="l01427"></a>01427 }
<a name="l01428"></a>01428 }
<a name="l01429"></a>01429 }
<a name="l01430"></a>01430 }
<a name="l01431"></a>01431
<a name="l01432"></a>01432 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01433"></a>01433 deactivate_channels(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01434"></a>01434 {
<a name="l01435"></a>01435 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l01436"></a>01436 <span class="keywordtype">int</span> i;
<a name="l01437"></a>01437
<a name="l01438"></a>01438 <span class="comment">/* Clear score[] of pruned root channels */</span>
<a name="l01439"></a>01439 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l01440"></a>01440 <span class="keywordflow">if</span> (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx) {
<a name="l01441"></a>01441 hmm_clear(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l01442"></a>01442 }
<a name="l01443"></a>01443 }
<a name="l01444"></a>01444 <span class="comment">/* Clear score[] of pruned single-phone channels */</span>
<a name="l01445"></a>01445 <span class="keywordflow">for</span> (i = 0; i < ngs-><a class="code" href="structngram__search__s.html#a9168184c862d6f63bd7926e6581b25d9" title="Number single phone words in dict (total)">n_1ph_words</a>; i++) {
<a name="l01446"></a>01446 int32 w = ngs-><a class="code" href="structngram__search__s.html#a1157923e0060b947e05caa819c8abe2c" title="list of single-phone word ids">single_phone_wid</a>[i];
<a name="l01447"></a>01447 rhmm = (<a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *) ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w];
<a name="l01448"></a>01448 if (hmm_frame(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>) == frame_idx) {
<a name="l01449"></a>01449 hmm_clear(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l01450"></a>01450 }
<a name="l01451"></a>01451 }
<a name="l01452"></a>01452 }
<a name="l01453"></a>01453
<a name="l01454"></a>01454 <span class="keywordtype">int</span>
<a name="l01455"></a><a class="code" href="ngram__search__fwdtree_8h.html#a9e2828ba0d249424a234b6cf7d3ee530">01455</a> <a class="code" href="ngram__search__fwdtree_8c.html#a9e2828ba0d249424a234b6cf7d3ee530" title="Search one frame forward in an utterance.">ngram_fwdtree_search</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs, <span class="keywordtype">int</span> frame_idx)
<a name="l01456"></a>01456 {
<a name="l01457"></a>01457 int16 <span class="keyword">const</span> *senscr;
<a name="l01458"></a>01458
<a name="l01459"></a>01459 <span class="comment">/* Activate our HMMs for the current frame if need be. */</span>
<a name="l01460"></a>01460 <span class="keywordflow">if</span> (!ps_search_acmod(ngs)->compallsen)
<a name="l01461"></a>01461 compute_sen_active(ngs, frame_idx);
<a name="l01462"></a>01462
<a name="l01463"></a>01463 <span class="comment">/* Compute GMM scores for the current frame. */</span>
<a name="l01464"></a>01464 <span class="keywordflow">if</span> ((senscr = <a class="code" href="acmod_8c.html#acd78e9bae06724df9c53f844d90c1c8a" title="Score one frame of data.">acmod_score</a>(ps_search_acmod(ngs), &frame_idx)) == NULL)
<a name="l01465"></a>01465 <span class="keywordflow">return</span> 0;
<a name="l01466"></a>01466 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_senone_active_utt += ps_search_acmod(ngs)->n_senone_active;
<a name="l01467"></a>01467
<a name="l01468"></a>01468 <span class="comment">/* Mark backpointer table for current frame. */</span>
<a name="l01469"></a>01469 <a class="code" href="ngram__search_8c.html#a7772e007b7d7fdf437c87aeb08b59c71" title="Record the current frame&#39;s index in the backpointer table.">ngram_search_mark_bptable</a>(ngs, frame_idx);
<a name="l01470"></a>01470
<a name="l01471"></a>01471 <span class="comment">/* If the best score is equal to or worse than WORST_SCORE,</span>
<a name="l01472"></a>01472 <span class="comment"> * recognition has failed, don't bother to keep trying. */</span>
<a name="l01473"></a>01473 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> == WORST_SCORE || ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> WORST_SCORE)
<a name="l01474"></a>01474 <span class="keywordflow">return</span> 0;
<a name="l01475"></a>01475 <span class="comment">/* Renormalize if necessary */</span>
<a name="l01476"></a>01476 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a> + (2 * ngs->beam) <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> WORST_SCORE) {
<a name="l01477"></a>01477 E_INFO(<span class="stringliteral">"Renormalizing Scores at frame %d, best score %d\n"</span>,
<a name="l01478"></a>01478 frame_idx, ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a>);
<a name="l01479"></a>01479 renormalize_scores(ngs, frame_idx, ngs-><a class="code" href="structngram__search__s.html#a150d99157e2f37a6f0dbb4b02682d9c3" title="Best Viterbi path score.">best_score</a>);
<a name="l01480"></a>01480 }
<a name="l01481"></a>01481
<a name="l01482"></a>01482 <span class="comment">/* Evaluate HMMs */</span>
<a name="l01483"></a>01483 evaluate_channels(ngs, senscr, frame_idx);
<a name="l01484"></a>01484 <span class="comment">/* Prune HMMs and do phone transitions. */</span>
<a name="l01485"></a>01485 prune_channels(ngs, frame_idx);
<a name="l01486"></a>01486 <span class="comment">/* Do absolute pruning on word exits. */</span>
<a name="l01487"></a>01487 bptable_maxwpf(ngs, frame_idx);
<a name="l01488"></a>01488 <span class="comment">/* Do word transitions. */</span>
<a name="l01489"></a>01489 word_transition(ngs, frame_idx);
<a name="l01490"></a>01490 <span class="comment">/* Deactivate pruned HMMs. */</span>
<a name="l01491"></a>01491 deactivate_channels(ngs, frame_idx);
<a name="l01492"></a>01492
<a name="l01493"></a>01493 ++ngs-><a class="code" href="structngram__search__s.html#a5255e56d28c239a4e1d9b1721e8a2f8d" title="Number of frames actually present.">n_frame</a>;
<a name="l01494"></a>01494 <span class="comment">/* Return the number of frames processed. */</span>
<a name="l01495"></a>01495 <span class="keywordflow">return</span> 1;
<a name="l01496"></a>01496 }
<a name="l01497"></a>01497
<a name="l01498"></a>01498 <span class="keywordtype">void</span>
<a name="l01499"></a><a class="code" href="ngram__search__fwdtree_8h.html#af32a83dbb9187542577a0c500b000840">01499</a> <a class="code" href="ngram__search__fwdtree_8c.html#af32a83dbb9187542577a0c500b000840" title="Finish fwdtree decoding for an utterance.">ngram_fwdtree_finish</a>(<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *ngs)
<a name="l01500"></a>01500 {
<a name="l01501"></a>01501 int32 i, w, cf, *awl;
<a name="l01502"></a>01502 <a class="code" href="structroot__chan__s.html" title="Lexical tree node data type for the first phone (root) of each dynamic HMM tree structure.">root_chan_t</a> *rhmm;
<a name="l01503"></a>01503 <a class="code" href="structchan__s.html" title="Lexical tree node data type.">chan_t</a> *hmm, **acl;
<a name="l01504"></a>01504
<a name="l01505"></a>01505 <span class="comment">/* This is the number of frames processed. */</span>
<a name="l01506"></a>01506 cf = ps_search_acmod(ngs)->output_frame;
<a name="l01507"></a>01507 <span class="comment">/* Add a mark in the backpointer table for one past the final frame. */</span>
<a name="l01508"></a>01508 <a class="code" href="ngram__search_8c.html#a7772e007b7d7fdf437c87aeb08b59c71" title="Record the current frame&#39;s index in the backpointer table.">ngram_search_mark_bptable</a>(ngs, cf);
<a name="l01509"></a>01509
<a name="l01510"></a>01510 <span class="comment">/* Deactivate channels lined up for the next frame */</span>
<a name="l01511"></a>01511 <span class="comment">/* First, root channels of HMM tree */</span>
<a name="l01512"></a>01512 <span class="keywordflow">for</span> (i = ngs-><a class="code" href="structngram__search__s.html#a297d8bdb856617490ee8ccd99df70e68" title="Number of valid root_chan.">n_root_chan</a>, rhmm = ngs-><a class="code" href="structngram__search__s.html#ae1b0a51cfcddc1e4b6ac94fa1e48887a" title="Search structure of HMM instances.">root_chan</a>; i > 0; --i, rhmm++) {
<a name="l01513"></a>01513 hmm_clear(&rhmm-><a class="code" href="structroot__chan__s.html#a9d4d92ffa8b4079202ddebe3ba0eb290" title="Basic HMM structure.">hmm</a>);
<a name="l01514"></a>01514 }
<a name="l01515"></a>01515
<a name="l01516"></a>01516 <span class="comment">/* nonroot channels of HMM tree */</span>
<a name="l01517"></a>01517 i = ngs-><a class="code" href="structngram__search__s.html#ac33f60894871671ec5c2173ca56d600f" title="Number entries in active_chan_list.">n_active_chan</a>[cf & 0x1];
<a name="l01518"></a>01518 acl = ngs-><a class="code" href="structngram__search__s.html#a83731bf0e2234e632c5e78f2321f5b2d" title="Array of active channels for current and next frame.">active_chan_list</a>[cf & 0x1];
<a name="l01519"></a>01519 <span class="keywordflow">for</span> (hmm = *(acl++); i > 0; --i, hmm = *(acl++)) {
<a name="l01520"></a>01520 hmm_clear(&hmm->hmm);
<a name="l01521"></a>01521 }
<a name="l01522"></a>01522
<a name="l01523"></a>01523 <span class="comment">/* word channels */</span>
<a name="l01524"></a>01524 i = ngs-><a class="code" href="structngram__search__s.html#a5c864f1fe331fc95c04e0d87a5bdf9ee" title="Number entries in active_word_list.">n_active_word</a>[cf & 0x1];
<a name="l01525"></a>01525 awl = ngs-><a class="code" href="structngram__search__s.html#a5056573bf95990cc28c97a56cd76ce9a" title="Array of active multi-phone words for current and next frame.">active_word_list</a>[cf & 0x1];
<a name="l01526"></a>01526 <span class="keywordflow">for</span> (w = *(awl++); i > 0; --i, w = *(awl++)) {
<a name="l01527"></a>01527 <span class="comment">/* Don't accidentally free single-phone words! */</span>
<a name="l01528"></a>01528 <span class="keywordflow">if</span> (dict_is_single_phone(ps_search_dict(ngs), w))
<a name="l01529"></a>01529 <span class="keywordflow">continue</span>;
<a name="l01530"></a>01530 bitvec_clear(ngs-><a class="code" href="structngram__search__s.html#aeb4c98851bf9b239ca607ca59f59ff4c" title="array of active flags for all words.">word_active</a>, w);
<a name="l01531"></a>01531 <span class="keywordflow">if</span> (ngs-><a class="code" href="structngram__search__s.html#a79deb7295a261cd82d2a6b48cb119e77" title="Channels associated with a given word (only used for right contexts, single-phone words in fwdtree se...">word_chan</a>[w] == NULL)
<a name="l01532"></a>01532 <span class="keywordflow">continue</span>;
<a name="l01533"></a>01533 <a class="code" href="ngram__search_8c.html#a15477192481dffcb29e9c4167eff6c3c" title="Allocate last phone channels for all possible right contexts for word w.">ngram_search_free_all_rc</a>(ngs, w);
<a name="l01534"></a>01534 }
<a name="l01535"></a>01535
<a name="l01536"></a>01536 <span class="comment">/*</span>
<a name="l01537"></a>01537 <span class="comment"> * The previous search code did a postprocessing of the</span>
<a name="l01538"></a>01538 <span class="comment"> * backpointer table here, but we will postpone this until it is</span>
<a name="l01539"></a>01539 <span class="comment"> * absolutely necessary, i.e. when generating a word graph.</span>
<a name="l01540"></a>01540 <span class="comment"> * Likewise we don't actually have to decide what the exit word is</span>
<a name="l01541"></a>01541 <span class="comment"> * until somebody requests a backtrace.</span>
<a name="l01542"></a>01542 <span class="comment"> */</span>
<a name="l01543"></a>01543
<a name="l01544"></a>01544 ptmr_stop(&ngs->fwdtree_perf);
<a name="l01545"></a>01545 <span class="comment">/* Print out some statistics. */</span>
<a name="l01546"></a>01546 <span class="keywordflow">if</span> (cf > 0) {
<a name="l01547"></a>01547 <span class="keywordtype">double</span> n_speech = (double)(cf + 1)
<a name="l01548"></a>01548 / cmd_ln_int32_r(ps_search_config(ngs), <span class="stringliteral">"-frate"</span>);
<a name="l01549"></a>01549 E_INFO(<span class="stringliteral">"%8d words recognized (%d/fr)\n"</span>,
<a name="l01550"></a>01550 ngs->bpidx, (ngs->bpidx + (cf >> 1)) / (cf + 1));
<a name="l01551"></a>01551 E_INFO(<span class="stringliteral">"%8d senones evaluated (%d/fr)\n"</span>, ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_senone_active_utt,
<a name="l01552"></a>01552 (ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_senone_active_utt + (cf >> 1)) / (cf + 1));
<a name="l01553"></a>01553 E_INFO(<span class="stringliteral">"%8d channels searched (%d/fr), %d 1st, %d last\n"</span>,
<a name="l01554"></a>01554 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_root_chan_eval + ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_nonroot_chan_eval,
<a name="l01555"></a>01555 (ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_root_chan_eval + ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_nonroot_chan_eval) / (cf + 1),
<a name="l01556"></a>01556 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_root_chan_eval, ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_last_chan_eval);
<a name="l01557"></a>01557 E_INFO(<span class="stringliteral">"%8d words for which last channels evaluated (%d/fr)\n"</span>,
<a name="l01558"></a>01558 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_word_lastchan_eval,
<a name="l01559"></a>01559 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_word_lastchan_eval / (cf + 1));
<a name="l01560"></a>01560 E_INFO(<span class="stringliteral">"%8d candidate words for entering last phone (%d/fr)\n"</span>,
<a name="l01561"></a>01561 ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_lastphn_cand_utt, ngs-><a class="code" href="structngram__search__s.html#a5758d167fbb48e824a6a58186620e06d" title="Various statistics for profiling.">st</a>.n_lastphn_cand_utt / (cf + 1));
<a name="l01562"></a>01562 E_INFO(<span class="stringliteral">"fwdtree %.2f CPU %.3f xRT\n"</span>,
<a name="l01563"></a>01563 ngs->fwdtree_perf.t_cpu,
<a name="l01564"></a>01564 ngs->fwdtree_perf.t_cpu / n_speech);
<a name="l01565"></a>01565 E_INFO(<span class="stringliteral">"fwdtree %.2f wall %.3f xRT\n"</span>,
<a name="l01566"></a>01566 ngs->fwdtree_perf.t_elapsed,
<a name="l01567"></a>01567 ngs->fwdtree_perf.t_elapsed / n_speech);
<a name="l01568"></a>01568 }
<a name="l01569"></a>01569 <span class="comment">/* dump_bptable(ngs); */</span>
<a name="l01570"></a>01570 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="ngram__search__fwdtree_8c.html">ngram_search_fwdtree.c</a> </li>
<li class="footer">Generated on Wed Apr 20 2011 for PocketSphinx by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
