<!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/ps_lattice.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('ps__lattice_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libpocketsphinx/ps_lattice.c</h1> </div>
</div>
<div class="contents">
<a href="ps__lattice_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 <assert.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <string.h></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <math.h></span>
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <span class="comment">/* SphinxBase headers. */</span>
<a name="l00048"></a>00048 <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span>
<a name="l00049"></a>00049 <span class="preprocessor">#include <sphinxbase/listelem_alloc.h></span>
<a name="l00050"></a>00050 <span class="preprocessor">#include <sphinxbase/strfuncs.h></span>
<a name="l00051"></a>00051 <span class="preprocessor">#include <sphinxbase/err.h></span>
<a name="l00052"></a>00052 <span class="preprocessor">#include <sphinxbase/pio.h></span>
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="comment">/* Local headers. */</span>
<a name="l00055"></a>00055 <span class="preprocessor">#include "<a class="code" href="pocketsphinx__internal_8h.html" title="Internal implementation of PocketSphinx decoder.">pocketsphinx_internal.h</a>"</span>
<a name="l00056"></a>00056 <span class="preprocessor">#include "<a class="code" href="ps__lattice__internal_8h.html" title="Word graph search implementation.">ps_lattice_internal.h</a>"</span>
<a name="l00057"></a>00057 <span class="preprocessor">#include "<a class="code" href="ngram__search_8h.html" title="N-Gram based multi-pass search (&quot;FBS&quot;)">ngram_search.h</a>"</span>
<a name="l00058"></a>00058 <span class="preprocessor">#include "<a class="code" href="dict_8h.html" title="Operations on dictionary.">dict.h</a>"</span>
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="comment">/*</span>
<a name="l00061"></a>00061 <span class="comment"> * Create a directed link between "from" and "to" nodes, but if a link already exists,</span>
<a name="l00062"></a>00062 <span class="comment"> * choose one with the best ascr.</span>
<a name="l00063"></a>00063 <span class="comment"> */</span>
<a name="l00064"></a>00064 <span class="keywordtype">void</span>
<a name="l00065"></a><a class="code" href="ps__lattice_8c.html#a4dd3235b91f1c7202127893203c6d2a0">00065</a> <a class="code" href="ps__lattice_8h.html#a4aaae70904361b23a78cdcb632c298c4" title="Create a directed link between &quot;from&quot; and &quot;to&quot; nodes, but if a link already exist...">ps_lattice_link</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *from, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *to,
<a name="l00066"></a>00066 int32 score, int32 ef)
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *fwdlink;
<a name="l00069"></a>00069
<a name="l00070"></a>00070 <span class="comment">/* Look for an existing link between "from" and "to" nodes */</span>
<a name="l00071"></a>00071 <span class="keywordflow">for</span> (fwdlink = from-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; fwdlink; fwdlink = fwdlink->next)
<a name="l00072"></a>00072 <span class="keywordflow">if</span> (fwdlink->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == to)
<a name="l00073"></a>00073 <span class="keywordflow">break</span>;
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="keywordflow">if</span> (fwdlink == NULL) {
<a name="l00076"></a>00076 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *revlink;
<a name="l00077"></a>00077 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="comment">/* No link between the two nodes; create a new one */</span>
<a name="l00080"></a>00080 link = listelem_malloc(dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a>);
<a name="l00081"></a>00081 fwdlink = listelem_malloc(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>);
<a name="l00082"></a>00082 revlink = listelem_malloc(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>);
<a name="l00083"></a>00083
<a name="l00084"></a>00084 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> = from;
<a name="l00085"></a>00085 link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> = to;
<a name="l00086"></a>00086 link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> = score;
<a name="l00087"></a>00087 link-><a class="code" href="structps__latlink__s.html#a73af187524eb6ec82ad9ae857d11edc6" title="Ending frame of this word.">ef</a> = ef;
<a name="l00088"></a>00088 link->best_prev = NULL;
<a name="l00089"></a>00089
<a name="l00090"></a>00090 fwdlink->link = revlink->link = link;
<a name="l00091"></a>00091 fwdlink->next = from-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>;
<a name="l00092"></a>00092 from-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a> = fwdlink;
<a name="l00093"></a>00093 revlink->next = to-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>;
<a name="l00094"></a>00094 to-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a> = revlink;
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096 <span class="keywordflow">else</span> {
<a name="l00097"></a>00097 <span class="comment">/* Link already exists; just retain the best ascr */</span>
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> fwdlink->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>) {
<a name="l00099"></a>00099 fwdlink->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> = score;
<a name="l00100"></a>00100 fwdlink->link-><a class="code" href="structps__latlink__s.html#a73af187524eb6ec82ad9ae857d11edc6" title="Ending frame of this word.">ef</a> = ef;
<a name="l00101"></a>00101 }
<a name="l00102"></a>00102 }
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="keywordtype">void</span>
<a name="l00106"></a><a class="code" href="ps__lattice__internal_8h.html#a9b40adaa059978fe33959d59da1b6919">00106</a> <a class="code" href="ps__lattice_8c.html#a9b40adaa059978fe33959d59da1b6919" title="Bypass filler words.">ps_lattice_bypass_fillers</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, int32 silpen, int32 fillpen)
<a name="l00107"></a>00107 {
<a name="l00108"></a>00108 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l00109"></a>00109 int32 score;
<a name="l00110"></a>00110
<a name="l00111"></a>00111 <span class="comment">/* Bypass filler nodes */</span>
<a name="l00112"></a>00112 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00113"></a>00113 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *revlink;
<a name="l00114"></a>00114 <span class="keywordflow">if</span> (node == dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a> || !dict_filler_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, node-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>))
<a name="l00115"></a>00115 <span class="keywordflow">continue</span>;
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="comment">/* Replace each link entering filler node with links to all its successors */</span>
<a name="l00118"></a>00118 <span class="keywordflow">for</span> (revlink = node-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; revlink; revlink = revlink->next) {
<a name="l00119"></a>00119 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *forlink;
<a name="l00120"></a>00120 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *rlink = revlink->link;
<a name="l00121"></a>00121
<a name="l00122"></a>00122 score = (node-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a> == dag-><a class="code" href="structps__lattice__s.html#acd3f3ab2649f649ba33bf2a422cf12b8" title="Silence word ID.">silence</a>) ? silpen : fillpen;
<a name="l00123"></a>00123 score += rlink-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>;
<a name="l00124"></a>00124 <span class="comment">/*</span>
<a name="l00125"></a>00125 <span class="comment"> * Make links from predecessor of filler (from) to successors of filler.</span>
<a name="l00126"></a>00126 <span class="comment"> * But if successor is a filler, it has already been eliminated since it</span>
<a name="l00127"></a>00127 <span class="comment"> * appears earlier in latnode_list (see build...). So it can be skipped.</span>
<a name="l00128"></a>00128 <span class="comment"> */</span>
<a name="l00129"></a>00129 <span class="keywordflow">for</span> (forlink = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; forlink; forlink = forlink->next) {
<a name="l00130"></a>00130 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *flink = forlink->link;
<a name="l00131"></a>00131 <span class="keywordflow">if</span> (flink-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> && rlink-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> &&
<a name="l00132"></a>00132 !dict_filler_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, flink-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) {
<a name="l00133"></a>00133 <a class="code" href="ps__lattice_8h.html#a4aaae70904361b23a78cdcb632c298c4" title="Create a directed link between &quot;from&quot; and &quot;to&quot; nodes, but if a link already exist...">ps_lattice_link</a>(dag, rlink-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>, flink-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>,
<a name="l00134"></a>00134 score + flink-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>, flink-><a class="code" href="structps__latlink__s.html#a73af187524eb6ec82ad9ae857d11edc6" title="Ending frame of this word.">ef</a>);
<a name="l00135"></a>00135 }
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138 node-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a> = FALSE;
<a name="l00139"></a>00139 }
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141
<a name="l00142"></a>00142 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00143"></a>00143 delete_node(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00144"></a>00144 {
<a name="l00145"></a>00145 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x, *next_x;
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = next_x) {
<a name="l00148"></a>00148 next_x = x->next;
<a name="l00149"></a>00149 x->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> = NULL;
<a name="l00150"></a>00150 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = next_x) {
<a name="l00153"></a>00153 next_x = x->next;
<a name="l00154"></a>00154 x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> = NULL;
<a name="l00155"></a>00155 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a14e4e87550647d5119cd1cc48ff4f3f1" title="Node allocator for this DAG.">latnode_alloc</a>, node);
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00162"></a>00162 remove_dangling_links(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00163"></a>00163 {
<a name="l00164"></a>00164 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x, *prev_x, *next_x;
<a name="l00165"></a>00165
<a name="l00166"></a>00166 prev_x = NULL;
<a name="l00167"></a>00167 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = next_x) {
<a name="l00168"></a>00168 next_x = x->next;
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == NULL) {
<a name="l00170"></a>00170 <span class="keywordflow">if</span> (prev_x)
<a name="l00171"></a>00171 prev_x->next = next_x;
<a name="l00172"></a>00172 <span class="keywordflow">else</span>
<a name="l00173"></a>00173 node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a> = next_x;
<a name="l00174"></a>00174 listelem_free(dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a>, x->link);
<a name="l00175"></a>00175 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177 <span class="keywordflow">else</span>
<a name="l00178"></a>00178 prev_x = x;
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180 prev_x = NULL;
<a name="l00181"></a>00181 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = next_x) {
<a name="l00182"></a>00182 next_x = x->next;
<a name="l00183"></a>00183 <span class="keywordflow">if</span> (x->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> == NULL) {
<a name="l00184"></a>00184 <span class="keywordflow">if</span> (prev_x)
<a name="l00185"></a>00185 prev_x->next = next_x;
<a name="l00186"></a>00186 <span class="keywordflow">else</span>
<a name="l00187"></a>00187 node-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a> = next_x;
<a name="l00188"></a>00188 listelem_free(dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a>, x->link);
<a name="l00189"></a>00189 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191 <span class="keywordflow">else</span>
<a name="l00192"></a>00192 prev_x = x;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordtype">void</span>
<a name="l00197"></a><a class="code" href="ps__lattice__internal_8h.html#a6da4e36322aaab4d2ebe812bee9a4439">00197</a> <a class="code" href="ps__lattice_8c.html#a6da4e36322aaab4d2ebe812bee9a4439" title="Remove nodes marked as unreachable.">ps_lattice_delete_unreachable</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node, *prev_node, *next_node;
<a name="l00200"></a>00200 <span class="keywordtype">int</span> i;
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="comment">/* Remove unreachable nodes from the list of nodes. */</span>
<a name="l00203"></a>00203 prev_node = NULL;
<a name="l00204"></a>00204 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = next_node) {
<a name="l00205"></a>00205 next_node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>;
<a name="l00206"></a>00206 <span class="keywordflow">if</span> (!node-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>) {
<a name="l00207"></a>00207 <span class="keywordflow">if</span> (prev_node)
<a name="l00208"></a>00208 prev_node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a> = next_node;
<a name="l00209"></a>00209 <span class="keywordflow">else</span>
<a name="l00210"></a>00210 dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a> = next_node;
<a name="l00211"></a>00211 <span class="comment">/* Delete this node and NULLify links to it. */</span>
<a name="l00212"></a>00212 delete_node(dag, node);
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214 <span class="keywordflow">else</span>
<a name="l00215"></a>00215 prev_node = node;
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="comment">/* Remove all links to and from unreachable nodes. */</span>
<a name="l00219"></a>00219 i = 0;
<a name="l00220"></a>00220 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00221"></a>00221 <span class="comment">/* Assign sequence numbers. */</span>
<a name="l00222"></a>00222 node-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a> = i++;
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="comment">/* We should obviously not encounter unreachable nodes here! */</span>
<a name="l00225"></a>00225 assert(node-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>);
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="comment">/* Remove all links that go nowhere. */</span>
<a name="l00228"></a>00228 remove_dangling_links(dag, node);
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230 }
<a name="l00231"></a>00231
<a name="l00232"></a>00232 int32
<a name="l00233"></a><a class="code" href="ps__lattice_8c.html#a520b99eff2c1dba89927f0f3d258b8aa">00233</a> <a class="code" href="ps__lattice_8h.html#a3f2e2b88d0aa80346cc64d2b7934b863" title="Write a lattice to disk.">ps_lattice_write</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <span class="keywordtype">char</span> <span class="keyword">const</span> *filename)
<a name="l00234"></a>00234 {
<a name="l00235"></a>00235 FILE *fp;
<a name="l00236"></a>00236 int32 i;
<a name="l00237"></a>00237 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *d, *initial, *<span class="keyword">final</span>;
<a name="l00238"></a>00238
<a name="l00239"></a>00239 initial = dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>;
<a name="l00240"></a>00240 <span class="keyword">final</span> = dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>;
<a name="l00241"></a>00241
<a name="l00242"></a>00242 E_INFO(<span class="stringliteral">"Writing lattice file: %s\n"</span>, filename);
<a name="l00243"></a>00243 <span class="keywordflow">if</span> ((fp = fopen(filename, <span class="stringliteral">"w"</span>)) == NULL) {
<a name="l00244"></a>00244 E_ERROR(<span class="stringliteral">"Failed to open lattice file '%s' for writing: %s\n"</span>, filename, strerror(errno));
<a name="l00245"></a>00245 <span class="keywordflow">return</span> -1;
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="comment">/* Stupid Sphinx-III lattice code expects 'getcwd:' here */</span>
<a name="l00249"></a>00249 fprintf(fp, <span class="stringliteral">"# getcwd: /this/is/bogus\n"</span>);
<a name="l00250"></a>00250 fprintf(fp, <span class="stringliteral">"# -logbase %e\n"</span>, logmath_get_base(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>));
<a name="l00251"></a>00251 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00252"></a>00252
<a name="l00253"></a>00253 fprintf(fp, <span class="stringliteral">"Frames %d\n"</span>, dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a>);
<a name="l00254"></a>00254 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <span class="keywordflow">for</span> (i = 0, d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>, i++);
<a name="l00257"></a>00257 fprintf(fp,
<a name="l00258"></a>00258 <span class="stringliteral">"Nodes %d (NODEID WORD STARTFRAME FIRST-ENDFRAME LAST-ENDFRAME)\n"</span>,
<a name="l00259"></a>00259 i);
<a name="l00260"></a>00260 <span class="keywordflow">for</span> (i = 0, d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>, i++) {
<a name="l00261"></a>00261 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a> = i;
<a name="l00262"></a>00262 fprintf(fp, <span class="stringliteral">"%d %s %d %d %d\n"</span>,
<a name="l00263"></a>00263 i, dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>),
<a name="l00264"></a>00264 d-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>, d-><a class="code" href="structps__latnode__s.html#a584ee5a303355d851ac903718998df14" title="First end frame.">fef</a>, d-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a>);
<a name="l00265"></a>00265 }
<a name="l00266"></a>00266 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00267"></a>00267
<a name="l00268"></a>00268 fprintf(fp, <span class="stringliteral">"Initial %d\nFinal %d\n"</span>, initial-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>, final->id);
<a name="l00269"></a>00269 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="comment">/* Don't bother with this, it's not used by anything. */</span>
<a name="l00272"></a>00272 fprintf(fp, <span class="stringliteral">"BestSegAscr %d (NODEID ENDFRAME ASCORE)\n"</span>,
<a name="l00273"></a>00273 0 <span class="comment">/* #BPTable entries */</span> );
<a name="l00274"></a>00274 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00275"></a>00275
<a name="l00276"></a>00276 fprintf(fp, <span class="stringliteral">"Edges (FROM-NODEID TO-NODEID ASCORE)\n"</span>);
<a name="l00277"></a>00277 <span class="keywordflow">for</span> (d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00278"></a>00278 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *l;
<a name="l00279"></a>00279 <span class="keywordflow">for</span> (l = d-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; l; l = l->next) {
<a name="l00280"></a>00280 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a> || l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> 0)
<a name="l00281"></a>00281 <span class="keywordflow">continue</span>;
<a name="l00282"></a>00282 fprintf(fp, <span class="stringliteral">"%d %d %d\n"</span>,
<a name="l00283"></a>00283 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>, l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>, l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>);
<a name="l00284"></a>00284 }
<a name="l00285"></a>00285 }
<a name="l00286"></a>00286 fprintf(fp, <span class="stringliteral">"End\n"</span>);
<a name="l00287"></a>00287 fclose(fp);
<a name="l00288"></a>00288
<a name="l00289"></a>00289 <span class="keywordflow">return</span> 0;
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292 int32
<a name="l00293"></a><a class="code" href="ps__lattice_8c.html#a1ac6d846fbecfcaba6094d84e93655f7">00293</a> <a class="code" href="ps__lattice_8h.html#aefd25c0f49a0d70f999187a26fa2ff06" title="Write a lattice to disk in HTK format.">ps_lattice_write_htk</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <span class="keywordtype">char</span> <span class="keyword">const</span> *filename)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 FILE *fp;
<a name="l00296"></a>00296 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *d, *initial, *<span class="keyword">final</span>;
<a name="l00297"></a>00297 int32 i, j, n_links, n_nodes;
<a name="l00298"></a>00298
<a name="l00299"></a>00299 initial = dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>;
<a name="l00300"></a>00300 <span class="keyword">final</span> = dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>;
<a name="l00301"></a>00301
<a name="l00302"></a>00302 E_INFO(<span class="stringliteral">"Writing lattice file: %s\n"</span>, filename);
<a name="l00303"></a>00303 <span class="keywordflow">if</span> ((fp = fopen(filename, <span class="stringliteral">"w"</span>)) == NULL) {
<a name="l00304"></a>00304 E_ERROR(<span class="stringliteral">"Failed to open lattice file '%s' for writing: %s\n"</span>, filename, strerror(errno));
<a name="l00305"></a>00305 <span class="keywordflow">return</span> -1;
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307
<a name="l00308"></a>00308 <span class="keywordflow">for</span> (n_links = n_nodes = 0, d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00309"></a>00309 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *l;
<a name="l00310"></a>00310 <span class="keywordflow">if</span> (!d-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00311"></a>00311 <span class="keywordflow">continue</span>;
<a name="l00312"></a>00312 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a> = n_nodes;
<a name="l00313"></a>00313 <span class="keywordflow">for</span> (l = d-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; l; l = l->next) {
<a name="l00314"></a>00314 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == NULL || !l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00315"></a>00315 <span class="keywordflow">continue</span>;
<a name="l00316"></a>00316 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a> || l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> 0)
<a name="l00317"></a>00317 <span class="keywordflow">continue</span>;
<a name="l00318"></a>00318 ++n_links;
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320 ++n_nodes;
<a name="l00321"></a>00321 }
<a name="l00322"></a>00322
<a name="l00323"></a>00323 fprintf(fp, <span class="stringliteral">"# Lattice generated by PocketSphinx\n"</span>);
<a name="l00324"></a>00324 fprintf(fp, <span class="stringliteral">"#\n# Header\n#\n"</span>);
<a name="l00325"></a>00325 fprintf(fp, <span class="stringliteral">"VERSION=1.0\n"</span>);
<a name="l00326"></a>00326 fprintf(fp, <span class="stringliteral">"start=%d\n"</span>, initial-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>);
<a name="l00327"></a>00327 fprintf(fp, <span class="stringliteral">"end=%d\n"</span>, final->id);
<a name="l00328"></a>00328 fprintf(fp, <span class="stringliteral">"#\n"</span>);
<a name="l00329"></a>00329
<a name="l00330"></a>00330 fprintf(fp, <span class="stringliteral">"N=%d\tL=%d\n"</span>, n_nodes, n_links);
<a name="l00331"></a>00331 fprintf(fp, <span class="stringliteral">"#\n# Node definitions\n#\n"</span>);
<a name="l00332"></a>00332 <span class="keywordflow">for</span> (i = 0, d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00333"></a>00333 <span class="keywordtype">char</span> <span class="keyword">const</span> *word = dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l00334"></a>00334 <span class="keywordtype">char</span> <span class="keyword">const</span> *c = strrchr(word, <span class="charliteral">'('</span>);
<a name="l00335"></a>00335 <span class="keywordtype">int</span> altpron = 1;
<a name="l00336"></a>00336 <span class="keywordflow">if</span> (!d-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00337"></a>00337 <span class="keywordflow">continue</span>;
<a name="l00338"></a>00338 <span class="keywordflow">if</span> (c)
<a name="l00339"></a>00339 altpron = atoi(c + 1);
<a name="l00340"></a>00340 word = dict_basestr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l00341"></a>00341 <span class="keywordflow">if</span> (d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a> == dict_startwid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>))
<a name="l00342"></a>00342 word = <span class="stringliteral">"!SENT_START"</span>;
<a name="l00343"></a>00343 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a> == dict_finishwid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>))
<a name="l00344"></a>00344 word = <span class="stringliteral">"!SENT_END"</span>;
<a name="l00345"></a>00345 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (dict_filler_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>))
<a name="l00346"></a>00346 word = <span class="stringliteral">"!NULL"</span>;
<a name="l00347"></a>00347 fprintf(fp, <span class="stringliteral">"I=%d\tt=%.2f\tW=%s\tv=%d\n"</span>,
<a name="l00348"></a>00348 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>, (<span class="keywordtype">double</span>)d-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> / dag-><a class="code" href="structps__lattice__s.html#a5159a2ff1e03a7c9782854bc67e56530" title="Frame rate.">frate</a>,
<a name="l00349"></a>00349 word, altpron);
<a name="l00350"></a>00350 }
<a name="l00351"></a>00351 fprintf(fp, <span class="stringliteral">"#\n# Link definitions\n#\n"</span>);
<a name="l00352"></a>00352 <span class="keywordflow">for</span> (j = 0, d = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; d; d = d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l00353"></a>00353 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *l;
<a name="l00354"></a>00354 <span class="keywordflow">if</span> (!d-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00355"></a>00355 <span class="keywordflow">continue</span>;
<a name="l00356"></a>00356 <span class="keywordflow">for</span> (l = d-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; l; l = l->next) {
<a name="l00357"></a>00357 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == NULL || !l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00358"></a>00358 <span class="keywordflow">continue</span>;
<a name="l00359"></a>00359 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a> || l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> 0)
<a name="l00360"></a>00360 <span class="keywordflow">continue</span>;
<a name="l00361"></a>00361 fprintf(fp, <span class="stringliteral">"J=%d\tS=%d\tE=%d\ta=%f\tp=%g\n"</span>, j++,
<a name="l00362"></a>00362 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>, l->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a>,
<a name="l00363"></a>00363 logmath_log_to_ln(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>, l->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>),
<a name="l00364"></a>00364 logmath_exp(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>, l->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + l->link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>));
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366 }
<a name="l00367"></a>00367 fclose(fp);
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="keywordflow">return</span> 0;
<a name="l00370"></a>00370 }
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="comment">/* Read parameter from a lattice file*/</span>
<a name="l00373"></a>00373 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00374"></a>00374 dag_param_read(lineiter_t *li, <span class="keywordtype">char</span> *param)
<a name="l00375"></a>00375 {
<a name="l00376"></a>00376 int32 n;
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="keywordflow">while</span> ((li = lineiter_next(li)) != NULL) {
<a name="l00379"></a>00379 <span class="keywordtype">char</span> *c;
<a name="l00380"></a>00380
<a name="l00381"></a>00381 <span class="comment">/* Ignore comments. */</span>
<a name="l00382"></a>00382 <span class="keywordflow">if</span> (li->buf[0] == <span class="charliteral">'#'</span>)
<a name="l00383"></a>00383 <span class="keywordflow">continue</span>;
<a name="l00384"></a>00384
<a name="l00385"></a>00385 <span class="comment">/* Find the first space. */</span>
<a name="l00386"></a>00386 c = strchr(li->buf, <span class="charliteral">' '</span>);
<a name="l00387"></a>00387 <span class="keywordflow">if</span> (c == NULL) <span class="keywordflow">continue</span>;
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="comment">/* Check that the first field equals param and that there's a number after it. */</span>
<a name="l00390"></a>00390 <span class="keywordflow">if</span> (strncmp(li->buf, param, strlen(param)) == 0
<a name="l00391"></a>00391 && sscanf(c + 1, <span class="stringliteral">"%d"</span>, &n) == 1)
<a name="l00392"></a>00392 <span class="keywordflow">return</span> n;
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394 <span class="keywordflow">return</span> -1;
<a name="l00395"></a>00395 }
<a name="l00396"></a>00396
<a name="l00397"></a>00397 <span class="comment">/* Mark every node that has a path to the argument dagnode as "reachable". */</span>
<a name="l00398"></a>00398 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00399"></a>00399 dag_mark_reachable(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> * d)
<a name="l00400"></a>00400 {
<a name="l00401"></a>00401 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *l;
<a name="l00402"></a>00402
<a name="l00403"></a>00403 d-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a> = 1;
<a name="l00404"></a>00404 <span class="keywordflow">for</span> (l = d-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; l; l = l->next)
<a name="l00405"></a>00405 <span class="keywordflow">if</span> (l->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> && !l->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a>)
<a name="l00406"></a>00406 dag_mark_reachable(l->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>);
<a name="l00407"></a>00407 }
<a name="l00408"></a>00408
<a name="l00409"></a>00409 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *
<a name="l00410"></a><a class="code" href="ps__lattice_8c.html#aaf4a101f324943c7635746ec6ba7ab06">00410</a> <a class="code" href="ps__lattice_8h.html#a26f4a34c81b112109621b7ecacd57ee0" title="Read a lattice from a file on disk.">ps_lattice_read</a>(<a class="code" href="structps__decoder__s.html" title="Decoder object.">ps_decoder_t</a> *ps,
<a name="l00411"></a>00411 <span class="keywordtype">char</span> <span class="keyword">const</span> *file)
<a name="l00412"></a>00412 {
<a name="l00413"></a>00413 FILE *fp;
<a name="l00414"></a>00414 int32 ispipe;
<a name="l00415"></a>00415 lineiter_t *line;
<a name="l00416"></a>00416 float64 lb;
<a name="l00417"></a>00417 float32 logratio;
<a name="l00418"></a>00418 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *tail;
<a name="l00419"></a>00419 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> **darray;
<a name="l00420"></a>00420 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l00421"></a>00421 <span class="keywordtype">int</span> i, k, n_nodes;
<a name="l00422"></a>00422 int32 pip, silpen, fillpen;
<a name="l00423"></a>00423
<a name="l00424"></a>00424 dag = ckd_calloc(1, <span class="keyword">sizeof</span>(*dag));
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <span class="keywordflow">if</span> (ps) {
<a name="l00427"></a>00427 dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a> = ps-><a class="code" href="structps__decoder__s.html#ad337270efc93613cf8dd7594f6515799" title="Currently active search module.">search</a>;
<a name="l00428"></a>00428 dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a> = dict_retain(ps-><a class="code" href="structps__decoder__s.html#aef6228c17907cc1d0cef835b238b5d91" title="Pronunciation dictionary.">dict</a>);
<a name="l00429"></a>00429 dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a> = logmath_retain(ps-><a class="code" href="structps__decoder__s.html#abd17fe329f2fb219c5a534f3217c5b95" title="Log math computation.">lmath</a>);
<a name="l00430"></a>00430 dag-><a class="code" href="structps__lattice__s.html#a5159a2ff1e03a7c9782854bc67e56530" title="Frame rate.">frate</a> = cmd_ln_int32_r(dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>-><a class="code" href="structps__search__s.html#aa6e3e18165bbc70084a06575d5703042" title="Configuration.">config</a>, <span class="stringliteral">"-frate"</span>);
<a name="l00431"></a>00431 }
<a name="l00432"></a>00432 <span class="keywordflow">else</span> {
<a name="l00433"></a>00433 dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a> = dict_init(NULL, NULL);
<a name="l00434"></a>00434 dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a> = logmath_init(1.0001, 0, FALSE);
<a name="l00435"></a>00435 dag-><a class="code" href="structps__lattice__s.html#a5159a2ff1e03a7c9782854bc67e56530" title="Frame rate.">frate</a> = 100;
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437 dag-><a class="code" href="structps__lattice__s.html#acd3f3ab2649f649ba33bf2a422cf12b8" title="Silence word ID.">silence</a> = dict_silwid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>);
<a name="l00438"></a>00438 dag-><a class="code" href="structps__lattice__s.html#a14e4e87550647d5119cd1cc48ff4f3f1" title="Node allocator for this DAG.">latnode_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a>));
<a name="l00439"></a>00439 dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a>));
<a name="l00440"></a>00440 dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a>));
<a name="l00441"></a>00441 dag-><a class="code" href="structps__lattice__s.html#a6d66b392dec016b3304da2f53be17dd1" title="Reference count.">refcount</a> = 1;
<a name="l00442"></a>00442
<a name="l00443"></a>00443 tail = NULL;
<a name="l00444"></a>00444 darray = NULL;
<a name="l00445"></a>00445
<a name="l00446"></a>00446 E_INFO(<span class="stringliteral">"Reading DAG file: %s\n"</span>, file);
<a name="l00447"></a>00447 <span class="keywordflow">if</span> ((fp = fopen_compchk(file, &ispipe)) == NULL) {
<a name="l00448"></a>00448 E_ERROR(<span class="stringliteral">"Failed to open DAG file '%s': %s\n"</span>, file, strerror(errno));
<a name="l00449"></a>00449 <span class="keywordflow">return</span> NULL;
<a name="l00450"></a>00450 }
<a name="l00451"></a>00451 line = lineiter_start(fp);
<a name="l00452"></a>00452
<a name="l00453"></a>00453 <span class="comment">/* Read and verify logbase (ONE BIG HACK!!) */</span>
<a name="l00454"></a>00454 <span class="keywordflow">if</span> (line == NULL) {
<a name="l00455"></a>00455 E_ERROR(<span class="stringliteral">"Premature EOF(%s)\n"</span>, file);
<a name="l00456"></a>00456 <span class="keywordflow">goto</span> load_error;
<a name="l00457"></a>00457 }
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (strncmp(line->buf, <span class="stringliteral">"# getcwd: "</span>, 10) != 0) {
<a name="l00459"></a>00459 E_ERROR(<span class="stringliteral">"%s does not begin with '# getcwd: '\n%s"</span>, file, line->buf);
<a name="l00460"></a>00460 <span class="keywordflow">goto</span> load_error;
<a name="l00461"></a>00461 }
<a name="l00462"></a>00462 <span class="keywordflow">if</span> ((line = lineiter_next(line)) == NULL) {
<a name="l00463"></a>00463 E_ERROR(<span class="stringliteral">"Premature EOF(%s)\n"</span>, file);
<a name="l00464"></a>00464 <span class="keywordflow">goto</span> load_error;
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466 <span class="keywordflow">if</span> ((strncmp(line->buf, <span class="stringliteral">"# -logbase "</span>, 11) != 0)
<a name="l00467"></a>00467 || (sscanf(line->buf + 11, <span class="stringliteral">"%lf"</span>, &lb) != 1)) {
<a name="l00468"></a>00468 E_WARN(<span class="stringliteral">"%s: Cannot find -logbase in header\n"</span>, file);
<a name="l00469"></a>00469 lb = 1.0001;
<a name="l00470"></a>00470 }
<a name="l00471"></a>00471 logratio = 1.0f;
<a name="l00472"></a>00472 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a> == NULL)
<a name="l00473"></a>00473 dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a> = logmath_init(lb, 0, TRUE);
<a name="l00474"></a>00474 <span class="keywordflow">else</span> {
<a name="l00475"></a>00475 float32 pb = logmath_get_base(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>);
<a name="l00476"></a>00476 <span class="keywordflow">if</span> (fabs(lb - pb) >= 0.0001) {
<a name="l00477"></a>00477 E_WARN(<span class="stringliteral">"Inconsistent logbases: %f vs %f: will compensate\n"</span>, lb, pb);
<a name="l00478"></a>00478 logratio = (float32)(log(lb) / log(pb));
<a name="l00479"></a>00479 E_INFO(<span class="stringliteral">"Lattice log ratio: %f\n"</span>, logratio);
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481 }
<a name="l00482"></a>00482 <span class="comment">/* Read Frames parameter */</span>
<a name="l00483"></a>00483 dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a> = dag_param_read(line, <span class="stringliteral">"Frames"</span>);
<a name="l00484"></a>00484 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a> <= 0) {
<a name="l00485"></a>00485 E_ERROR(<span class="stringliteral">"Frames parameter missing or invalid\n"</span>);
<a name="l00486"></a>00486 <span class="keywordflow">goto</span> load_error;
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488 <span class="comment">/* Read Nodes parameter */</span>
<a name="l00489"></a>00489 n_nodes = dag_param_read(line, <span class="stringliteral">"Nodes"</span>);
<a name="l00490"></a>00490 <span class="keywordflow">if</span> (n_nodes <= 0) {
<a name="l00491"></a>00491 E_ERROR(<span class="stringliteral">"Nodes parameter missing or invalid\n"</span>);
<a name="l00492"></a>00492 <span class="keywordflow">goto</span> load_error;
<a name="l00493"></a>00493 }
<a name="l00494"></a>00494
<a name="l00495"></a>00495 <span class="comment">/* Read nodes */</span>
<a name="l00496"></a>00496 darray = ckd_calloc(n_nodes, <span class="keyword">sizeof</span>(*darray));
<a name="l00497"></a>00497 <span class="keywordflow">for</span> (i = 0; i < n_nodes; i++) {
<a name="l00498"></a>00498 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *d;
<a name="l00499"></a>00499 int32 w;
<a name="l00500"></a>00500 <span class="keywordtype">int</span> seqid, sf, fef, lef;
<a name="l00501"></a>00501 <span class="keywordtype">char</span> wd[256];
<a name="l00502"></a>00502
<a name="l00503"></a>00503 <span class="keywordflow">if</span> ((line = lineiter_next(line)) == NULL) {
<a name="l00504"></a>00504 E_ERROR(<span class="stringliteral">"Premature EOF while loading Nodes(%s)\n"</span>, file);
<a name="l00505"></a>00505 <span class="keywordflow">goto</span> load_error;
<a name="l00506"></a>00506 }
<a name="l00507"></a>00507
<a name="l00508"></a>00508 <span class="keywordflow">if</span> ((k =
<a name="l00509"></a>00509 sscanf(line->buf, <span class="stringliteral">"%d %255s %d %d %d"</span>, &seqid, wd, &sf, &fef,
<a name="l00510"></a>00510 &lef)) != 5) {
<a name="l00511"></a>00511 E_ERROR(<span class="stringliteral">"Cannot parse line: %s, value of count %d\n"</span>, line->buf, k);
<a name="l00512"></a>00512 <span class="keywordflow">goto</span> load_error;
<a name="l00513"></a>00513 }
<a name="l00514"></a>00514
<a name="l00515"></a>00515 w = dict_wordid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, wd);
<a name="l00516"></a>00516 <span class="keywordflow">if</span> (w < 0) {
<a name="l00517"></a>00517 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a> == NULL) {
<a name="l00518"></a>00518 <span class="keywordtype">char</span> *ww = ckd_salloc(wd);
<a name="l00519"></a>00519 <span class="keywordflow">if</span> (dict_word2basestr(ww) != -1) {
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (dict_wordid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, ww) == <a class="code" href="s3types_8h.html#a5c42410b7125da611210c5a4be29898b" title="Dictionary word id.">BAD_S3WID</a>)
<a name="l00521"></a>00521 dict_add_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, ww, NULL, 0);
<a name="l00522"></a>00522 }
<a name="l00523"></a>00523 ckd_free(ww);
<a name="l00524"></a>00524 w = dict_add_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, wd, NULL, 0);
<a name="l00525"></a>00525 }
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (w < 0) {
<a name="l00527"></a>00527 E_ERROR(<span class="stringliteral">"Unknown word in line: %s\n"</span>, line->buf);
<a name="l00528"></a>00528 <span class="keywordflow">goto</span> load_error;
<a name="l00529"></a>00529 }
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531
<a name="l00532"></a>00532 <span class="keywordflow">if</span> (seqid != i) {
<a name="l00533"></a>00533 E_ERROR(<span class="stringliteral">"Seqno error: %s\n"</span>, line->buf);
<a name="l00534"></a>00534 <span class="keywordflow">goto</span> load_error;
<a name="l00535"></a>00535 }
<a name="l00536"></a>00536
<a name="l00537"></a>00537 d = listelem_malloc(dag-><a class="code" href="structps__lattice__s.html#a14e4e87550647d5119cd1cc48ff4f3f1" title="Node allocator for this DAG.">latnode_alloc</a>);
<a name="l00538"></a>00538 darray[i] = d;
<a name="l00539"></a>00539 d-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a> = w;
<a name="l00540"></a>00540 d-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a> = dict_basewid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, w);
<a name="l00541"></a>00541 d-><a class="code" href="structps__latnode__s.html#a78243b37753f7a209c15d6adf98ee3f7" title="Unique id for this node.">id</a> = seqid;
<a name="l00542"></a>00542 d-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> = sf;
<a name="l00543"></a>00543 d-><a class="code" href="structps__latnode__s.html#a584ee5a303355d851ac903718998df14" title="First end frame.">fef</a> = fef;
<a name="l00544"></a>00544 d-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a> = lef;
<a name="l00545"></a>00545 d-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a> = 0;
<a name="l00546"></a>00546 d-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a> = d-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a> = NULL;
<a name="l00547"></a>00547 d-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a> = NULL;
<a name="l00548"></a>00548
<a name="l00549"></a>00549 <span class="keywordflow">if</span> (!dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>)
<a name="l00550"></a>00550 dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a> = d;
<a name="l00551"></a>00551 <span class="keywordflow">else</span>
<a name="l00552"></a>00552 tail-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a> = d;
<a name="l00553"></a>00553 tail = d;
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555
<a name="l00556"></a>00556 <span class="comment">/* Read initial node ID */</span>
<a name="l00557"></a>00557 k = dag_param_read(line, <span class="stringliteral">"Initial"</span>);
<a name="l00558"></a>00558 <span class="keywordflow">if</span> ((k < 0) || (k >= n_nodes)) {
<a name="l00559"></a>00559 E_ERROR(<span class="stringliteral">"Initial node parameter missing or invalid\n"</span>);
<a name="l00560"></a>00560 <span class="keywordflow">goto</span> load_error;
<a name="l00561"></a>00561 }
<a name="l00562"></a>00562 dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a> = darray[k];
<a name="l00563"></a>00563
<a name="l00564"></a>00564 <span class="comment">/* Read final node ID */</span>
<a name="l00565"></a>00565 k = dag_param_read(line, <span class="stringliteral">"Final"</span>);
<a name="l00566"></a>00566 <span class="keywordflow">if</span> ((k < 0) || (k >= n_nodes)) {
<a name="l00567"></a>00567 E_ERROR(<span class="stringliteral">"Final node parameter missing or invalid\n"</span>);
<a name="l00568"></a>00568 <span class="keywordflow">goto</span> load_error;
<a name="l00569"></a>00569 }
<a name="l00570"></a>00570 dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a> = darray[k];
<a name="l00571"></a>00571
<a name="l00572"></a>00572 <span class="comment">/* Read bestsegscore entries and ignore them. */</span>
<a name="l00573"></a>00573 <span class="keywordflow">if</span> ((k = dag_param_read(line, <span class="stringliteral">"BestSegAscr"</span>)) < 0) {
<a name="l00574"></a>00574 E_ERROR(<span class="stringliteral">"BestSegAscr parameter missing\n"</span>);
<a name="l00575"></a>00575 <span class="keywordflow">goto</span> load_error;
<a name="l00576"></a>00576 }
<a name="l00577"></a>00577 <span class="keywordflow">for</span> (i = 0; i < k; i++) {
<a name="l00578"></a>00578 <span class="keywordflow">if</span> ((line = lineiter_next(line)) == NULL) {
<a name="l00579"></a>00579 E_ERROR(<span class="stringliteral">"Premature EOF while (%s) ignoring BestSegAscr\n"</span>,
<a name="l00580"></a>00580 line);
<a name="l00581"></a>00581 <span class="keywordflow">goto</span> load_error;
<a name="l00582"></a>00582 }
<a name="l00583"></a>00583 }
<a name="l00584"></a>00584
<a name="l00585"></a>00585 <span class="comment">/* Read in edges. */</span>
<a name="l00586"></a>00586 <span class="keywordflow">while</span> ((line = lineiter_next(line)) != NULL) {
<a name="l00587"></a>00587 <span class="keywordflow">if</span> (line->buf[0] == <span class="charliteral">'#'</span>)
<a name="l00588"></a>00588 <span class="keywordflow">continue</span>;
<a name="l00589"></a>00589 <span class="keywordflow">if</span> (0 == strncmp(line->buf, <span class="stringliteral">"Edges"</span>, 5))
<a name="l00590"></a>00590 <span class="keywordflow">break</span>;
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592 <span class="keywordflow">if</span> (line == NULL) {
<a name="l00593"></a>00593 E_ERROR(<span class="stringliteral">"Edges missing\n"</span>);
<a name="l00594"></a>00594 <span class="keywordflow">goto</span> load_error;
<a name="l00595"></a>00595 }
<a name="l00596"></a>00596 <span class="keywordflow">while</span> ((line = lineiter_next(line)) != NULL) {
<a name="l00597"></a>00597 <span class="keywordtype">int</span> from, to, ascr;
<a name="l00598"></a>00598 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *pd, *d;
<a name="l00599"></a>00599
<a name="l00600"></a>00600 <span class="keywordflow">if</span> (sscanf(line->buf, <span class="stringliteral">"%d %d %d"</span>, &from, &to, &ascr) != 3)
<a name="l00601"></a>00601 <span class="keywordflow">break</span>;
<a name="l00602"></a>00602 <span class="keywordflow">if</span> (ascr <a class="code" href="hmm_8h.html#aa930fb8fb6fce7f34bcf4018b81d7066" title="Is one score worse than another?">WORSE_THAN</a> <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>)
<a name="l00603"></a>00603 <span class="keywordflow">continue</span>;
<a name="l00604"></a>00604 pd = darray[from];
<a name="l00605"></a>00605 d = darray[to];
<a name="l00606"></a>00606 <span class="keywordflow">if</span> (logratio != 1.0f)
<a name="l00607"></a>00607 ascr = (int32)(ascr * logratio);
<a name="l00608"></a>00608 <a class="code" href="ps__lattice_8h.html#a4aaae70904361b23a78cdcb632c298c4" title="Create a directed link between &quot;from&quot; and &quot;to&quot; nodes, but if a link already exist...">ps_lattice_link</a>(dag, pd, d, ascr, d-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> - 1);
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610 <span class="keywordflow">if</span> (strcmp(line->buf, <span class="stringliteral">"End\n"</span>) != 0) {
<a name="l00611"></a>00611 E_ERROR(<span class="stringliteral">"Terminating 'End' missing\n"</span>);
<a name="l00612"></a>00612 <span class="keywordflow">goto</span> load_error;
<a name="l00613"></a>00613 }
<a name="l00614"></a>00614 lineiter_free(line);
<a name="l00615"></a>00615 fclose_comp(fp, ispipe);
<a name="l00616"></a>00616 ckd_free(darray);
<a name="l00617"></a>00617
<a name="l00618"></a>00618 <span class="comment">/* Minor hack: If the final node is a filler word and not </s>,</span>
<a name="l00619"></a>00619 <span class="comment"> * then set its base word ID to </s>, so that the language model</span>
<a name="l00620"></a>00620 <span class="comment"> * scores won't be screwed up. */</span>
<a name="l00621"></a>00621 <span class="keywordflow">if</span> (dict_filler_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>))
<a name="l00622"></a>00622 dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a> = dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>
<a name="l00623"></a>00623 ? ps_search_finish_wid(dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>)
<a name="l00624"></a>00624 : dict_wordid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, S3_FINISH_WORD);
<a name="l00625"></a>00625
<a name="l00626"></a>00626 <span class="comment">/* Mark reachable from dag->end */</span>
<a name="l00627"></a>00627 dag_mark_reachable(dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>);
<a name="l00628"></a>00628
<a name="l00629"></a>00629 <span class="comment">/* Free nodes unreachable from dag->end and their links */</span>
<a name="l00630"></a>00630 <a class="code" href="ps__lattice_8c.html#a6da4e36322aaab4d2ebe812bee9a4439" title="Remove nodes marked as unreachable.">ps_lattice_delete_unreachable</a>(dag);
<a name="l00631"></a>00631
<a name="l00632"></a>00632 <span class="keywordflow">if</span> (ps) {
<a name="l00633"></a>00633 <span class="comment">/* Build links around silence and filler words, since they do</span>
<a name="l00634"></a>00634 <span class="comment"> * not exist in the language model. FIXME: This is</span>
<a name="l00635"></a>00635 <span class="comment"> * potentially buggy, as we already do this before outputing</span>
<a name="l00636"></a>00636 <span class="comment"> * lattices. */</span>
<a name="l00637"></a>00637 pip = logmath_log(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>, cmd_ln_float32_r(ps-><a class="code" href="structps__decoder__s.html#a0565ed97b32408bd05c8104f020cef05" title="Configuration.">config</a>, <span class="stringliteral">"-pip"</span>));
<a name="l00638"></a>00638 silpen = pip + logmath_log(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>,
<a name="l00639"></a>00639 cmd_ln_float32_r(ps-><a class="code" href="structps__decoder__s.html#a0565ed97b32408bd05c8104f020cef05" title="Configuration.">config</a>, <span class="stringliteral">"-silprob"</span>));
<a name="l00640"></a>00640 fillpen = pip + logmath_log(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>,
<a name="l00641"></a>00641 cmd_ln_float32_r(ps-><a class="code" href="structps__decoder__s.html#a0565ed97b32408bd05c8104f020cef05" title="Configuration.">config</a>, <span class="stringliteral">"-fillprob"</span>));
<a name="l00642"></a>00642 <a class="code" href="ps__lattice_8c.html#a9b40adaa059978fe33959d59da1b6919" title="Bypass filler words.">ps_lattice_bypass_fillers</a>(dag, silpen, fillpen);
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644
<a name="l00645"></a>00645 <span class="keywordflow">return</span> dag;
<a name="l00646"></a>00646
<a name="l00647"></a>00647 load_error:
<a name="l00648"></a>00648 E_ERROR(<span class="stringliteral">"Failed to load %s\n"</span>, file);
<a name="l00649"></a>00649 lineiter_free(line);
<a name="l00650"></a>00650 <span class="keywordflow">if</span> (fp) fclose_comp(fp, ispipe);
<a name="l00651"></a>00651 ckd_free(darray);
<a name="l00652"></a>00652 <span class="keywordflow">return</span> NULL;
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654
<a name="l00655"></a>00655 <span class="keywordtype">int</span>
<a name="l00656"></a><a class="code" href="ps__lattice_8c.html#a60b5a6a96a68e9b778dbef2156d859c8">00656</a> <a class="code" href="ps__lattice_8h.html#a44a196a35a8aeb044251c6c152034c90" title="Get the number of frames in the lattice.">ps_lattice_n_frames</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00657"></a>00657 {
<a name="l00658"></a>00658 <span class="keywordflow">return</span> dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a>;
<a name="l00659"></a>00659 }
<a name="l00660"></a>00660
<a name="l00661"></a>00661 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *
<a name="l00662"></a><a class="code" href="ps__lattice__internal_8h.html#a606f6ee0fd569dd5829d7f84ae7e61bd">00662</a> <a class="code" href="ps__lattice_8c.html#a606f6ee0fd569dd5829d7f84ae7e61bd" title="Construct an empty word graph with reference to a search structure.">ps_lattice_init_search</a>(<a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *search, <span class="keywordtype">int</span> n_frame)
<a name="l00663"></a>00663 {
<a name="l00664"></a>00664 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l00665"></a>00665
<a name="l00666"></a>00666 dag = ckd_calloc(1, <span class="keyword">sizeof</span>(*dag));
<a name="l00667"></a>00667 dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a> = search;
<a name="l00668"></a>00668 dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a> = dict_retain(search-><a class="code" href="structps__search__s.html#a918f243fa966e72c47f697fb9e60089d" title="Pronunciation dictionary.">dict</a>);
<a name="l00669"></a>00669 dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a> = logmath_retain(search-><a class="code" href="structps__search__s.html#a0fdf6fe8c4d9c28f10c48c09517c6b91" title="Acoustic model.">acmod</a>-><a class="code" href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c" title="Log-math computation.">lmath</a>);
<a name="l00670"></a>00670 dag-><a class="code" href="structps__lattice__s.html#a5159a2ff1e03a7c9782854bc67e56530" title="Frame rate.">frate</a> = cmd_ln_int32_r(dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>-><a class="code" href="structps__search__s.html#aa6e3e18165bbc70084a06575d5703042" title="Configuration.">config</a>, <span class="stringliteral">"-frate"</span>);
<a name="l00671"></a>00671 dag-><a class="code" href="structps__lattice__s.html#acd3f3ab2649f649ba33bf2a422cf12b8" title="Silence word ID.">silence</a> = dict_silwid(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>);
<a name="l00672"></a>00672 dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a> = n_frame;
<a name="l00673"></a>00673 dag-><a class="code" href="structps__lattice__s.html#a14e4e87550647d5119cd1cc48ff4f3f1" title="Node allocator for this DAG.">latnode_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a>));
<a name="l00674"></a>00674 dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a>));
<a name="l00675"></a>00675 dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a>));
<a name="l00676"></a>00676 dag-><a class="code" href="structps__lattice__s.html#a6d66b392dec016b3304da2f53be17dd1" title="Reference count.">refcount</a> = 1;
<a name="l00677"></a>00677 <span class="keywordflow">return</span> dag;
<a name="l00678"></a>00678 }
<a name="l00679"></a>00679
<a name="l00680"></a>00680 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *
<a name="l00681"></a><a class="code" href="ps__lattice_8c.html#af8a33c587f5b7a6f5b8c86e6068dc297">00681</a> <a class="code" href="ps__lattice_8h.html#a9efc5f2836e2a0bd5d58326303516df5" title="Retain a lattice.">ps_lattice_retain</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683 ++dag-><a class="code" href="structps__lattice__s.html#a6d66b392dec016b3304da2f53be17dd1" title="Reference count.">refcount</a>;
<a name="l00684"></a>00684 <span class="keywordflow">return</span> dag;
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686
<a name="l00687"></a>00687 <span class="keywordtype">int</span>
<a name="l00688"></a><a class="code" href="ps__lattice_8c.html#aed9371a246b6565a2142c3baefd08002">00688</a> <a class="code" href="ps__lattice_8h.html#a3f90e846bde47cd1acdff165b92f5c22" title="Free a lattice.">ps_lattice_free</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00689"></a>00689 {
<a name="l00690"></a>00690 <span class="keywordflow">if</span> (dag == NULL)
<a name="l00691"></a>00691 <span class="keywordflow">return</span> 0;
<a name="l00692"></a>00692 <span class="keywordflow">if</span> (--dag-><a class="code" href="structps__lattice__s.html#a6d66b392dec016b3304da2f53be17dd1" title="Reference count.">refcount</a> > 0)
<a name="l00693"></a>00693 <span class="keywordflow">return</span> dag-><a class="code" href="structps__lattice__s.html#a6d66b392dec016b3304da2f53be17dd1" title="Reference count.">refcount</a>;
<a name="l00694"></a>00694 logmath_free(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>);
<a name="l00695"></a>00695 listelem_alloc_free(dag-><a class="code" href="structps__lattice__s.html#a14e4e87550647d5119cd1cc48ff4f3f1" title="Node allocator for this DAG.">latnode_alloc</a>);
<a name="l00696"></a>00696 listelem_alloc_free(dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a>);
<a name="l00697"></a>00697 listelem_alloc_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>);
<a name="l00698"></a>00698 ckd_free(dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a>);
<a name="l00699"></a>00699 ckd_free(dag);
<a name="l00700"></a>00700 <span class="keywordflow">return</span> 0;
<a name="l00701"></a>00701 }
<a name="l00702"></a>00702
<a name="l00703"></a>00703 logmath_t *
<a name="l00704"></a><a class="code" href="ps__lattice_8c.html#a4a952a1cb88b833989fb39476da5fe1b">00704</a> <a class="code" href="ps__lattice_8h.html#a5c9d9171c9846c46c107bfe41a9120cf" title="Get the log-math computation object for this lattice.">ps_lattice_get_logmath</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00705"></a>00705 {
<a name="l00706"></a>00706 <span class="keywordflow">return</span> dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>;
<a name="l00707"></a>00707 }
<a name="l00708"></a>00708
<a name="l00709"></a>00709 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_iter_t</a> *
<a name="l00710"></a><a class="code" href="ps__lattice_8c.html#a607bfd65847baff33f404936c1543d16">00710</a> <a class="code" href="ps__lattice_8h.html#aaf073a0617c446aa5424513f7c1045b8" title="Start iterating over nodes in the lattice.">ps_latnode_iter</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712 <span class="keywordflow">return</span> dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>;
<a name="l00713"></a>00713 }
<a name="l00714"></a>00714
<a name="l00715"></a>00715 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_iter_t</a> *
<a name="l00716"></a><a class="code" href="ps__lattice_8c.html#a77c4bbb13e260c72ed04ad93b02fdf0e">00716</a> <a class="code" href="ps__lattice_8h.html#a48aaf30b9396b38ccaf3a1b6e9225a01" title="Move to next node in iteration.">ps_latnode_iter_next</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_iter_t</a> *itor)
<a name="l00717"></a>00717 {
<a name="l00718"></a>00718 <span class="keywordflow">return</span> itor-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>;
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="keywordtype">void</span>
<a name="l00722"></a><a class="code" href="ps__lattice_8c.html#ae1d64649785989033826329b9fcce309">00722</a> <a class="code" href="ps__lattice_8h.html#ae9a6464b83d37bfa2ce570206eff6aad" title="Stop iterating over nodes.">ps_latnode_iter_free</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_iter_t</a> *itor)
<a name="l00723"></a>00723 {
<a name="l00724"></a>00724 <span class="comment">/* Do absolutely nothing. */</span>
<a name="l00725"></a>00725 }
<a name="l00726"></a>00726
<a name="l00727"></a>00727 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *
<a name="l00728"></a><a class="code" href="ps__lattice_8c.html#a990f488a747f95bc94777a755401710d">00728</a> <a class="code" href="ps__lattice_8h.html#a591bd15a350284b938deb84242736acc" title="Get node from iterator.">ps_latnode_iter_node</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_iter_t</a> *itor)
<a name="l00729"></a>00729 {
<a name="l00730"></a>00730 <span class="keywordflow">return</span> itor;
<a name="l00731"></a>00731 }
<a name="l00732"></a>00732
<a name="l00733"></a>00733 <span class="keywordtype">int</span>
<a name="l00734"></a><a class="code" href="ps__lattice_8c.html#a89b67432447f693f787ec14460cfa2a4">00734</a> <a class="code" href="ps__lattice_8h.html#a42bd0fbfe8b0cab1a9a7e799a3fc30a2" title="Get start and end time range for a node.">ps_latnode_times</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node, int16 *out_fef, int16 *out_lef)
<a name="l00735"></a>00735 {
<a name="l00736"></a>00736 <span class="keywordflow">if</span> (out_fef) *out_fef = (int16)node-><a class="code" href="structps__latnode__s.html#a584ee5a303355d851ac903718998df14" title="First end frame.">fef</a>;
<a name="l00737"></a>00737 if (out_lef) *out_lef = (int16)node-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a>;
<a name="l00738"></a>00738 <span class="keywordflow">return</span> node-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>;
<a name="l00739"></a>00739 }
<a name="l00740"></a>00740
<a name="l00741"></a>00741 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00742"></a><a class="code" href="ps__lattice_8c.html#a5827c1004a64e7e6c5208928c28d403d">00742</a> <a class="code" href="ps__lattice_8h.html#a54888a8a7379c5c63613504b9a847ea3" title="Get word string for this node.">ps_latnode_word</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00743"></a>00743 {
<a name="l00744"></a>00744 <span class="keywordflow">return</span> dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, node-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l00745"></a>00745 }
<a name="l00746"></a>00746
<a name="l00747"></a>00747 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00748"></a><a class="code" href="ps__lattice_8c.html#a42212e56eb6e881a0ceb1b8ad029427a">00748</a> <a class="code" href="ps__lattice_8h.html#a0b3b6a843b49deab080bf1c6e99c875d" title="Get base word string for this node.">ps_latnode_baseword</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00749"></a>00749 {
<a name="l00750"></a>00750 <span class="keywordflow">return</span> dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, node-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>);
<a name="l00751"></a>00751 }
<a name="l00752"></a>00752
<a name="l00753"></a>00753 int32
<a name="l00754"></a><a class="code" href="ps__lattice_8c.html#ad9c31352fa8e6286b1221221208075e9">00754</a> <a class="code" href="ps__lattice_8h.html#a68253946c2405d7f9090de7530f33b9d" title="Get best posterior probability and associated acoustic score from a lattice node.">ps_latnode_prob</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node,
<a name="l00755"></a>00755 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> **out_link)
<a name="l00756"></a>00756 {
<a name="l00757"></a>00757 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *links;
<a name="l00758"></a>00758 int32 bestpost = logmath_get_zero(dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>);
<a name="l00759"></a>00759
<a name="l00760"></a>00760 <span class="keywordflow">for</span> (links = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; links; links = links->next) {
<a name="l00761"></a>00761 int32 post = links->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + links->link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>;
<a name="l00762"></a>00762 <span class="keywordflow">if</span> (post > bestpost) {
<a name="l00763"></a>00763 <span class="keywordflow">if</span> (out_link) *out_link = links->link;
<a name="l00764"></a>00764 bestpost = post;
<a name="l00765"></a>00765 }
<a name="l00766"></a>00766 }
<a name="l00767"></a>00767 <span class="keywordflow">return</span> bestpost;
<a name="l00768"></a>00768 }
<a name="l00769"></a>00769
<a name="l00770"></a>00770 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *
<a name="l00771"></a><a class="code" href="ps__lattice_8c.html#a6169f8a8d8b7f84596438e5bb3095bc6">00771</a> <a class="code" href="ps__lattice_8h.html#a13fb923cd41fae910457df2643e58738" title="Iterate over exits from this node.">ps_latnode_exits</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00772"></a>00772 {
<a name="l00773"></a>00773 <span class="keywordflow">return</span> node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>;
<a name="l00774"></a>00774 }
<a name="l00775"></a>00775
<a name="l00776"></a>00776 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *
<a name="l00777"></a><a class="code" href="ps__lattice_8c.html#a36f3fa1635d251b908c553153f614e22">00777</a> <a class="code" href="ps__lattice_8h.html#a16ad0cfb8d4b02f9cf90a8b52756a7f7" title="Iterate over entries to this node.">ps_latnode_entries</a>(<a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node)
<a name="l00778"></a>00778 {
<a name="l00779"></a>00779 <span class="keywordflow">return</span> node-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>;
<a name="l00780"></a>00780 }
<a name="l00781"></a>00781
<a name="l00782"></a>00782 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *
<a name="l00783"></a><a class="code" href="ps__lattice_8c.html#a6caee73548f9a6c17626e959256d721c">00783</a> <a class="code" href="ps__lattice_8h.html#af737b31c2570d321c26a79b5002f2ba7" title="Get next link from a lattice link iterator.">ps_latlink_iter_next</a>(<a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *itor)
<a name="l00784"></a>00784 {
<a name="l00785"></a>00785 <span class="keywordflow">return</span> itor->next;
<a name="l00786"></a>00786 }
<a name="l00787"></a>00787
<a name="l00788"></a>00788 <span class="keywordtype">void</span>
<a name="l00789"></a><a class="code" href="ps__lattice_8c.html#aab5953eafb2e632307259a7fc40c01e3">00789</a> <a class="code" href="ps__lattice_8h.html#aa19aaa4a38a922ff28fe071f69b8272d" title="Stop iterating over links.">ps_latlink_iter_free</a>(<a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *itor)
<a name="l00790"></a>00790 {
<a name="l00791"></a>00791 <span class="comment">/* Do absolutely nothing. */</span>
<a name="l00792"></a>00792 }
<a name="l00793"></a>00793
<a name="l00794"></a>00794 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l00795"></a><a class="code" href="ps__lattice_8c.html#a33a6c95621d4c8980a8c6b0f8af3bc67">00795</a> <a class="code" href="ps__lattice_8h.html#aec0e905415e724e6d6eed9b12c2f8584" title="Get link from iterator.">ps_latlink_iter_link</a>(<a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">ps_latlink_iter_t</a> *itor)
<a name="l00796"></a>00796 {
<a name="l00797"></a>00797 <span class="keywordflow">return</span> itor->link;
<a name="l00798"></a>00798 }
<a name="l00799"></a>00799
<a name="l00800"></a>00800 <span class="keywordtype">int</span>
<a name="l00801"></a><a class="code" href="ps__lattice_8c.html#afc4403b067467f3c74c97998f1c91886">00801</a> <a class="code" href="ps__lattice_8h.html#aef48bb18865b449e69316ed5959eae9f" title="Get start and end times from a lattice link.">ps_latlink_times</a>(<a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, int16 *out_sf)
<a name="l00802"></a>00802 {
<a name="l00803"></a>00803 <span class="keywordflow">if</span> (out_sf) {
<a name="l00804"></a>00804 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>) {
<a name="l00805"></a>00805 *out_sf = link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>;
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807 <span class="keywordflow">else</span> {
<a name="l00808"></a>00808 *out_sf = 0;
<a name="l00809"></a>00809 }
<a name="l00810"></a>00810 }
<a name="l00811"></a>00811 <span class="keywordflow">return</span> link-><a class="code" href="structps__latlink__s.html#a73af187524eb6ec82ad9ae857d11edc6" title="Ending frame of this word.">ef</a>;
<a name="l00812"></a>00812 }
<a name="l00813"></a>00813
<a name="l00814"></a>00814 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *
<a name="l00815"></a><a class="code" href="ps__lattice_8c.html#a891d9c5aa6a5cbe8631812fbd6e87e25">00815</a> <a class="code" href="ps__lattice_8h.html#a7344aa4fdb94a3a0af47901cb77185ed" title="Get destination and source nodes from a lattice link.">ps_latlink_nodes</a>(<a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> **out_src)
<a name="l00816"></a>00816 {
<a name="l00817"></a>00817 <span class="keywordflow">if</span> (out_src) *out_src = link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>;
<a name="l00818"></a>00818 <span class="keywordflow">return</span> link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>;
<a name="l00819"></a>00819 }
<a name="l00820"></a>00820
<a name="l00821"></a>00821 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00822"></a><a class="code" href="ps__lattice_8c.html#a3c765dfc290549e8f27e619269d20e5a">00822</a> <a class="code" href="ps__lattice_8h.html#a04c080f501883fe5d4c5500afb28e53a" title="Get word string from a lattice link.">ps_latlink_word</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link)
<a name="l00823"></a>00823 {
<a name="l00824"></a>00824 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> == NULL)
<a name="l00825"></a>00825 <span class="keywordflow">return</span> NULL;
<a name="l00826"></a>00826 <span class="keywordflow">return</span> dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l00827"></a>00827 }
<a name="l00828"></a>00828
<a name="l00829"></a>00829 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00830"></a><a class="code" href="ps__lattice_8c.html#a1f8f4dba5bbcf9056c5bd3e97e39839d">00830</a> <a class="code" href="ps__lattice_8h.html#a392d98f9dc8fdae7f1092dced0738a43" title="Get base word string from a lattice link.">ps_latlink_baseword</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link)
<a name="l00831"></a>00831 {
<a name="l00832"></a>00832 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> == NULL)
<a name="l00833"></a>00833 <span class="keywordflow">return</span> NULL;
<a name="l00834"></a>00834 <span class="keywordflow">return</span> dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>);
<a name="l00835"></a>00835 }
<a name="l00836"></a>00836
<a name="l00837"></a>00837 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l00838"></a><a class="code" href="ps__lattice_8c.html#a6ea04952718752806ad92773c98ac33d">00838</a> <a class="code" href="ps__lattice_8h.html#a8f37d188bd1dff70293adebdb2453ab4" title="Get predecessor link in best path.">ps_latlink_pred</a>(<a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link)
<a name="l00839"></a>00839 {
<a name="l00840"></a>00840 <span class="keywordflow">return</span> link->best_prev;
<a name="l00841"></a>00841 }
<a name="l00842"></a>00842
<a name="l00843"></a>00843 int32
<a name="l00844"></a><a class="code" href="ps__lattice_8c.html#a7025b47d1224f01fef725ffdae71becc">00844</a> <a class="code" href="ps__lattice_8h.html#aa393fbcf215acc8116e18aac2847cc59" title="Get acoustic score and posterior probability from a lattice link.">ps_latlink_prob</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, int32 *out_ascr)
<a name="l00845"></a>00845 {
<a name="l00846"></a>00846 int32 post = link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>;
<a name="l00847"></a>00847 <span class="keywordflow">if</span> (out_ascr) *out_ascr = link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00848"></a>00848 <span class="keywordflow">return</span> post;
<a name="l00849"></a>00849 }
<a name="l00850"></a>00850
<a name="l00851"></a>00851 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00852"></a><a class="code" href="ps__lattice__internal_8h.html#a02b07c009d23b852bd4db54700dfac5b">00852</a> <a class="code" href="ps__lattice_8c.html#a02b07c009d23b852bd4db54700dfac5b" title="Get hypothesis string after bestpath search.">ps_lattice_hyp</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link)
<a name="l00853"></a>00853 {
<a name="l00854"></a>00854 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *l;
<a name="l00855"></a>00855 <span class="keywordtype">size_t</span> len;
<a name="l00856"></a>00856 <span class="keywordtype">char</span> *c;
<a name="l00857"></a>00857
<a name="l00858"></a>00858 <span class="comment">/* Backtrace once to get hypothesis length. */</span>
<a name="l00859"></a>00859 len = 0;
<a name="l00860"></a>00860 <span class="comment">/* FIXME: There may not be a search, but actually there should be a dict. */</span>
<a name="l00861"></a>00861 <span class="keywordflow">if</span> (dict_real_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>))
<a name="l00862"></a>00862 len += strlen(dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) + 1;
<a name="l00863"></a>00863 <span class="keywordflow">for</span> (l = link; l; l = l->best_prev) {
<a name="l00864"></a>00864 <span class="keywordflow">if</span> (dict_real_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, l-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>))
<a name="l00865"></a>00865 len += strlen(dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, l-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) + 1;
<a name="l00866"></a>00866 }
<a name="l00867"></a>00867
<a name="l00868"></a>00868 <span class="comment">/* Backtrace again to construct hypothesis string. */</span>
<a name="l00869"></a>00869 ckd_free(dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a>);
<a name="l00870"></a>00870 dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a> = ckd_calloc(1, len+1); <span class="comment">/* extra one incase the hyp is empty */</span>
<a name="l00871"></a>00871 c = dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a> + len - 1;
<a name="l00872"></a>00872 <span class="keywordflow">if</span> (dict_real_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) {
<a name="l00873"></a>00873 len = strlen(dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>));
<a name="l00874"></a>00874 c -= len;
<a name="l00875"></a>00875 memcpy(c, dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>), len);
<a name="l00876"></a>00876 <span class="keywordflow">if</span> (c > dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a>) {
<a name="l00877"></a>00877 --c;
<a name="l00878"></a>00878 *c = <span class="charliteral">' '</span>;
<a name="l00879"></a>00879 }
<a name="l00880"></a>00880 }
<a name="l00881"></a>00881 <span class="keywordflow">for</span> (l = link; l; l = l->best_prev) {
<a name="l00882"></a>00882 <span class="keywordflow">if</span> (dict_real_word(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, l-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) {
<a name="l00883"></a>00883 len = strlen(dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, l-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>));
<a name="l00884"></a>00884 c -= len;
<a name="l00885"></a>00885 memcpy(c, dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a71865c59fae65743ef3c6b5aceb17da6" title="Dictionary for this DAG.">dict</a>, l-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>), len);
<a name="l00886"></a>00886 <span class="keywordflow">if</span> (c > dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a>) {
<a name="l00887"></a>00887 --c;
<a name="l00888"></a>00888 *c = <span class="charliteral">' '</span>;
<a name="l00889"></a>00889 }
<a name="l00890"></a>00890 }
<a name="l00891"></a>00891 }
<a name="l00892"></a>00892
<a name="l00893"></a>00893 <span class="keywordflow">return</span> dag-><a class="code" href="structps__lattice__s.html#ac3844c69f8393b607047bd9b302b979a" title="Current hypothesis string.">hyp_str</a>;
<a name="l00894"></a>00894 }
<a name="l00895"></a>00895
<a name="l00896"></a>00896 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00897"></a>00897 ps_lattice_compute_lscr(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, <span class="keywordtype">int</span> to)
<a name="l00898"></a>00898 {
<a name="l00899"></a>00899 ngram_model_t *lmset;
<a name="l00900"></a>00900
<a name="l00901"></a>00901 <span class="comment">/* Language model score is included in the link score for FSG</span>
<a name="l00902"></a>00902 <span class="comment"> * search. FIXME: Of course, this is sort of a hack :( */</span>
<a name="l00903"></a>00903 <span class="keywordflow">if</span> (0 != strcmp(ps_search_name(seg-><a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a>), <span class="stringliteral">"ngram"</span>)) {
<a name="l00904"></a>00904 seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a> = 1; <span class="comment">/* Unigram... */</span>
<a name="l00905"></a>00905 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = 0;
<a name="l00906"></a>00906 <span class="keywordflow">return</span>;
<a name="l00907"></a>00907 }
<a name="l00908"></a>00908
<a name="l00909"></a>00909 lmset = ((<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *)seg-><a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a>)->lmset;
<a name="l00910"></a>00910
<a name="l00911"></a>00911 <span class="keywordflow">if</span> (link->best_prev == NULL) {
<a name="l00912"></a>00912 <span class="keywordflow">if</span> (to) <span class="comment">/* Sentence has only two words. */</span>
<a name="l00913"></a>00913 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = ngram_bg_score(lmset, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00914"></a>00914 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, &seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a>)
<a name="l00915"></a>00915 >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00916"></a>00916 <span class="keywordflow">else</span> {<span class="comment">/* This is the start symbol, its lscr is always 0. */</span>
<a name="l00917"></a>00917 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = 0;
<a name="l00918"></a>00918 seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a> = 1;
<a name="l00919"></a>00919 }
<a name="l00920"></a>00920 }
<a name="l00921"></a>00921 <span class="keywordflow">else</span> {
<a name="l00922"></a>00922 <span class="comment">/* Find the two predecessor words. */</span>
<a name="l00923"></a>00923 <span class="keywordflow">if</span> (to) {
<a name="l00924"></a>00924 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = ngram_tg_score(lmset, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00925"></a>00925 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00926"></a>00926 link->best_prev-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00927"></a>00927 &seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a>) >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00928"></a>00928 }
<a name="l00929"></a>00929 <span class="keywordflow">else</span> {
<a name="l00930"></a>00930 <span class="keywordflow">if</span> (link->best_prev->best_prev)
<a name="l00931"></a>00931 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = ngram_tg_score(lmset, link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00932"></a>00932 link->best_prev-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00933"></a>00933 link->best_prev->best_prev-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00934"></a>00934 &seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a>) >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00935"></a>00935 <span class="keywordflow">else</span>
<a name="l00936"></a>00936 seg-><a class="code" href="structps__seg__s.html#a69e605f422eeed1a9c67437e8ddd8b08" title="Language model score.">lscr</a> = ngram_bg_score(lmset, link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00937"></a>00937 link->best_prev-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l00938"></a>00938 &seg-><a class="code" href="structps__seg__s.html#a4d86c21f1ed2dc3eb3b1b1b37ce9bb48" title="Language model backoff.">lback</a>) >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00939"></a>00939 }
<a name="l00940"></a>00940 }
<a name="l00941"></a>00941 }
<a name="l00942"></a>00942
<a name="l00943"></a>00943 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00944"></a>00944 ps_lattice_link2itor(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, <span class="keywordtype">int</span> to)
<a name="l00945"></a>00945 {
<a name="l00946"></a>00946 <a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *itor = (<a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *)seg;
<a name="l00947"></a>00947 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l00948"></a>00948
<a name="l00949"></a>00949 <span class="keywordflow">if</span> (to) {
<a name="l00950"></a>00950 node = link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>;
<a name="l00951"></a>00951 seg-><a class="code" href="structps__seg__s.html#a2043ca87b07df0cd80d0fb65c3521c04" title="End frame.">ef</a> = node-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a>;
<a name="l00952"></a>00952 seg-><a class="code" href="structps__seg__s.html#ae683244d90d0a5339930b47757778432" title="Log posterior probability.">prob</a> = 0; <span class="comment">/* norm + beta - norm */</span>
<a name="l00953"></a>00953 }
<a name="l00954"></a>00954 <span class="keywordflow">else</span> {
<a name="l00955"></a>00955 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l00956"></a>00956 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *n;
<a name="l00957"></a>00957 logmath_t *lmath = ps_search_acmod(seg-><a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a>)->lmath;
<a name="l00958"></a>00958
<a name="l00959"></a>00959 node = link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>;
<a name="l00960"></a>00960 seg-><a class="code" href="structps__seg__s.html#a2043ca87b07df0cd80d0fb65c3521c04" title="End frame.">ef</a> = link-><a class="code" href="structps__latlink__s.html#a73af187524eb6ec82ad9ae857d11edc6" title="Ending frame of this word.">ef</a>;
<a name="l00961"></a>00961 seg-><a class="code" href="structps__seg__s.html#ae683244d90d0a5339930b47757778432" title="Log posterior probability.">prob</a> = link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - itor-><a class="code" href="structdag__seg__s.html#a4517656eeaa40d33109d39a251a75dea" title="Normalizer for posterior probabilities.">norm</a>;
<a name="l00962"></a>00962 <span class="comment">/* Sum over all exits for this word and any alternate</span>
<a name="l00963"></a>00963 <span class="comment"> pronunciations at the same frame. */</span>
<a name="l00964"></a>00964 <span class="keywordflow">for</span> (n = node; n; n = n-><a class="code" href="structps__latnode__s.html#aa4c0a395c74acbacccde561f92fa89e4" title="Node with alternate pronunciation for this word.">alt</a>) {
<a name="l00965"></a>00965 <span class="keywordflow">for</span> (x = n-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l00966"></a>00966 <span class="keywordflow">if</span> (x->link == link)
<a name="l00967"></a>00967 <span class="keywordflow">continue</span>;
<a name="l00968"></a>00968 seg-><a class="code" href="structps__seg__s.html#ae683244d90d0a5339930b47757778432" title="Log posterior probability.">prob</a> = logmath_add(lmath, seg-><a class="code" href="structps__seg__s.html#ae683244d90d0a5339930b47757778432" title="Log posterior probability.">prob</a>,
<a name="l00969"></a>00969 x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + x->link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - itor-><a class="code" href="structdag__seg__s.html#a4517656eeaa40d33109d39a251a75dea" title="Normalizer for posterior probabilities.">norm</a>);
<a name="l00970"></a>00970 }
<a name="l00971"></a>00971 }
<a name="l00972"></a>00972 }
<a name="l00973"></a>00973 seg-><a class="code" href="structps__seg__s.html#a97a0dc7db931c7e3f98d23d21ce27f04" title="Word string (pointer into dictionary hash)">word</a> = dict_wordstr(ps_search_dict(seg-><a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a>), node-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l00974"></a>00974 seg-><a class="code" href="structps__seg__s.html#ac292e31304906addf3d49f1473df8ead" title="Start frame.">sf</a> = node-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>;
<a name="l00975"></a>00975 seg-><a class="code" href="structps__seg__s.html#a6f7706ec4c0d0ec8ecafaf0f29f41f4b" title="Acoustic score.">ascr</a> = link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00976"></a>00976 <span class="comment">/* Compute language model score from best predecessors. */</span>
<a name="l00977"></a>00977 ps_lattice_compute_lscr(seg, link, to);
<a name="l00978"></a>00978 }
<a name="l00979"></a>00979
<a name="l00980"></a>00980 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00981"></a>00981 ps_lattice_seg_free(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg)
<a name="l00982"></a>00982 {
<a name="l00983"></a>00983 <a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *itor = (<a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *)seg;
<a name="l00984"></a>00984
<a name="l00985"></a>00985 ckd_free(itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a>);
<a name="l00986"></a>00986 ckd_free(itor);
<a name="l00987"></a>00987 }
<a name="l00988"></a>00988
<a name="l00989"></a>00989 <span class="keyword">static</span> <a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *
<a name="l00990"></a>00990 ps_lattice_seg_next(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg)
<a name="l00991"></a>00991 {
<a name="l00992"></a>00992 <a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *itor = (<a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *)seg;
<a name="l00993"></a>00993
<a name="l00994"></a>00994 ++itor-><a class="code" href="structdag__seg__s.html#a0fed697e06d12e5a0405fdcb0d97faf1" title="Current position in bpidx.">cur</a>;
<a name="l00995"></a>00995 <span class="keywordflow">if</span> (itor-><a class="code" href="structdag__seg__s.html#a0fed697e06d12e5a0405fdcb0d97faf1" title="Current position in bpidx.">cur</a> == itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a> + 1) {
<a name="l00996"></a>00996 ps_lattice_seg_free(seg);
<a name="l00997"></a>00997 <span class="keywordflow">return</span> NULL;
<a name="l00998"></a>00998 }
<a name="l00999"></a>00999 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (itor-><a class="code" href="structdag__seg__s.html#a0fed697e06d12e5a0405fdcb0d97faf1" title="Current position in bpidx.">cur</a> == itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a>) {
<a name="l01000"></a>01000 <span class="comment">/* Re-use the last link but with the "to" node. */</span>
<a name="l01001"></a>01001 ps_lattice_link2itor(seg, itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a>[itor-><a class="code" href="structdag__seg__s.html#a0fed697e06d12e5a0405fdcb0d97faf1" title="Current position in bpidx.">cur</a> - 1], TRUE);
<a name="l01002"></a>01002 }
<a name="l01003"></a>01003 <span class="keywordflow">else</span> {
<a name="l01004"></a>01004 ps_lattice_link2itor(seg, itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a>[itor-><a class="code" href="structdag__seg__s.html#a0fed697e06d12e5a0405fdcb0d97faf1" title="Current position in bpidx.">cur</a>], FALSE);
<a name="l01005"></a>01005 }
<a name="l01006"></a>01006
<a name="l01007"></a>01007 <span class="keywordflow">return</span> seg;
<a name="l01008"></a>01008 }
<a name="l01009"></a>01009
<a name="l01010"></a>01010 <span class="keyword">static</span> <a class="code" href="structps__segfuncs__s.html">ps_segfuncs_t</a> ps_lattice_segfuncs = {
<a name="l01011"></a>01011 <span class="comment">/* seg_next */</span> ps_lattice_seg_next,
<a name="l01012"></a>01012 <span class="comment">/* seg_free */</span> ps_lattice_seg_free
<a name="l01013"></a>01013 };
<a name="l01014"></a>01014
<a name="l01015"></a>01015 <a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *
<a name="l01016"></a><a class="code" href="ps__lattice__internal_8h.html#afedbc5558c18f7d029e84a4e27e38187">01016</a> <a class="code" href="ps__lattice_8c.html#afedbc5558c18f7d029e84a4e27e38187" title="Get hypothesis segmentation iterator after bestpath search.">ps_lattice_seg_iter</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, float32 lwf)
<a name="l01017"></a>01017 {
<a name="l01018"></a>01018 <a class="code" href="structdag__seg__s.html" title="Segmentation &quot;iterator&quot; for backpointer table results.">dag_seg_t</a> *itor;
<a name="l01019"></a>01019 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *l;
<a name="l01020"></a>01020 <span class="keywordtype">int</span> cur;
<a name="l01021"></a>01021
<a name="l01022"></a>01022 <span class="comment">/* Calling this an "iterator" is a bit of a misnomer since we have</span>
<a name="l01023"></a>01023 <span class="comment"> * to get the entire backtrace in order to produce it.</span>
<a name="l01024"></a>01024 <span class="comment"> */</span>
<a name="l01025"></a>01025 itor = ckd_calloc(1, <span class="keyword">sizeof</span>(*itor));
<a name="l01026"></a>01026 itor-><a class="code" href="structdag__seg__s.html#a72f90e137c1f83ab3df6ecd5e1b6dc71" title="Base structure.">base</a>.<a class="code" href="structps__seg__s.html#a510362a2281e374c839397c3e5488515" title="V-table of seg methods.">vt</a> = &ps_lattice_segfuncs;
<a name="l01027"></a>01027 itor-><a class="code" href="structdag__seg__s.html#a72f90e137c1f83ab3df6ecd5e1b6dc71" title="Base structure.">base</a>.<a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a> = dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>;
<a name="l01028"></a>01028 itor-><a class="code" href="structdag__seg__s.html#a72f90e137c1f83ab3df6ecd5e1b6dc71" title="Base structure.">base</a>.<a class="code" href="structps__seg__s.html#a2249c012b83c902f4f8ed8d98ded7d20" title="Language weight factor (for second-pass searches)">lwf</a> = lwf;
<a name="l01029"></a>01029 itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a> = 0;
<a name="l01030"></a>01030 itor-><a class="code" href="structdag__seg__s.html#a4517656eeaa40d33109d39a251a75dea" title="Normalizer for posterior probabilities.">norm</a> = dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>;
<a name="l01031"></a>01031
<a name="l01032"></a>01032 <span class="keywordflow">for</span> (l = link; l; l = l->best_prev) {
<a name="l01033"></a>01033 ++itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a>;
<a name="l01034"></a>01034 }
<a name="l01035"></a>01035 <span class="keywordflow">if</span> (itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a> == 0) {
<a name="l01036"></a>01036 ckd_free(itor);
<a name="l01037"></a>01037 <span class="keywordflow">return</span> NULL;
<a name="l01038"></a>01038 }
<a name="l01039"></a>01039
<a name="l01040"></a>01040 itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a> = ckd_calloc(itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a>, <span class="keyword">sizeof</span>(*itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a>));
<a name="l01041"></a>01041 cur = itor-><a class="code" href="structdag__seg__s.html#a2a858ea6ef051074be2bd1716a4939fb" title="Number of lattice links.">n_links</a> - 1;
<a name="l01042"></a>01042 <span class="keywordflow">for</span> (l = link; l; l = l->best_prev) {
<a name="l01043"></a>01043 itor-><a class="code" href="structdag__seg__s.html#a5fcc22d787e4db1bdc728ff8faead738" title="Array of lattice links.">links</a>[cur] = l;
<a name="l01044"></a>01044 --cur;
<a name="l01045"></a>01045 }
<a name="l01046"></a>01046
<a name="l01047"></a>01047 ps_lattice_link2itor((<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *)itor, itor->links[0], FALSE);
<a name="l01048"></a>01048 <span class="keywordflow">return</span> (<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *)itor;
<a name="l01049"></a>01049 }
<a name="l01050"></a>01050
<a name="l01051"></a>01051 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *
<a name="l01052"></a><a class="code" href="ps__lattice__internal_8h.html#a7197508af770064ea825bb812dd6eddc">01052</a> <a class="code" href="ps__lattice_8c.html#a7197508af770064ea825bb812dd6eddc" title="Create a new lattice link element.">latlink_list_new</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *next)
<a name="l01053"></a>01053 {
<a name="l01054"></a>01054 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *ll;
<a name="l01055"></a>01055
<a name="l01056"></a>01056 ll = listelem_malloc(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>);
<a name="l01057"></a>01057 ll->link = link;
<a name="l01058"></a>01058 ll->next = next;
<a name="l01059"></a>01059
<a name="l01060"></a>01060 <span class="keywordflow">return</span> ll;
<a name="l01061"></a>01061 }
<a name="l01062"></a>01062
<a name="l01063"></a>01063 <span class="keywordtype">void</span>
<a name="l01064"></a><a class="code" href="ps__lattice__internal_8h.html#a04896ebe0e2592bc7950d413b5d5c52e">01064</a> <a class="code" href="ps__lattice_8c.html#a04896ebe0e2592bc7950d413b5d5c52e" title="Add an edge to the traversal queue.">ps_lattice_pushq</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link)
<a name="l01065"></a>01065 {
<a name="l01066"></a>01066 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a> == NULL)
<a name="l01067"></a>01067 dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a> = dag-><a class="code" href="structps__lattice__s.html#a5a9faf5e4aabd84a868d1bff97dd9814" title="Queue of links for traversal.">q_tail</a> = <a class="code" href="ps__lattice_8c.html#a7197508af770064ea825bb812dd6eddc" title="Create a new lattice link element.">latlink_list_new</a>(dag, link, NULL);
<a name="l01068"></a>01068 <span class="keywordflow">else</span> {
<a name="l01069"></a>01069 dag-><a class="code" href="structps__lattice__s.html#a5a9faf5e4aabd84a868d1bff97dd9814" title="Queue of links for traversal.">q_tail</a>->next = <a class="code" href="ps__lattice_8c.html#a7197508af770064ea825bb812dd6eddc" title="Create a new lattice link element.">latlink_list_new</a>(dag, link, NULL);
<a name="l01070"></a>01070 dag-><a class="code" href="structps__lattice__s.html#a5a9faf5e4aabd84a868d1bff97dd9814" title="Queue of links for traversal.">q_tail</a> = dag-><a class="code" href="structps__lattice__s.html#a5a9faf5e4aabd84a868d1bff97dd9814" title="Queue of links for traversal.">q_tail</a>->next;
<a name="l01071"></a>01071 }
<a name="l01072"></a>01072
<a name="l01073"></a>01073 }
<a name="l01074"></a>01074
<a name="l01075"></a>01075 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01076"></a><a class="code" href="ps__lattice__internal_8h.html#a481c4d941368597e11b0af4709bd03b0">01076</a> <a class="code" href="ps__lattice_8c.html#a481c4d941368597e11b0af4709bd03b0" title="Remove an edge from the traversal queue.">ps_lattice_popq</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l01077"></a>01077 {
<a name="l01078"></a>01078 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01079"></a>01079 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link;
<a name="l01080"></a>01080
<a name="l01081"></a>01081 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a> == NULL)
<a name="l01082"></a>01082 <span class="keywordflow">return</span> NULL;
<a name="l01083"></a>01083 link = dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a>->link;
<a name="l01084"></a>01084 x = dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a>->next;
<a name="l01085"></a>01085 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a>);
<a name="l01086"></a>01086 dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a> = x;
<a name="l01087"></a>01087 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a26c029189074db2f668d5a9d67eb7af5" title="Queue of links for traversal.">q_head</a> == NULL)
<a name="l01088"></a>01088 dag-><a class="code" href="structps__lattice__s.html#a5a9faf5e4aabd84a868d1bff97dd9814" title="Queue of links for traversal.">q_tail</a> = NULL;
<a name="l01089"></a>01089 <span class="keywordflow">return</span> link;
<a name="l01090"></a>01090 }
<a name="l01091"></a>01091
<a name="l01092"></a>01092 <span class="keywordtype">void</span>
<a name="l01093"></a><a class="code" href="ps__lattice__internal_8h.html#ad128ca75e8bc7ca4ba41094fb5b68ee9">01093</a> <a class="code" href="ps__lattice_8c.html#ad128ca75e8bc7ca4ba41094fb5b68ee9" title="Clear and reset the traversal queue.">ps_lattice_delq</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag)
<a name="l01094"></a>01094 {
<a name="l01095"></a>01095 <span class="keywordflow">while</span> (<a class="code" href="ps__lattice_8c.html#a481c4d941368597e11b0af4709bd03b0" title="Remove an edge from the traversal queue.">ps_lattice_popq</a>(dag)) {
<a name="l01096"></a>01096 <span class="comment">/* Do nothing. */</span>
<a name="l01097"></a>01097 }
<a name="l01098"></a>01098 }
<a name="l01099"></a>01099
<a name="l01100"></a>01100 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01101"></a><a class="code" href="ps__lattice_8c.html#a3bd22d7b0561c81f874c115a200e84b9">01101</a> <a class="code" href="ps__lattice_8h.html#a997fce2eb1eaf316d463ddfb3d8395b8" title="Start a forward traversal of edges in a word graph.">ps_lattice_traverse_edges</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *start, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *end)
<a name="l01102"></a>01102 {
<a name="l01103"></a>01103 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01104"></a>01104 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01105"></a>01105
<a name="l01106"></a>01106 <span class="comment">/* Cancel any unfinished traversal. */</span>
<a name="l01107"></a>01107 <a class="code" href="ps__lattice_8c.html#ad128ca75e8bc7ca4ba41094fb5b68ee9" title="Clear and reset the traversal queue.">ps_lattice_delq</a>(dag);
<a name="l01108"></a>01108
<a name="l01109"></a>01109 <span class="comment">/* Initialize node fanin counts and path scores. */</span>
<a name="l01110"></a>01110 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>)
<a name="l01111"></a>01111 node->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a> = 0;
<a name="l01112"></a>01112 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01113"></a>01113 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next)
<a name="l01114"></a>01114 (x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a>)++;
<a name="l01115"></a>01115 }
<a name="l01116"></a>01116
<a name="l01117"></a>01117 <span class="comment">/* Initialize agenda with all exits from start. */</span>
<a name="l01118"></a>01118 <span class="keywordflow">if</span> (start == NULL) start = dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>;
<a name="l01119"></a>01119 <span class="keywordflow">for</span> (x = start-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next)
<a name="l01120"></a>01120 <a class="code" href="ps__lattice_8c.html#a04896ebe0e2592bc7950d413b5d5c52e" title="Add an edge to the traversal queue.">ps_lattice_pushq</a>(dag, x->link);
<a name="l01121"></a>01121
<a name="l01122"></a>01122 <span class="comment">/* Pull the first edge off the queue. */</span>
<a name="l01123"></a>01123 <span class="keywordflow">return</span> <a class="code" href="ps__lattice_8h.html#a2682f3cbbb4e6aee040fbe570ca983a9" title="Get the next link in forward traversal.">ps_lattice_traverse_next</a>(dag, end);
<a name="l01124"></a>01124 }
<a name="l01125"></a>01125
<a name="l01126"></a>01126 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01127"></a><a class="code" href="ps__lattice_8c.html#a8ab5c5bbbcf02a087a81232476dbd2a3">01127</a> <a class="code" href="ps__lattice_8h.html#a2682f3cbbb4e6aee040fbe570ca983a9" title="Get the next link in forward traversal.">ps_lattice_traverse_next</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *end)
<a name="l01128"></a>01128 {
<a name="l01129"></a>01129 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *next;
<a name="l01130"></a>01130
<a name="l01131"></a>01131 next = <a class="code" href="ps__lattice_8c.html#a481c4d941368597e11b0af4709bd03b0" title="Remove an edge from the traversal queue.">ps_lattice_popq</a>(dag);
<a name="l01132"></a>01132 <span class="keywordflow">if</span> (next == NULL)
<a name="l01133"></a>01133 <span class="keywordflow">return</span> NULL;
<a name="l01134"></a>01134
<a name="l01135"></a>01135 <span class="comment">/* Decrease fanin count for destination node and expand outgoing</span>
<a name="l01136"></a>01136 <span class="comment"> * edges if all incoming edges have been seen. */</span>
<a name="l01137"></a>01137 --next-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a>;
<a name="l01138"></a>01138 <span class="keywordflow">if</span> (next-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a> == 0) {
<a name="l01139"></a>01139 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01140"></a>01140
<a name="l01141"></a>01141 <span class="keywordflow">if</span> (end == NULL) end = dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>;
<a name="l01142"></a>01142 <span class="keywordflow">if</span> (next-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == end) {
<a name="l01143"></a>01143 <span class="comment">/* If we have traversed all links entering the end node,</span>
<a name="l01144"></a>01144 <span class="comment"> * clear the queue, causing future calls to this function</span>
<a name="l01145"></a>01145 <span class="comment"> * to return NULL. */</span>
<a name="l01146"></a>01146 <a class="code" href="ps__lattice_8c.html#ad128ca75e8bc7ca4ba41094fb5b68ee9" title="Clear and reset the traversal queue.">ps_lattice_delq</a>(dag);
<a name="l01147"></a>01147 <span class="keywordflow">return</span> next;
<a name="l01148"></a>01148 }
<a name="l01149"></a>01149
<a name="l01150"></a>01150 <span class="comment">/* Extend all outgoing edges. */</span>
<a name="l01151"></a>01151 <span class="keywordflow">for</span> (x = next-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next)
<a name="l01152"></a>01152 <a class="code" href="ps__lattice_8c.html#a04896ebe0e2592bc7950d413b5d5c52e" title="Add an edge to the traversal queue.">ps_lattice_pushq</a>(dag, x->link);
<a name="l01153"></a>01153 }
<a name="l01154"></a>01154 <span class="keywordflow">return</span> next;
<a name="l01155"></a>01155 }
<a name="l01156"></a>01156
<a name="l01157"></a>01157 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01158"></a><a class="code" href="ps__lattice_8c.html#a33e1a31ff250c7e7d555e179e2693f5d">01158</a> <a class="code" href="ps__lattice_8h.html#ad712e99a75ab8e9eb2f636aac8d5e2cb" title="Start a reverse traversal of edges in a word graph.">ps_lattice_reverse_edges</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *start, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *end)
<a name="l01159"></a>01159 {
<a name="l01160"></a>01160 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01161"></a>01161 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01162"></a>01162
<a name="l01163"></a>01163 <span class="comment">/* Cancel any unfinished traversal. */</span>
<a name="l01164"></a>01164 <a class="code" href="ps__lattice_8c.html#ad128ca75e8bc7ca4ba41094fb5b68ee9" title="Clear and reset the traversal queue.">ps_lattice_delq</a>(dag);
<a name="l01165"></a>01165
<a name="l01166"></a>01166 <span class="comment">/* Initialize node fanout counts and path scores. */</span>
<a name="l01167"></a>01167 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01168"></a>01168 node->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a> = 0;
<a name="l01169"></a>01169 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next)
<a name="l01170"></a>01170 ++node->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a>;
<a name="l01171"></a>01171 }
<a name="l01172"></a>01172
<a name="l01173"></a>01173 <span class="comment">/* Initialize agenda with all entries from end. */</span>
<a name="l01174"></a>01174 <span class="keywordflow">if</span> (end == NULL) end = dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>;
<a name="l01175"></a>01175 <span class="keywordflow">for</span> (x = end-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = x->next)
<a name="l01176"></a>01176 <a class="code" href="ps__lattice_8c.html#a04896ebe0e2592bc7950d413b5d5c52e" title="Add an edge to the traversal queue.">ps_lattice_pushq</a>(dag, x->link);
<a name="l01177"></a>01177
<a name="l01178"></a>01178 <span class="comment">/* Pull the first edge off the queue. */</span>
<a name="l01179"></a>01179 <span class="keywordflow">return</span> <a class="code" href="ps__lattice_8h.html#ae94a8b82335f782370faa66bb4801c72" title="Get the next link in reverse traversal.">ps_lattice_reverse_next</a>(dag, start);
<a name="l01180"></a>01180 }
<a name="l01181"></a>01181
<a name="l01182"></a>01182 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01183"></a><a class="code" href="ps__lattice_8c.html#a7a6e0cb0510310b13fd4286cf8f48792">01183</a> <a class="code" href="ps__lattice_8h.html#ae94a8b82335f782370faa66bb4801c72" title="Get the next link in reverse traversal.">ps_lattice_reverse_next</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *start)
<a name="l01184"></a>01184 {
<a name="l01185"></a>01185 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *next;
<a name="l01186"></a>01186
<a name="l01187"></a>01187 next = <a class="code" href="ps__lattice_8c.html#a481c4d941368597e11b0af4709bd03b0" title="Remove an edge from the traversal queue.">ps_lattice_popq</a>(dag);
<a name="l01188"></a>01188 <span class="keywordflow">if</span> (next == NULL)
<a name="l01189"></a>01189 <span class="keywordflow">return</span> NULL;
<a name="l01190"></a>01190
<a name="l01191"></a>01191 <span class="comment">/* Decrease fanout count for source node and expand incoming</span>
<a name="l01192"></a>01192 <span class="comment"> * edges if all incoming edges have been seen. */</span>
<a name="l01193"></a>01193 --next-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a>;
<a name="l01194"></a>01194 <span class="keywordflow">if</span> (next-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>->info.<a class="code" href="structps__latnode__s.html#a74ba4cfd8ebbb73772b8377d4517d9c0" title="Number nodes with links to this node.">fanin</a> == 0) {
<a name="l01195"></a>01195 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01196"></a>01196
<a name="l01197"></a>01197 <span class="keywordflow">if</span> (start == NULL) start = dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>;
<a name="l01198"></a>01198 <span class="keywordflow">if</span> (next-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> == start) {
<a name="l01199"></a>01199 <span class="comment">/* If we have traversed all links entering the start node,</span>
<a name="l01200"></a>01200 <span class="comment"> * clear the queue, causing future calls to this function</span>
<a name="l01201"></a>01201 <span class="comment"> * to return NULL. */</span>
<a name="l01202"></a>01202 <a class="code" href="ps__lattice_8c.html#ad128ca75e8bc7ca4ba41094fb5b68ee9" title="Clear and reset the traversal queue.">ps_lattice_delq</a>(dag);
<a name="l01203"></a>01203 <span class="keywordflow">return</span> next;
<a name="l01204"></a>01204 }
<a name="l01205"></a>01205
<a name="l01206"></a>01206 <span class="comment">/* Extend all outgoing edges. */</span>
<a name="l01207"></a>01207 <span class="keywordflow">for</span> (x = next-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = x->next)
<a name="l01208"></a>01208 <a class="code" href="ps__lattice_8c.html#a04896ebe0e2592bc7950d413b5d5c52e" title="Add an edge to the traversal queue.">ps_lattice_pushq</a>(dag, x->link);
<a name="l01209"></a>01209 }
<a name="l01210"></a>01210 <span class="keywordflow">return</span> next;
<a name="l01211"></a>01211 }
<a name="l01212"></a>01212
<a name="l01213"></a>01213 <span class="comment">/*</span>
<a name="l01214"></a>01214 <span class="comment"> * Find the best score from dag->start to end point of any link and</span>
<a name="l01215"></a>01215 <span class="comment"> * use it to update links further down the path. This is like</span>
<a name="l01216"></a>01216 <span class="comment"> * single-source shortest path search, except that it is done over</span>
<a name="l01217"></a>01217 <span class="comment"> * edges rather than nodes, which allows us to do exact trigram scoring.</span>
<a name="l01218"></a>01218 <span class="comment"> *</span>
<a name="l01219"></a>01219 <span class="comment"> * Helpfully enough, we get half of the posterior probability</span>
<a name="l01220"></a>01220 <span class="comment"> * calculation for free that way too. (interesting research topic: is</span>
<a name="l01221"></a>01221 <span class="comment"> * there a reliable Viterbi analogue to word-level Forward-Backward</span>
<a name="l01222"></a>01222 <span class="comment"> * like there is for state-level? Or, is it just lattice density?)</span>
<a name="l01223"></a>01223 <span class="comment"> */</span>
<a name="l01224"></a>01224 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *
<a name="l01225"></a><a class="code" href="ps__lattice_8c.html#a0cc8e4824f4f23ecbf511b0bb096a3ea">01225</a> <a class="code" href="ps__lattice_8h.html#af19b8f0749af01d4874595e80fc612ba" title="Do N-Gram based best-path search on a word graph.">ps_lattice_bestpath</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, ngram_model_t *lmset,
<a name="l01226"></a>01226 float32 lwf, float32 ascale)
<a name="l01227"></a>01227 {
<a name="l01228"></a>01228 <a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *search;
<a name="l01229"></a>01229 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01230"></a>01230 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link;
<a name="l01231"></a>01231 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *bestend;
<a name="l01232"></a>01232 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01233"></a>01233 logmath_t *lmath;
<a name="l01234"></a>01234 int32 bestescr;
<a name="l01235"></a>01235
<a name="l01236"></a>01236 search = dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>;
<a name="l01237"></a>01237 lmath = dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>;
<a name="l01238"></a>01238
<a name="l01239"></a>01239 <span class="comment">/* Initialize path scores for all links exiting dag->start, and</span>
<a name="l01240"></a>01240 <span class="comment"> * set all other scores to the minimum. Also initialize alphas to</span>
<a name="l01241"></a>01241 <span class="comment"> * log-zero. */</span>
<a name="l01242"></a>01242 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01243"></a>01243 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01244"></a>01244 x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> = MAX_NEG_INT32;
<a name="l01245"></a>01245 x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> = logmath_get_zero(lmath);
<a name="l01246"></a>01246 }
<a name="l01247"></a>01247 }
<a name="l01248"></a>01248 <span class="keywordflow">for</span> (x = dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01249"></a>01249 int32 n_used;
<a name="l01250"></a>01250
<a name="l01251"></a>01251 <span class="comment">/* Ignore filler words. */</span>
<a name="l01252"></a>01252 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)
<a name="l01253"></a>01253 && x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> != dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01254"></a>01254 <span class="keywordflow">continue</span>;
<a name="l01255"></a>01255
<a name="l01256"></a>01256 <span class="comment">/* Best path points to dag->start, obviously. */</span>
<a name="l01257"></a>01257 <span class="keywordflow">if</span> (lmset)
<a name="l01258"></a>01258 x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> = x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> +
<a name="l01259"></a>01259 (ngram_bg_score(lmset, x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01260"></a>01260 ps_search_start_wid(search), &n_used)
<a name="l01261"></a>01261 >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>)
<a name="l01262"></a>01262 * lwf;
<a name="l01263"></a>01263 <span class="keywordflow">else</span>
<a name="l01264"></a>01264 x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> = x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>;
<a name="l01265"></a>01265 x->link->best_prev = NULL;
<a name="l01266"></a>01266 <span class="comment">/* No predecessors for start links. */</span>
<a name="l01267"></a>01267 x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> = 0;
<a name="l01268"></a>01268 }
<a name="l01269"></a>01269
<a name="l01270"></a>01270 <span class="comment">/* Traverse the edges in the graph, updating path scores. */</span>
<a name="l01271"></a>01271 <span class="keywordflow">for</span> (link = <a class="code" href="ps__lattice_8h.html#a997fce2eb1eaf316d463ddfb3d8395b8" title="Start a forward traversal of edges in a word graph.">ps_lattice_traverse_edges</a>(dag, NULL, NULL);
<a name="l01272"></a>01272 link; link = <a class="code" href="ps__lattice_8h.html#a2682f3cbbb4e6aee040fbe570ca983a9" title="Get the next link in forward traversal.">ps_lattice_traverse_next</a>(dag, NULL)) {
<a name="l01273"></a>01273 int32 bprob, n_used;
<a name="l01274"></a>01274
<a name="l01275"></a>01275 <span class="comment">/* Skip filler nodes in traversal. */</span>
<a name="l01276"></a>01276 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>) && link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> != dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>)
<a name="l01277"></a>01277 <span class="keywordflow">continue</span>;
<a name="l01278"></a>01278 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>) && link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> != dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01279"></a>01279 <span class="keywordflow">continue</span>;
<a name="l01280"></a>01280
<a name="l01281"></a>01281 <span class="comment">/* Sanity check, we should not be traversing edges that</span>
<a name="l01282"></a>01282 <span class="comment"> * weren't previously updated, otherwise nasty overflows will result. */</span>
<a name="l01283"></a>01283 assert(link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> != MAX_NEG_INT32);
<a name="l01284"></a>01284
<a name="l01285"></a>01285 <span class="comment">/* Calculate common bigram probability for all alphas. */</span>
<a name="l01286"></a>01286 <span class="keywordflow">if</span> (lmset)
<a name="l01287"></a>01287 bprob = ngram_ng_prob(lmset,
<a name="l01288"></a>01288 link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01289"></a>01289 &link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, 1, &n_used);
<a name="l01290"></a>01290 <span class="keywordflow">else</span>
<a name="l01291"></a>01291 bprob = 0;
<a name="l01292"></a>01292 <span class="comment">/* Add in this link's acoustic score, which was a constant</span>
<a name="l01293"></a>01293 <span class="comment"> factor in previous computations (if any). */</span>
<a name="l01294"></a>01294 link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> += (link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale;
<a name="l01295"></a>01295
<a name="l01296"></a>01296 <span class="comment">/* Update scores for all paths exiting link->to. */</span>
<a name="l01297"></a>01297 <span class="keywordflow">for</span> (x = link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01298"></a>01298 int32 tscore, score;
<a name="l01299"></a>01299
<a name="l01300"></a>01300 <span class="comment">/* Skip links to filler words in update. */</span>
<a name="l01301"></a>01301 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)
<a name="l01302"></a>01302 && x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> != dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01303"></a>01303 <span class="keywordflow">continue</span>;
<a name="l01304"></a>01304
<a name="l01305"></a>01305 <span class="comment">/* Update alpha with sum of previous alphas. */</span>
<a name="l01306"></a>01306 x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> = logmath_add(lmath, x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a>, link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + bprob);
<a name="l01307"></a>01307 <span class="comment">/* Calculate trigram score for bestpath. */</span>
<a name="l01308"></a>01308 <span class="keywordflow">if</span> (lmset)
<a name="l01309"></a>01309 tscore = (ngram_tg_score(lmset, x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01310"></a>01310 link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01311"></a>01311 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, &n_used) >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>)
<a name="l01312"></a>01312 * lwf;
<a name="l01313"></a>01313 <span class="keywordflow">else</span>
<a name="l01314"></a>01314 tscore = 0;
<a name="l01315"></a>01315 <span class="comment">/* Update link score with maximum link score. */</span>
<a name="l01316"></a>01316 score = link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> + tscore + x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>;
<a name="l01317"></a>01317 <span class="keywordflow">if</span> (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a>) {
<a name="l01318"></a>01318 x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> = score;
<a name="l01319"></a>01319 x->link->best_prev = link;
<a name="l01320"></a>01320 }
<a name="l01321"></a>01321 }
<a name="l01322"></a>01322 }
<a name="l01323"></a>01323
<a name="l01324"></a>01324 <span class="comment">/* Find best link entering final node, and calculate normalizer</span>
<a name="l01325"></a>01325 <span class="comment"> * for posterior probabilities. */</span>
<a name="l01326"></a>01326 bestend = NULL;
<a name="l01327"></a>01327 bestescr = MAX_NEG_INT32;
<a name="l01328"></a>01328
<a name="l01329"></a>01329 <span class="comment">/* Normalizer is the alpha for the imaginary link exiting the</span>
<a name="l01330"></a>01330 <span class="comment"> final node. */</span>
<a name="l01331"></a>01331 dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a> = logmath_get_zero(lmath);
<a name="l01332"></a>01332 <span class="keywordflow">for</span> (x = dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = x->next) {
<a name="l01333"></a>01333 int32 bprob, n_used;
<a name="l01334"></a>01334
<a name="l01335"></a>01335 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), x->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>))
<a name="l01336"></a>01336 <span class="keywordflow">continue</span>;
<a name="l01337"></a>01337 <span class="keywordflow">if</span> (lmset)
<a name="l01338"></a>01338 bprob = ngram_ng_prob(lmset,
<a name="l01339"></a>01339 x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01340"></a>01340 &x->link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, 1, &n_used);
<a name="l01341"></a>01341 <span class="keywordflow">else</span>
<a name="l01342"></a>01342 bprob = 0;
<a name="l01343"></a>01343 dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a> = logmath_add(lmath, dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>, x->link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + bprob);
<a name="l01344"></a>01344 <span class="keywordflow">if</span> (x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestescr) {
<a name="l01345"></a>01345 bestescr = x->link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a>;
<a name="l01346"></a>01346 bestend = x->link;
<a name="l01347"></a>01347 }
<a name="l01348"></a>01348 }
<a name="l01349"></a>01349 <span class="comment">/* FIXME: floating point... */</span>
<a name="l01350"></a>01350 dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a> += (int32)(dag-><a class="code" href="structps__lattice__s.html#aba113d4134c72d7405423c77bcc1247e" title="Acoustic score of implicit link exiting final node.">final_node_ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale;
<a name="l01351"></a>01351
<a name="l01352"></a>01352 E_INFO(<span class="stringliteral">"Normalizer P(O) = alpha(%s:%d:%d) = %d\n"</span>,
<a name="l01353"></a>01353 dict_wordstr(dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>-><a class="code" href="structps__search__s.html#a918f243fa966e72c47f697fb9e60089d" title="Pronunciation dictionary.">dict</a>, dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>),
<a name="l01354"></a>01354 dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>, dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a>,
<a name="l01355"></a>01355 dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>);
<a name="l01356"></a>01356 <span class="keywordflow">return</span> bestend;
<a name="l01357"></a>01357 }
<a name="l01358"></a>01358
<a name="l01359"></a>01359 <span class="keyword">static</span> int32
<a name="l01360"></a>01360 ps_lattice_joint(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link, float32 ascale)
<a name="l01361"></a>01361 {
<a name="l01362"></a>01362 ngram_model_t *lmset;
<a name="l01363"></a>01363 int32 jprob;
<a name="l01364"></a>01364
<a name="l01365"></a>01365 <span class="comment">/* Sort of a hack... */</span>
<a name="l01366"></a>01366 <span class="keywordflow">if</span> (dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a> && 0 == strcmp(ps_search_name(dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>), <span class="stringliteral">"ngram"</span>))
<a name="l01367"></a>01367 lmset = ((<a class="code" href="structngram__search__s.html" title="N-Gram search module structure.">ngram_search_t</a> *)dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>)->lmset;
<a name="l01368"></a>01368 <span class="keywordflow">else</span>
<a name="l01369"></a>01369 lmset = NULL;
<a name="l01370"></a>01370
<a name="l01371"></a>01371 jprob = (dag-><a class="code" href="structps__lattice__s.html#aba113d4134c72d7405423c77bcc1247e" title="Acoustic score of implicit link exiting final node.">final_node_ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale;
<a name="l01372"></a>01372 <span class="keywordflow">while</span> (link) {
<a name="l01373"></a>01373 <span class="keywordflow">if</span> (lmset) {
<a name="l01374"></a>01374 <span class="keywordtype">int</span> lback;
<a name="l01375"></a>01375 <span class="comment">/* Compute unscaled language model probability. Note that</span>
<a name="l01376"></a>01376 <span class="comment"> this is actually not the language model probability</span>
<a name="l01377"></a>01377 <span class="comment"> that corresponds to this link, but that is okay,</span>
<a name="l01378"></a>01378 <span class="comment"> because we are just taking the sum over all links in</span>
<a name="l01379"></a>01379 <span class="comment"> the best path. */</span>
<a name="l01380"></a>01380 jprob += ngram_ng_prob(lmset, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01381"></a>01381 &link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, 1, &lback);
<a name="l01382"></a>01382 }
<a name="l01383"></a>01383 <span class="comment">/* If there is no language model, we assume that the language</span>
<a name="l01384"></a>01384 <span class="comment"> model probability (such as it is) has been included in the</span>
<a name="l01385"></a>01385 <span class="comment"> link score. */</span>
<a name="l01386"></a>01386 jprob += (link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale;
<a name="l01387"></a>01387 link = link->best_prev;
<a name="l01388"></a>01388 }
<a name="l01389"></a>01389
<a name="l01390"></a>01390 E_INFO(<span class="stringliteral">"Joint P(O,S) = %d P(S|O) = %d\n"</span>, jprob, jprob - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>);
<a name="l01391"></a>01391 <span class="keywordflow">return</span> jprob;
<a name="l01392"></a>01392 }
<a name="l01393"></a>01393
<a name="l01394"></a>01394 int32
<a name="l01395"></a><a class="code" href="ps__lattice_8c.html#aafee8a8325301db72711a3680bc385c6">01395</a> <a class="code" href="ps__lattice_8h.html#a8c5c6ef260ab006099ab34d09b5b1d06" title="Calculate link posterior probabilities on a word graph.">ps_lattice_posterior</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, ngram_model_t *lmset,
<a name="l01396"></a>01396 float32 ascale)
<a name="l01397"></a>01397 {
<a name="l01398"></a>01398 <a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *search;
<a name="l01399"></a>01399 logmath_t *lmath;
<a name="l01400"></a>01400 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01401"></a>01401 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link;
<a name="l01402"></a>01402 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01403"></a>01403 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *bestend;
<a name="l01404"></a>01404 int32 bestescr;
<a name="l01405"></a>01405
<a name="l01406"></a>01406 search = dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>;
<a name="l01407"></a>01407 lmath = dag-><a class="code" href="structps__lattice__s.html#a28f4ff5039e0961d57331d2605801010" title="Log-math object.">lmath</a>;
<a name="l01408"></a>01408
<a name="l01409"></a>01409 <span class="comment">/* Reset all betas to zero. */</span>
<a name="l01410"></a>01410 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01411"></a>01411 <span class="keywordflow">for</span> (x = node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01412"></a>01412 x->link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> = logmath_get_zero(lmath);
<a name="l01413"></a>01413 }
<a name="l01414"></a>01414 }
<a name="l01415"></a>01415
<a name="l01416"></a>01416 bestend = NULL;
<a name="l01417"></a>01417 bestescr = MAX_NEG_INT32;
<a name="l01418"></a>01418 <span class="comment">/* Accumulate backward probabilities for all links. */</span>
<a name="l01419"></a>01419 <span class="keywordflow">for</span> (link = <a class="code" href="ps__lattice_8h.html#ad712e99a75ab8e9eb2f636aac8d5e2cb" title="Start a reverse traversal of edges in a word graph.">ps_lattice_reverse_edges</a>(dag, NULL, NULL);
<a name="l01420"></a>01420 link; link = <a class="code" href="ps__lattice_8h.html#ae94a8b82335f782370faa66bb4801c72" title="Get the next link in reverse traversal.">ps_lattice_reverse_next</a>(dag, NULL)) {
<a name="l01421"></a>01421 int32 bprob, n_used;
<a name="l01422"></a>01422
<a name="l01423"></a>01423 <span class="comment">/* Skip filler nodes in traversal. */</span>
<a name="l01424"></a>01424 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>) && link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a> != dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>)
<a name="l01425"></a>01425 <span class="keywordflow">continue</span>;
<a name="l01426"></a>01426 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>) && link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> != dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01427"></a>01427 <span class="keywordflow">continue</span>;
<a name="l01428"></a>01428
<a name="l01429"></a>01429 <span class="comment">/* Calculate LM probability. */</span>
<a name="l01430"></a>01430 <span class="keywordflow">if</span> (lmset)
<a name="l01431"></a>01431 bprob = ngram_ng_prob(lmset, link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01432"></a>01432 &link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, 1, &n_used);
<a name="l01433"></a>01433 <span class="keywordflow">else</span>
<a name="l01434"></a>01434 bprob = 0;
<a name="l01435"></a>01435
<a name="l01436"></a>01436 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> == dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>) {
<a name="l01437"></a>01437 <span class="comment">/* Track the best path - we will backtrace in order to</span>
<a name="l01438"></a>01438 <span class="comment"> calculate the unscaled joint probability for sentence</span>
<a name="l01439"></a>01439 <span class="comment"> posterior. */</span>
<a name="l01440"></a>01440 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a> <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestescr) {
<a name="l01441"></a>01441 bestescr = link-><a class="code" href="structps__latlink__s.html#a704fcfbdb57b1461325544c782289599" title="Best path score from root of DAG.">path_scr</a>;
<a name="l01442"></a>01442 bestend = link;
<a name="l01443"></a>01443 }
<a name="l01444"></a>01444 <span class="comment">/* Imaginary exit link from final node has beta = 1.0 */</span>
<a name="l01445"></a>01445 link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> = bprob + (dag-><a class="code" href="structps__lattice__s.html#aba113d4134c72d7405423c77bcc1247e" title="Acoustic score of implicit link exiting final node.">final_node_ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale;
<a name="l01446"></a>01446 }
<a name="l01447"></a>01447 <span class="keywordflow">else</span> {
<a name="l01448"></a>01448 <span class="comment">/* Update beta from all outgoing betas. */</span>
<a name="l01449"></a>01449 <span class="keywordflow">for</span> (x = link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01450"></a>01450 <span class="keywordflow">if</span> (dict_filler_word(ps_search_dict(search), x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>) && x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a> != dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01451"></a>01451 <span class="keywordflow">continue</span>;
<a name="l01452"></a>01452 link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> = logmath_add(lmath, link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a>,
<a name="l01453"></a>01453 x->link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> + bprob
<a name="l01454"></a>01454 + (x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a> << <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>) * ascale);
<a name="l01455"></a>01455 }
<a name="l01456"></a>01456 }
<a name="l01457"></a>01457 }
<a name="l01458"></a>01458
<a name="l01459"></a>01459 <span class="comment">/* Return P(S|O) = P(O,S)/P(O) */</span>
<a name="l01460"></a>01460 <span class="keywordflow">return</span> ps_lattice_joint(dag, bestend, ascale) - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a>;
<a name="l01461"></a>01461 }
<a name="l01462"></a>01462
<a name="l01463"></a>01463 int32
<a name="l01464"></a><a class="code" href="ps__lattice_8c.html#a54c24dc8436c39d0ccc044f7b0ef8f3a">01464</a> <a class="code" href="ps__lattice_8h.html#a30d83a5fd158d2acaa5107be7a09ed09" title="Prune all links (and associated nodes) below a certain posterior probability.">ps_lattice_posterior_prune</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag, int32 beam)
<a name="l01465"></a>01465 {
<a name="l01466"></a>01466 <a class="code" href="structps__latlink__s.html" title="Links between DAG nodes.">ps_latlink_t</a> *link;
<a name="l01467"></a>01467 <span class="keywordtype">int</span> npruned = 0;
<a name="l01468"></a>01468
<a name="l01469"></a>01469 <span class="keywordflow">for</span> (link = <a class="code" href="ps__lattice_8h.html#a997fce2eb1eaf316d463ddfb3d8395b8" title="Start a forward traversal of edges in a word graph.">ps_lattice_traverse_edges</a>(dag, dag-><a class="code" href="structps__lattice__s.html#a5d936695a3813e117d20b585d48db8fe" title="Starting node.">start</a>, dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>);
<a name="l01470"></a>01470 link; link = <a class="code" href="ps__lattice_8h.html#a2682f3cbbb4e6aee040fbe570ca983a9" title="Get the next link in forward traversal.">ps_lattice_traverse_next</a>(dag, dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)) {
<a name="l01471"></a>01471 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#af9c4c69f5f85bbc36818357a52432565" title="From.">reachable</a> = FALSE;
<a name="l01472"></a>01472 <span class="keywordflow">if</span> (link-><a class="code" href="structps__latlink__s.html#ad2f031d271f1d875223aae33116d3f40" title="Forward probability of this link P(w,o_1^{ef})">alpha</a> + link-><a class="code" href="structps__latlink__s.html#a4c27cd5d4f514832d3d46993e2ee87df" title="Backward probability of this link P(w|o_{ef+1}^T)">beta</a> - dag-><a class="code" href="structps__lattice__s.html#a68c3259613a16628e1dd2e8147705d8e" title="Normalizer for posterior probabilities.">norm</a> < beam) {
<a name="l01473"></a>01473 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x, *tmp, *next;
<a name="l01474"></a>01474 tmp = NULL;
<a name="l01475"></a>01475 <span class="keywordflow">for</span> (x = link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = next) {
<a name="l01476"></a>01476 next = x->next;
<a name="l01477"></a>01477 <span class="keywordflow">if</span> (x->link == link) {
<a name="l01478"></a>01478 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l01479"></a>01479 }
<a name="l01480"></a>01480 <span class="keywordflow">else</span> {
<a name="l01481"></a>01481 x->next = tmp;
<a name="l01482"></a>01482 tmp = x;
<a name="l01483"></a>01483 }
<a name="l01484"></a>01484 }
<a name="l01485"></a>01485 link-><a class="code" href="structps__latlink__s.html#ab0912c26d1472b4c5c07042c19ffb979" title="From node.">from</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a> = tmp;
<a name="l01486"></a>01486 tmp = NULL;
<a name="l01487"></a>01487 <span class="keywordflow">for</span> (x = link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a>; x; x = next) {
<a name="l01488"></a>01488 next = x->next;
<a name="l01489"></a>01489 <span class="keywordflow">if</span> (x->link == link) {
<a name="l01490"></a>01490 listelem_free(dag-><a class="code" href="structps__lattice__s.html#a8e9cfaf92f9a3588d018578854c61e88" title="List element allocator for this DAG.">latlink_list_alloc</a>, x);
<a name="l01491"></a>01491 }
<a name="l01492"></a>01492 <span class="keywordflow">else</span> {
<a name="l01493"></a>01493 x->next = tmp;
<a name="l01494"></a>01494 tmp = x;
<a name="l01495"></a>01495 }
<a name="l01496"></a>01496 }
<a name="l01497"></a>01497 link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#a051a7eed31e29dd75151d1b34cc4eefa" title="Links into this node.">entries</a> = tmp;
<a name="l01498"></a>01498 listelem_free(dag-><a class="code" href="structps__lattice__s.html#afa8ca535dc8bf2cc656f6ad477e13b9f" title="Link allocator for this DAG.">latlink_alloc</a>, link);
<a name="l01499"></a>01499 ++npruned;
<a name="l01500"></a>01500 }
<a name="l01501"></a>01501 }
<a name="l01502"></a>01502 dag_mark_reachable(dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>);
<a name="l01503"></a>01503 <a class="code" href="ps__lattice_8c.html#a6da4e36322aaab4d2ebe812bee9a4439" title="Remove nodes marked as unreachable.">ps_lattice_delete_unreachable</a>(dag);
<a name="l01504"></a>01504 <span class="keywordflow">return</span> npruned;
<a name="l01505"></a>01505 }
<a name="l01506"></a>01506
<a name="l01507"></a>01507
<a name="l01508"></a>01508 <span class="comment">/* Parameters to prune n-best alternatives search */</span>
<a name="l01509"></a>01509 <span class="preprocessor">#define MAX_PATHS 500 </span><span class="comment">/* Max allowed active paths at any time */</span>
<a name="l01510"></a>01510 <span class="preprocessor">#define MAX_HYP_TRIES 10000</span>
<a name="l01511"></a>01511 <span class="preprocessor"></span>
<a name="l01512"></a>01512 <span class="comment">/*</span>
<a name="l01513"></a>01513 <span class="comment"> * For each node in any path between from and end of utt, find the</span>
<a name="l01514"></a>01514 <span class="comment"> * best score from "from".sf to end of utt. (NOTE: Uses bigram probs;</span>
<a name="l01515"></a>01515 <span class="comment"> * this is an estimate of the best score from "from".) (NOTE #2: yes,</span>
<a name="l01516"></a>01516 <span class="comment"> * this is the "heuristic score" used in A* search)</span>
<a name="l01517"></a>01517 <span class="comment"> */</span>
<a name="l01518"></a>01518 <span class="keyword">static</span> int32
<a name="l01519"></a>01519 best_rem_score(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest, <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> * from)
<a name="l01520"></a>01520 {
<a name="l01521"></a>01521 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l01522"></a>01522 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01523"></a>01523 int32 bestscore, score;
<a name="l01524"></a>01524
<a name="l01525"></a>01525 dag = nbest->dag;
<a name="l01526"></a>01526 <span class="keywordflow">if</span> (from->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> <= 0)
<a name="l01527"></a>01527 <span class="keywordflow">return</span> (from->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a>);
<a name="l01528"></a>01528
<a name="l01529"></a>01529 <span class="comment">/* Best score from "from" to end of utt not known; compute from successors */</span>
<a name="l01530"></a>01530 bestscore = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l01531"></a>01531 <span class="keywordflow">for</span> (x = from-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01532"></a>01532 int32 n_used;
<a name="l01533"></a>01533
<a name="l01534"></a>01534 score = best_rem_score(nbest, x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>);
<a name="l01535"></a>01535 score += x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>;
<a name="l01536"></a>01536 <span class="keywordflow">if</span> (nbest->lmset)
<a name="l01537"></a>01537 score += (ngram_bg_score(nbest->lmset, x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01538"></a>01538 from-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, &n_used) >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>)
<a name="l01539"></a>01539 * nbest->lwf;
<a name="l01540"></a>01540 if (score <a class="code" href="hmm_8h.html#a2874ab52613ff781c96f570ec0eb0d98" title="Is one score better than another?">BETTER_THAN</a> bestscore)
<a name="l01541"></a>01541 bestscore = score;
<a name="l01542"></a>01542 }
<a name="l01543"></a>01543 from->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> = bestscore;
<a name="l01544"></a>01544
<a name="l01545"></a>01545 <span class="keywordflow">return</span> bestscore;
<a name="l01546"></a>01546 }
<a name="l01547"></a>01547
<a name="l01548"></a>01548 <span class="comment">/*</span>
<a name="l01549"></a>01549 <span class="comment"> * Insert newpath in sorted (by path score) list of paths. But if newpath is</span>
<a name="l01550"></a>01550 <span class="comment"> * too far down the list, drop it (FIXME: necessary?)</span>
<a name="l01551"></a>01551 <span class="comment"> * total_score = path score (newpath) + rem_score to end of utt.</span>
<a name="l01552"></a>01552 <span class="comment"> */</span>
<a name="l01553"></a>01553 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01554"></a>01554 path_insert(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest, <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *newpath, int32 total_score)
<a name="l01555"></a>01555 {
<a name="l01556"></a>01556 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l01557"></a>01557 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *prev, *p;
<a name="l01558"></a>01558 int32 i;
<a name="l01559"></a>01559
<a name="l01560"></a>01560 dag = nbest->dag;
<a name="l01561"></a>01561 prev = NULL;
<a name="l01562"></a>01562 <span class="keywordflow">for</span> (i = 0, p = nbest->path_list; (i < MAX_PATHS) && p; p = p-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a>, i++) {
<a name="l01563"></a>01563 <span class="keywordflow">if</span> ((p-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> + p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a>) < total_score)
<a name="l01564"></a>01564 <span class="keywordflow">break</span>;
<a name="l01565"></a>01565 prev = p;
<a name="l01566"></a>01566 }
<a name="l01567"></a>01567
<a name="l01568"></a>01568 <span class="comment">/* newpath should be inserted between prev and p */</span>
<a name="l01569"></a>01569 <span class="keywordflow">if</span> (i < MAX_PATHS) {
<a name="l01570"></a>01570 <span class="comment">/* Insert new partial hyp */</span>
<a name="l01571"></a>01571 newpath-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a> = p;
<a name="l01572"></a>01572 <span class="keywordflow">if</span> (!prev)
<a name="l01573"></a>01573 nbest->path_list = newpath;
<a name="l01574"></a>01574 <span class="keywordflow">else</span>
<a name="l01575"></a>01575 prev-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a> = newpath;
<a name="l01576"></a>01576 <span class="keywordflow">if</span> (!p)
<a name="l01577"></a>01577 nbest->path_tail = newpath;
<a name="l01578"></a>01578
<a name="l01579"></a>01579 nbest->n_path++;
<a name="l01580"></a>01580 nbest->n_hyp_insert++;
<a name="l01581"></a>01581 nbest->insert_depth += i;
<a name="l01582"></a>01582 }
<a name="l01583"></a>01583 <span class="keywordflow">else</span> {
<a name="l01584"></a>01584 <span class="comment">/* newpath score too low; reject it and also prune paths beyond MAX_PATHS */</span>
<a name="l01585"></a>01585 nbest->path_tail = prev;
<a name="l01586"></a>01586 prev-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a> = NULL;
<a name="l01587"></a>01587 nbest->n_path = MAX_PATHS;
<a name="l01588"></a>01588 listelem_free(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>, newpath);
<a name="l01589"></a>01589
<a name="l01590"></a>01590 nbest->n_hyp_reject++;
<a name="l01591"></a>01591 <span class="keywordflow">for</span> (; p; p = newpath) {
<a name="l01592"></a>01592 newpath = p-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a>;
<a name="l01593"></a>01593 listelem_free(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>, p);
<a name="l01594"></a>01594 nbest->n_hyp_reject++;
<a name="l01595"></a>01595 }
<a name="l01596"></a>01596 }
<a name="l01597"></a>01597 }
<a name="l01598"></a>01598
<a name="l01599"></a>01599 <span class="comment">/* Find all possible extensions to given partial path */</span>
<a name="l01600"></a>01600 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01601"></a>01601 path_extend(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest, <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> * path)
<a name="l01602"></a>01602 {
<a name="l01603"></a>01603 <a class="code" href="structlatlink__list__s.html" title="Linked list of DAG link pointers.">latlink_list_t</a> *x;
<a name="l01604"></a>01604 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *newpath;
<a name="l01605"></a>01605 int32 total_score, tail_score;
<a name="l01606"></a>01606 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l01607"></a>01607
<a name="l01608"></a>01608 dag = nbest->dag;
<a name="l01609"></a>01609
<a name="l01610"></a>01610 <span class="comment">/* Consider all successors of path->node */</span>
<a name="l01611"></a>01611 <span class="keywordflow">for</span> (x = path-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a>; x; x = x->next) {
<a name="l01612"></a>01612 int32 n_used;
<a name="l01613"></a>01613
<a name="l01614"></a>01614 <span class="comment">/* Skip successor if no path from it reaches the final node */</span>
<a name="l01615"></a>01615 <span class="keywordflow">if</span> (x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> <= <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>)
<a name="l01616"></a>01616 <span class="keywordflow">continue</span>;
<a name="l01617"></a>01617
<a name="l01618"></a>01618 <span class="comment">/* Create path extension and compute exact score for this extension */</span>
<a name="l01619"></a>01619 newpath = listelem_malloc(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>);
<a name="l01620"></a>01620 newpath-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a> = x->link-><a class="code" href="structps__latlink__s.html#a782a15b1aeabf68983ca521e51f2c1e1" title="To node.">to</a>;
<a name="l01621"></a>01621 newpath-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a> = path;
<a name="l01622"></a>01622 newpath-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> = path-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> + x->link-><a class="code" href="structps__latlink__s.html#ae8a94ce1afb49292b044a0d4ba42b46d" title="Score for from-&gt;wid (from-&gt;sf to this-&gt;ef)">ascr</a>;
<a name="l01623"></a>01623 <span class="keywordflow">if</span> (nbest->lmset) {
<a name="l01624"></a>01624 <span class="keywordflow">if</span> (path-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>) {
<a name="l01625"></a>01625 newpath-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> += nbest->lwf
<a name="l01626"></a>01626 * (ngram_tg_score(nbest->lmset, newpath-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01627"></a>01627 path-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01628"></a>01628 path-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, &n_used)
<a name="l01629"></a>01629 >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>);
<a name="l01630"></a>01630 }
<a name="l01631"></a>01631 <span class="keywordflow">else</span>
<a name="l01632"></a>01632 newpath-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> += nbest->lwf
<a name="l01633"></a>01633 * (ngram_bg_score(nbest->lmset, newpath-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>,
<a name="l01634"></a>01634 path-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, &n_used)
<a name="l01635"></a>01635 >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>);
<a name="l01636"></a>01636 }
<a name="l01637"></a>01637
<a name="l01638"></a>01638 <span class="comment">/* Insert new partial path hypothesis into sorted path_list */</span>
<a name="l01639"></a>01639 nbest->n_hyp_tried++;
<a name="l01640"></a>01640 total_score = newpath-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> + newpath-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a>;
<a name="l01641"></a>01641
<a name="l01642"></a>01642 <span class="comment">/* First see if hyp would be worse than the worst */</span>
<a name="l01643"></a>01643 <span class="keywordflow">if</span> (nbest->n_path >= MAX_PATHS) {
<a name="l01644"></a>01644 tail_score =
<a name="l01645"></a>01645 nbest->path_tail-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a>
<a name="l01646"></a>01646 + nbest->path_tail-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a>;
<a name="l01647"></a>01647 <span class="keywordflow">if</span> (total_score < tail_score) {
<a name="l01648"></a>01648 listelem_free(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>, newpath);
<a name="l01649"></a>01649 nbest->n_hyp_reject++;
<a name="l01650"></a>01650 <span class="keywordflow">continue</span>;
<a name="l01651"></a>01651 }
<a name="l01652"></a>01652 }
<a name="l01653"></a>01653
<a name="l01654"></a>01654 path_insert(nbest, newpath, total_score);
<a name="l01655"></a>01655 }
<a name="l01656"></a>01656 }
<a name="l01657"></a>01657
<a name="l01658"></a>01658 <a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *
<a name="l01659"></a><a class="code" href="ps__lattice__internal_8h.html#aaf9aedd3cd8bd1d45053e10828215a25">01659</a> <a class="code" href="ps__lattice_8c.html#aaf9aedd3cd8bd1d45053e10828215a25" title="Begin N-Gram based A* search on a word graph.">ps_astar_start</a>(<a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag,
<a name="l01660"></a>01660 ngram_model_t *lmset,
<a name="l01661"></a>01661 float32 lwf,
<a name="l01662"></a>01662 <span class="keywordtype">int</span> sf, <span class="keywordtype">int</span> ef,
<a name="l01663"></a>01663 <span class="keywordtype">int</span> w1, <span class="keywordtype">int</span> w2)
<a name="l01664"></a>01664 {
<a name="l01665"></a>01665 <a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest;
<a name="l01666"></a>01666 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01667"></a>01667
<a name="l01668"></a>01668 nbest = ckd_calloc(1, <span class="keyword">sizeof</span>(*nbest));
<a name="l01669"></a>01669 nbest->dag = dag;
<a name="l01670"></a>01670 nbest->lmset = lmset;
<a name="l01671"></a>01671 nbest->lwf = lwf;
<a name="l01672"></a>01672 nbest->sf = sf;
<a name="l01673"></a>01673 <span class="keywordflow">if</span> (ef < 0)
<a name="l01674"></a>01674 nbest->ef = dag-><a class="code" href="structps__lattice__s.html#aceffa52806f2467e4c83356fef3edc87" title="Number of frames for this utterance.">n_frames</a> + 1;
<a name="l01675"></a>01675 <span class="keywordflow">else</span>
<a name="l01676"></a>01676 nbest->ef = ef;
<a name="l01677"></a>01677 nbest->w1 = w1;
<a name="l01678"></a>01678 nbest->w2 = w2;
<a name="l01679"></a>01679 nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a> = listelem_alloc_init(<span class="keyword">sizeof</span>(<a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a>));
<a name="l01680"></a>01680
<a name="l01681"></a>01681 <span class="comment">/* Initialize rem_score (A* heuristic) to default values */</span>
<a name="l01682"></a>01682 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01683"></a>01683 <span class="keywordflow">if</span> (node == dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>)
<a name="l01684"></a>01684 node->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> = 0;
<a name="l01685"></a>01685 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node-><a class="code" href="structps__latnode__s.html#a5232eefbc6e800b77e7a3c8ee3f4135d" title="Links out of this node.">exits</a> == NULL)
<a name="l01686"></a>01686 node->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> = <a class="code" href="hmm_8h.html#a833f100ee293ad0f1c03f2a5ef9be77a" title="Large &quot;bad&quot; score.">WORST_SCORE</a>;
<a name="l01687"></a>01687 <span class="keywordflow">else</span>
<a name="l01688"></a>01688 node->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a> = 1; <span class="comment">/* +ve => unknown value */</span>
<a name="l01689"></a>01689 }
<a name="l01690"></a>01690
<a name="l01691"></a>01691 <span class="comment">/* Create initial partial hypotheses list consisting of nodes starting at sf */</span>
<a name="l01692"></a>01692 nbest->path_list = nbest->path_tail = NULL;
<a name="l01693"></a>01693 <span class="keywordflow">for</span> (node = dag-><a class="code" href="structps__lattice__s.html#a838bd9223e35d012419e6225b54e393d" title="List of all nodes.">nodes</a>; node; node = node-><a class="code" href="structps__latnode__s.html#aca6f3d543a1712a1ca3bb8ec60f71c84" title="Next node in DAG (no ordering implied)">next</a>) {
<a name="l01694"></a>01694 <span class="keywordflow">if</span> (node-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> == sf) {
<a name="l01695"></a>01695 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *path;
<a name="l01696"></a>01696 int32 n_used;
<a name="l01697"></a>01697
<a name="l01698"></a>01698 best_rem_score(nbest, node);
<a name="l01699"></a>01699 path = listelem_malloc(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>);
<a name="l01700"></a>01700 path-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a> = node;
<a name="l01701"></a>01701 path-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a> = NULL;
<a name="l01702"></a>01702 <span class="keywordflow">if</span> (nbest->lmset)
<a name="l01703"></a>01703 path-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> = nbest->lwf *
<a name="l01704"></a>01704 (w1 < 0)
<a name="l01705"></a>01705 ? ngram_bg_score(nbest->lmset, node-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, w2, &n_used)
<a name="l01706"></a>01706 : ngram_tg_score(nbest->lmset, node-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>, w2, w1, &n_used);
<a name="l01707"></a>01707 <span class="keywordflow">else</span>
<a name="l01708"></a>01708 path-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> = 0;
<a name="l01709"></a>01709 path-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> >>= <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l01710"></a>01710 path_insert(nbest, path, path-><a class="code" href="structps__latpath__s.html#a9249fb528f754db992df1d494a69b580" title="Exact score from start node up to node-&gt;sf.">score</a> + node->info.<a class="code" href="structps__latnode__s.html#ac0e665aedad3044c79b35c4038627a77" title="Estimated best score from node.sf to end.">rem_score</a>);
<a name="l01711"></a>01711 }
<a name="l01712"></a>01712 }
<a name="l01713"></a>01713
<a name="l01714"></a>01714 <span class="keywordflow">return</span> nbest;
<a name="l01715"></a>01715 }
<a name="l01716"></a>01716
<a name="l01717"></a>01717 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *
<a name="l01718"></a><a class="code" href="ps__lattice__internal_8h.html#a6bea95f8fb827af790bbe6ce1920908c">01718</a> <a class="code" href="ps__lattice_8c.html#a6bea95f8fb827af790bbe6ce1920908c" title="Find next best hypothesis of A* on a word graph.">ps_astar_next</a>(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest)
<a name="l01719"></a>01719 {
<a name="l01720"></a>01720 <a class="code" href="structps__lattice__s.html" title="Word graph structure used in bestpath/nbest search.">ps_lattice_t</a> *dag;
<a name="l01721"></a>01721
<a name="l01722"></a>01722 dag = nbest->dag;
<a name="l01723"></a>01723
<a name="l01724"></a>01724 <span class="comment">/* Pop the top (best) partial hypothesis */</span>
<a name="l01725"></a>01725 <span class="keywordflow">while</span> ((nbest->top = nbest->path_list) != NULL) {
<a name="l01726"></a>01726 nbest->path_list = nbest->path_list-><a class="code" href="structps__latpath__s.html#a614ad4a857fb07f76959d385abf50a6d" title="Pointer to next path in list of paths.">next</a>;
<a name="l01727"></a>01727 <span class="keywordflow">if</span> (nbest->top == nbest->path_tail)
<a name="l01728"></a>01728 nbest->path_tail = NULL;
<a name="l01729"></a>01729 nbest->n_path--;
<a name="l01730"></a>01730
<a name="l01731"></a>01731 <span class="comment">/* Complete hypothesis? */</span>
<a name="l01732"></a>01732 <span class="keywordflow">if</span> ((nbest->top-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> >= nbest->ef)
<a name="l01733"></a>01733 || ((nbest->top-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a> == dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>) &&
<a name="l01734"></a>01734 (nbest->ef > dag-><a class="code" href="structps__lattice__s.html#a00f30e2689853d6bcb31c8005a69dc7b" title="Ending node.">end</a>-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>))) {
<a name="l01735"></a>01735 <span class="comment">/* FIXME: Verify that it is non-empty. Also we may want</span>
<a name="l01736"></a>01736 <span class="comment"> * to verify that it is actually distinct from other</span>
<a name="l01737"></a>01737 <span class="comment"> * paths, since often this is not the case*/</span>
<a name="l01738"></a>01738 <span class="keywordflow">return</span> nbest->top;
<a name="l01739"></a>01739 }
<a name="l01740"></a>01740 <span class="keywordflow">else</span> {
<a name="l01741"></a>01741 <span class="keywordflow">if</span> (nbest->top-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#a584ee5a303355d851ac903718998df14" title="First end frame.">fef</a> < nbest->ef)
<a name="l01742"></a>01742 path_extend(nbest, nbest->top);
<a name="l01743"></a>01743 }
<a name="l01744"></a>01744 }
<a name="l01745"></a>01745
<a name="l01746"></a>01746 <span class="comment">/* Did not find any more paths to extend. */</span>
<a name="l01747"></a>01747 <span class="keywordflow">return</span> NULL;
<a name="l01748"></a>01748 }
<a name="l01749"></a>01749
<a name="l01750"></a>01750 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l01751"></a><a class="code" href="ps__lattice__internal_8h.html#ac7372b5c5ec111f6814ce1ba495593e4">01751</a> <a class="code" href="ps__lattice_8c.html#ac7372b5c5ec111f6814ce1ba495593e4" title="Get hypothesis string from A* search.">ps_astar_hyp</a>(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest, <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *path)
<a name="l01752"></a>01752 {
<a name="l01753"></a>01753 <a class="code" href="structps__search__s.html" title="Base structure for search module.">ps_search_t</a> *search;
<a name="l01754"></a>01754 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *p;
<a name="l01755"></a>01755 <span class="keywordtype">size_t</span> len;
<a name="l01756"></a>01756 <span class="keywordtype">char</span> *c;
<a name="l01757"></a>01757 <span class="keywordtype">char</span> *hyp;
<a name="l01758"></a>01758
<a name="l01759"></a>01759 search = nbest->dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>;
<a name="l01760"></a>01760
<a name="l01761"></a>01761 <span class="comment">/* Backtrace once to get hypothesis length. */</span>
<a name="l01762"></a>01762 len = 0;
<a name="l01763"></a>01763 <span class="keywordflow">for</span> (p = path; p; p = p-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>) {
<a name="l01764"></a>01764 <span class="keywordflow">if</span> (dict_real_word(ps_search_dict(search), p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>))
<a name="l01765"></a>01765 len += strlen(dict_wordstr(ps_search_dict(search), p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) + 1;
<a name="l01766"></a>01766 }
<a name="l01767"></a>01767
<a name="l01768"></a>01768 <span class="keywordflow">if</span> (len == 0) {
<a name="l01769"></a>01769 <span class="keywordflow">return</span> NULL;
<a name="l01770"></a>01770 }
<a name="l01771"></a>01771
<a name="l01772"></a>01772 <span class="comment">/* Backtrace again to construct hypothesis string. */</span>
<a name="l01773"></a>01773 hyp = ckd_calloc(1, len);
<a name="l01774"></a>01774 c = hyp + len - 1;
<a name="l01775"></a>01775 <span class="keywordflow">for</span> (p = path; p; p = p-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>) {
<a name="l01776"></a>01776 <span class="keywordflow">if</span> (dict_real_word(ps_search_dict(search), p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>)) {
<a name="l01777"></a>01777 len = strlen(dict_wordstr(ps_search_dict(search), p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>));
<a name="l01778"></a>01778 c -= len;
<a name="l01779"></a>01779 memcpy(c, dict_wordstr(ps_search_dict(search), p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>-><a class="code" href="structps__latnode__s.html#ae3b3dc7d14347e6380859c74b9a02589" title="Dictionary base word id.">basewid</a>), len);
<a name="l01780"></a>01780 <span class="keywordflow">if</span> (c > hyp) {
<a name="l01781"></a>01781 --c;
<a name="l01782"></a>01782 *c = <span class="charliteral">' '</span>;
<a name="l01783"></a>01783 }
<a name="l01784"></a>01784 }
<a name="l01785"></a>01785 }
<a name="l01786"></a>01786
<a name="l01787"></a>01787 nbest-><a class="code" href="structps__astar__s.html#ace603617a74a81575519ae1bb94720c4" title="List of hypothesis strings.">hyps</a> = glist_add_ptr(nbest-><a class="code" href="structps__astar__s.html#ace603617a74a81575519ae1bb94720c4" title="List of hypothesis strings.">hyps</a>, hyp);
<a name="l01788"></a>01788 <span class="keywordflow">return</span> hyp;
<a name="l01789"></a>01789 }
<a name="l01790"></a>01790
<a name="l01791"></a>01791 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01792"></a>01792 ps_astar_node2itor(<a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *itor)
<a name="l01793"></a>01793 {
<a name="l01794"></a>01794 <a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg = (<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *)itor;
<a name="l01795"></a>01795 <a class="code" href="structps__latnode__s.html" title="DAG nodes.">ps_latnode_t</a> *node;
<a name="l01796"></a>01796
<a name="l01797"></a>01797 assert(itor->cur < itor->n_nodes);
<a name="l01798"></a>01798 node = itor->nodes[itor->cur];
<a name="l01799"></a>01799 <span class="keywordflow">if</span> (itor->cur == itor->n_nodes - 1)
<a name="l01800"></a>01800 seg-><a class="code" href="structps__seg__s.html#a2043ca87b07df0cd80d0fb65c3521c04" title="End frame.">ef</a> = node-><a class="code" href="structps__latnode__s.html#a5c7b9114d131151d6ce85228ea9f829d" title="Last end frame.">lef</a>;
<a name="l01801"></a>01801 <span class="keywordflow">else</span>
<a name="l01802"></a>01802 seg-><a class="code" href="structps__seg__s.html#a2043ca87b07df0cd80d0fb65c3521c04" title="End frame.">ef</a> = itor->nodes[itor->cur + 1]-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a> - 1;
<a name="l01803"></a>01803 seg-><a class="code" href="structps__seg__s.html#a97a0dc7db931c7e3f98d23d21ce27f04" title="Word string (pointer into dictionary hash)">word</a> = dict_wordstr(ps_search_dict(seg-><a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a>), node-><a class="code" href="structps__latnode__s.html#afd85dbd410d6e6d970c73088bc6fb97e" title="Dictionary word id.">wid</a>);
<a name="l01804"></a>01804 seg-><a class="code" href="structps__seg__s.html#ac292e31304906addf3d49f1473df8ead" title="Start frame.">sf</a> = node-><a class="code" href="structps__latnode__s.html#a77d358dc8c6e0f112855e8ff0629b6c8" title="Start frame.">sf</a>;
<a name="l01805"></a>01805 seg-><a class="code" href="structps__seg__s.html#ae683244d90d0a5339930b47757778432" title="Log posterior probability.">prob</a> = 0; <span class="comment">/* FIXME: implement forward-backward */</span>
<a name="l01806"></a>01806 }
<a name="l01807"></a>01807
<a name="l01808"></a>01808 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01809"></a>01809 ps_astar_seg_free(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg)
<a name="l01810"></a>01810 {
<a name="l01811"></a>01811 <a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *itor = (<a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *)seg;
<a name="l01812"></a>01812 ckd_free(itor->nodes);
<a name="l01813"></a>01813 ckd_free(itor);
<a name="l01814"></a>01814 }
<a name="l01815"></a>01815
<a name="l01816"></a>01816 <span class="keyword">static</span> <a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *
<a name="l01817"></a>01817 ps_astar_seg_next(<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *seg)
<a name="l01818"></a>01818 {
<a name="l01819"></a>01819 <a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *itor = (<a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *)seg;
<a name="l01820"></a>01820
<a name="l01821"></a>01821 ++itor->cur;
<a name="l01822"></a>01822 <span class="keywordflow">if</span> (itor->cur == itor->n_nodes) {
<a name="l01823"></a>01823 ps_astar_seg_free(seg);
<a name="l01824"></a>01824 <span class="keywordflow">return</span> NULL;
<a name="l01825"></a>01825 }
<a name="l01826"></a>01826 <span class="keywordflow">else</span> {
<a name="l01827"></a>01827 ps_astar_node2itor(itor);
<a name="l01828"></a>01828 }
<a name="l01829"></a>01829
<a name="l01830"></a>01830 <span class="keywordflow">return</span> seg;
<a name="l01831"></a>01831 }
<a name="l01832"></a>01832
<a name="l01833"></a>01833 <span class="keyword">static</span> <a class="code" href="structps__segfuncs__s.html">ps_segfuncs_t</a> ps_astar_segfuncs = {
<a name="l01834"></a>01834 <span class="comment">/* seg_next */</span> ps_astar_seg_next,
<a name="l01835"></a>01835 <span class="comment">/* seg_free */</span> ps_astar_seg_free
<a name="l01836"></a>01836 };
<a name="l01837"></a>01837
<a name="l01838"></a>01838 <a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *
<a name="l01839"></a><a class="code" href="ps__lattice__internal_8h.html#ac8e3dff7276c03c93377d0cb79fbdbd7">01839</a> <a class="code" href="ps__lattice_8c.html#ac8e3dff7276c03c93377d0cb79fbdbd7" title="Get hypothesis segmentation from A* search.">ps_astar_seg_iter</a>(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *astar, <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *path, float32 lwf)
<a name="l01840"></a>01840 {
<a name="l01841"></a>01841 <a class="code" href="structastar__seg__s.html" title="Segmentation &quot;iterator&quot; for A* search results.">astar_seg_t</a> *itor;
<a name="l01842"></a>01842 <a class="code" href="structps__latpath__s.html" title="Partial path structure used in N-best (A*) search.">ps_latpath_t</a> *p;
<a name="l01843"></a>01843 <span class="keywordtype">int</span> cur;
<a name="l01844"></a>01844
<a name="l01845"></a>01845 <span class="comment">/* Backtrace and make an iterator, this should look familiar by now. */</span>
<a name="l01846"></a>01846 itor = ckd_calloc(1, <span class="keyword">sizeof</span>(*itor));
<a name="l01847"></a>01847 itor->base.<a class="code" href="structps__seg__s.html#a510362a2281e374c839397c3e5488515" title="V-table of seg methods.">vt</a> = &ps_astar_segfuncs;
<a name="l01848"></a>01848 itor->base.<a class="code" href="structps__seg__s.html#a14168ddcb60e094dad36c7c920a79bb3" title="Search object from whence this came.">search</a> = astar->dag-><a class="code" href="structps__lattice__s.html#a9ebaeb7be7a83980569f0c544eb6babb" title="Search (if generated by search).">search</a>;
<a name="l01849"></a>01849 itor->base.<a class="code" href="structps__seg__s.html#a2249c012b83c902f4f8ed8d98ded7d20" title="Language weight factor (for second-pass searches)">lwf</a> = lwf;
<a name="l01850"></a>01850 itor->n_nodes = itor->cur = 0;
<a name="l01851"></a>01851 <span class="keywordflow">for</span> (p = path; p; p = p-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>) {
<a name="l01852"></a>01852 ++itor->n_nodes;
<a name="l01853"></a>01853 }
<a name="l01854"></a>01854 itor->nodes = ckd_calloc(itor->n_nodes, <span class="keyword">sizeof</span>(*itor->nodes));
<a name="l01855"></a>01855 cur = itor->n_nodes - 1;
<a name="l01856"></a>01856 <span class="keywordflow">for</span> (p = path; p; p = p-><a class="code" href="structps__latpath__s.html#a87acd26322fca11aa1432cdf9d1a2128" title="Previous element in this path.">parent</a>) {
<a name="l01857"></a>01857 itor->nodes[cur] = p-><a class="code" href="structps__latpath__s.html#a9672f7a5002d994985039aece2a69250" title="Node ending this path.">node</a>;
<a name="l01858"></a>01858 --cur;
<a name="l01859"></a>01859 }
<a name="l01860"></a>01860
<a name="l01861"></a>01861 ps_astar_node2itor(itor);
<a name="l01862"></a>01862 <span class="keywordflow">return</span> (<a class="code" href="structps__seg__s.html" title="Base structure for hypothesis segmentation iterator.">ps_seg_t</a> *)itor;
<a name="l01863"></a>01863 }
<a name="l01864"></a>01864
<a name="l01865"></a>01865 <span class="keywordtype">void</span>
<a name="l01866"></a><a class="code" href="ps__lattice__internal_8h.html#abfb03e9e0fcbe3def45120f5ba43be14">01866</a> <a class="code" href="ps__lattice_8c.html#abfb03e9e0fcbe3def45120f5ba43be14" title="Finish N-best search, releasing resources associated with it.">ps_astar_finish</a>(<a class="code" href="structps__astar__s.html" title="A* search structure.">ps_astar_t</a> *nbest)
<a name="l01867"></a>01867 {
<a name="l01868"></a>01868 gnode_t *gn;
<a name="l01869"></a>01869
<a name="l01870"></a>01870 <span class="comment">/* Free all hyps. */</span>
<a name="l01871"></a>01871 <span class="keywordflow">for</span> (gn = nbest-><a class="code" href="structps__astar__s.html#ace603617a74a81575519ae1bb94720c4" title="List of hypothesis strings.">hyps</a>; gn; gn = gnode_next(gn)) {
<a name="l01872"></a>01872 ckd_free(gnode_ptr(gn));
<a name="l01873"></a>01873 }
<a name="l01874"></a>01874 glist_free(nbest-><a class="code" href="structps__astar__s.html#ace603617a74a81575519ae1bb94720c4" title="List of hypothesis strings.">hyps</a>);
<a name="l01875"></a>01875 <span class="comment">/* Free all paths. */</span>
<a name="l01876"></a>01876 listelem_alloc_free(nbest-><a class="code" href="structps__astar__s.html#a754bce124cd92b1b2b6aa6dbbcd73cee" title="Path allocator for N-best search.">latpath_alloc</a>);
<a name="l01877"></a>01877 <span class="comment">/* Free the Henge. */</span>
<a name="l01878"></a>01878 ckd_free(nbest);
<a name="l01879"></a>01879 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="ps__lattice_8c.html">ps_lattice.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>
