<!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>SphinxBase: src/libsphinxbase/lm/fsg_model.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">SphinxBase <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="pages.html"><span>Related Pages</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('fsg__model_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/lm/fsg_model.c</h1> </div>
</div>
<div class="contents">
<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) 1999-2004 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"> *</span>
<a name="l00019"></a>00019 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00020"></a>00020 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00021"></a>00021 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00022"></a>00022 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00023"></a>00023 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00024"></a>00024 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00025"></a>00025 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00026"></a>00026 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00027"></a>00027 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00028"></a>00028 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00029"></a>00029 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00030"></a>00030 <span class="comment"> *</span>
<a name="l00031"></a>00031 <span class="comment"> * ====================================================================</span>
<a name="l00032"></a>00032 <span class="comment"> *</span>
<a name="l00033"></a>00033 <span class="comment"> */</span>
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="comment">/* System headers. */</span>
<a name="l00036"></a>00036 <span class="preprocessor">#ifdef _WIN32_WCE</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span><span class="comment">/*MC in a debug build it's implicitly included by assert.h</span>
<a name="l00038"></a>00038 <span class="comment"> but you need this in a release build */</span>
<a name="l00039"></a>00039 <span class="preprocessor">#include <windows.h></span>
<a name="l00040"></a>00040 <span class="preprocessor">#else</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span><span class="preprocessor">#include <time.h></span>
<a name="l00042"></a>00042 <span class="preprocessor">#endif </span><span class="comment">/* _WIN32_WCE */</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include <stdio.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <string.h></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <assert.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/err.h"</span>
<a name="l00049"></a>00049 <span class="preprocessor">#include "sphinxbase/pio.h"</span>
<a name="l00050"></a>00050 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00051"></a>00051 <span class="preprocessor">#include "sphinxbase/prim_type.h"</span>
<a name="l00052"></a>00052 <span class="preprocessor">#include "sphinxbase/strfuncs.h"</span>
<a name="l00053"></a>00053 <span class="preprocessor">#include "sphinxbase/hash_table.h"</span>
<a name="l00054"></a>00054 <span class="preprocessor">#include "sphinxbase/fsg_model.h"</span>
<a name="l00055"></a>00055
<a name="l00063"></a><a class="code" href="structtrans__list__s.html">00063</a> <span class="keyword">struct </span><a class="code" href="structtrans__list__s.html" title="Adjacency list (opaque) for a state in an FSG.">trans_list_s</a> {
<a name="l00064"></a>00064 <a class="code" href="structhash__table__t.html">hash_table_t</a> *null_trans; <span class="comment">/* Null transitions keyed by state. */</span>
<a name="l00065"></a>00065 <a class="code" href="structhash__table__t.html">hash_table_t</a> *trans; <span class="comment">/* Lists of non-null transitions keyed by state. */</span>
<a name="l00066"></a>00066 };
<a name="l00067"></a>00067
<a name="l00071"></a><a class="code" href="structfsg__arciter__s.html">00071</a> <span class="keyword">struct </span><a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_s</a> {
<a name="l00072"></a>00072 <a class="code" href="structhash__iter__s.html">hash_iter_t</a> *itor, *null_itor;
<a name="l00073"></a>00073 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00074"></a>00074 };
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="preprocessor">#define FSG_MODEL_BEGIN_DECL "FSG_BEGIN"</span>
<a name="l00077"></a>00077 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_END_DECL "FSG_END"</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_N_DECL "N"</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_NUM_STATES_DECL "NUM_STATES"</span>
<a name="l00080"></a>00080 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_S_DECL "S"</span>
<a name="l00081"></a>00081 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_START_STATE_DECL "START_STATE"</span>
<a name="l00082"></a>00082 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_F_DECL "F"</span>
<a name="l00083"></a>00083 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_FINAL_STATE_DECL "FINAL_STATE"</span>
<a name="l00084"></a>00084 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_T_DECL "T"</span>
<a name="l00085"></a>00085 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_TRANSITION_DECL "TRANSITION"</span>
<a name="l00086"></a>00086 <span class="preprocessor"></span><span class="preprocessor">#define FSG_MODEL_COMMENT_CHAR '#'</span>
<a name="l00087"></a>00087 <span class="preprocessor"></span>
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="keyword">static</span> int32
<a name="l00090"></a>00090 nextline_str2words(FILE * fp, int32 * lineno,
<a name="l00091"></a>00091 <span class="keywordtype">char</span> **lineptr, <span class="keywordtype">char</span> ***wordptr)
<a name="l00092"></a>00092 {
<a name="l00093"></a>00093 <span class="keywordflow">for</span> (;;) {
<a name="l00094"></a>00094 <span class="keywordtype">size_t</span> len;
<a name="l00095"></a>00095 int32 n;
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(*lineptr);
<a name="l00098"></a>00098 <span class="keywordflow">if</span> ((*lineptr = <a class="code" href="pio_8h.html#a11e0daa4f315d01c2e030d3a0abe702c" title="Read a line of arbitrary length from a file and return it as a newly allocated string.">fread_line</a>(fp, &len)) == NULL)
<a name="l00099"></a>00099 <span class="keywordflow">return</span> -1;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 (*lineno)++;
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keywordflow">if</span> ((*lineptr)[0] == FSG_MODEL_COMMENT_CHAR)
<a name="l00104"></a>00104 <span class="keywordflow">continue</span>; <span class="comment">/* Skip comment lines */</span>
<a name="l00105"></a>00105
<a name="l00106"></a>00106 n = <a class="code" href="strfuncs_8h.html#a5b520fdebcca599db86faaf75a82173f" title="Convert a line to an array of &quot;words&quot;, based on whitespace separators.">str2words</a>(*lineptr, NULL, 0);
<a name="l00107"></a>00107 <span class="keywordflow">if</span> (n == 0)
<a name="l00108"></a>00108 <span class="keywordflow">continue</span>; <span class="comment">/* Skip blank lines */</span>
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <span class="comment">/* Abuse of realloc(), but this doesn't have to be fast. */</span>
<a name="l00111"></a>00111 <span class="keywordflow">if</span> (*wordptr == NULL)
<a name="l00112"></a>00112 *wordptr = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(n, <span class="keyword">sizeof</span>(**wordptr));
<a name="l00113"></a>00113 <span class="keywordflow">else</span>
<a name="l00114"></a>00114 *wordptr = <a class="code" href="ckd__alloc_8h.html#afd496738b3e114bd494c5a0955f1bfb3" title="Macro for __ckd_realloc__.">ckd_realloc</a>(*wordptr, n * <span class="keyword">sizeof</span>(**wordptr));
<a name="l00115"></a>00115 <span class="keywordflow">return</span> <a class="code" href="strfuncs_8h.html#a5b520fdebcca599db86faaf75a82173f" title="Convert a line to an array of &quot;words&quot;, based on whitespace separators.">str2words</a>(*lineptr, *wordptr, n);
<a name="l00116"></a>00116 }
<a name="l00117"></a>00117 }
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keywordtype">void</span>
<a name="l00120"></a>00120 fsg_model_trans_add(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg,
<a name="l00121"></a>00121 int32 from, int32 to, int32 logp, int32 wid)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *link;
<a name="l00124"></a>00124 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> gl;
<a name="l00125"></a>00125 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].trans == NULL)
<a name="l00128"></a>00128 fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].trans = <a class="code" href="hash__table_8h.html#a56d93e8c03e066b77377ac6eab50cfae" title="Allocate a new hash table for a given expected size.">hash_table_new</a>(5, HASH_CASE_YES);
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="comment">/* Check for duplicate link (i.e., link already exists with label=wid) */</span>
<a name="l00131"></a>00131 <span class="keywordflow">for</span> (gn = gl = fsg_model_trans(fsg, from, to); gn; gn = gnode_next(gn)) {
<a name="l00132"></a>00132 link = (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *) <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn);
<a name="l00133"></a>00133 <span class="keywordflow">if</span> (link-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> == wid) {
<a name="l00134"></a>00134 <span class="keywordflow">if</span> (link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> < logp)
<a name="l00135"></a>00135 link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> = logp;
<a name="l00136"></a>00136 <span class="keywordflow">return</span>;
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="comment">/* Create transition object */</span>
<a name="l00141"></a>00141 link = <a class="code" href="listelem__alloc_8h.html#ad0c40e65d9cca0d7ec08fcf416b09af2" title="Allocate a list element and return pointer to it.">listelem_malloc</a>(fsg-><a class="code" href="structfsg__model__s.html#ac4e2a36305bbe62a5c7468588eb058b1" title="Allocator for FSG links.">link_alloc</a>);
<a name="l00142"></a>00142 link->from_state = from;
<a name="l00143"></a>00143 link->to_state = to;
<a name="l00144"></a>00144 link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> = logp;
<a name="l00145"></a>00145 link-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> = wid;
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="comment">/* Add it to the list of transitions and update the hash table */</span>
<a name="l00148"></a>00148 gl = <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(gl, (<span class="keywordtype">void</span> *)link);
<a name="l00149"></a>00149 <a class="code" href="hash__table_8h.html#a273237d63833e5625c830f421d9463de" title="Like hash_table_replace, but with an explicitly specified key length, instead of a NULL-terminated...">hash_table_replace_bkey</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].trans,
<a name="l00150"></a>00150 (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&link->to_state,
<a name="l00151"></a>00151 <span class="keyword">sizeof</span>(link->to_state), gl);
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00154"></a>00154 int32
<a name="l00155"></a>00155 fsg_model_tag_trans_add(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, int32 from, int32 to, int32 logp, int32 wid)
<a name="l00156"></a>00156 {
<a name="l00157"></a>00157 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *link, *link2;
<a name="l00158"></a>00158
<a name="l00159"></a>00159 <span class="comment">/* Check for transition probability */</span>
<a name="l00160"></a>00160 <span class="keywordflow">if</span> (logp > 0) {
<a name="l00161"></a>00161 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"Null transition prob must be <= 1.0 (state %d -> %d)\n"</span>,
<a name="l00162"></a>00162 from, to);
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="comment">/* Self-loop null transitions (with prob <= 1.0) are redundant */</span>
<a name="l00166"></a>00166 <span class="keywordflow">if</span> (from == to)
<a name="l00167"></a>00167 <span class="keywordflow">return</span> -1;
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].null_trans == NULL)
<a name="l00170"></a>00170 fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].null_trans = <a class="code" href="hash__table_8h.html#a56d93e8c03e066b77377ac6eab50cfae" title="Allocate a new hash table for a given expected size.">hash_table_new</a>(5, HASH_CASE_YES);
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="comment">/* Check for a duplicate link; if found, keep the higher prob */</span>
<a name="l00173"></a>00173 link = fsg_model_null_trans(fsg, from, to);
<a name="l00174"></a>00174 <span class="keywordflow">if</span> (link) {
<a name="l00175"></a>00175 <span class="keywordflow">if</span> (link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> < logp) {
<a name="l00176"></a>00176 link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> = logp;
<a name="l00177"></a>00177 <span class="keywordflow">return</span> 0;
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179 <span class="keywordflow">else</span>
<a name="l00180"></a>00180 <span class="keywordflow">return</span> -1;
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <span class="comment">/* Create null transition object */</span>
<a name="l00184"></a>00184 link = <a class="code" href="listelem__alloc_8h.html#ad0c40e65d9cca0d7ec08fcf416b09af2" title="Allocate a list element and return pointer to it.">listelem_malloc</a>(fsg-><a class="code" href="structfsg__model__s.html#ac4e2a36305bbe62a5c7468588eb058b1" title="Allocator for FSG links.">link_alloc</a>);
<a name="l00185"></a>00185 link->from_state = from;
<a name="l00186"></a>00186 link->to_state = to;
<a name="l00187"></a>00187 link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> = logp;
<a name="l00188"></a>00188 link-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> = -1;
<a name="l00189"></a>00189
<a name="l00190"></a>00190 link2 = (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *)
<a name="l00191"></a>00191 <a class="code" href="hash__table_8h.html#a6f5752fadefe2662adb2c141f1511062" title="Like hash_table_enter, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_enter_bkey</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[from].null_trans,
<a name="l00192"></a>00192 (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&link->to_state,
<a name="l00193"></a>00193 <span class="keyword">sizeof</span>(link->to_state), link);
<a name="l00194"></a>00194 assert(link == link2);
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordflow">return</span> 1;
<a name="l00197"></a>00197 }
<a name="l00198"></a>00198
<a name="l00199"></a>00199 int32
<a name="l00200"></a>00200 fsg_model_null_trans_add(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, int32 from, int32 to, int32 logp)
<a name="l00201"></a>00201 {
<a name="l00202"></a>00202 <span class="keywordflow">return</span> fsg_model_tag_trans_add(fsg, from, to, logp, -1);
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00206"></a>00206 fsg_model_null_trans_closure(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> nulls)
<a name="l00207"></a>00207 {
<a name="l00208"></a>00208 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn1, *gn2;
<a name="l00209"></a>00209 <span class="keywordtype">int</span> updated;
<a name="l00210"></a>00210 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *tl1, *tl2;
<a name="l00211"></a>00211 int32 k, n;
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Computing transitive closure for null transitions\n"</span>);
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="keywordflow">if</span> (nulls == NULL) {
<a name="l00216"></a>00216 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *null;
<a name="l00217"></a>00217 <span class="keywordtype">int</span> i, j;
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; ++i) {
<a name="l00220"></a>00220 <span class="keywordflow">for</span> (j = 0; j < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; ++j) {
<a name="l00221"></a>00221 <span class="keywordflow">if</span> ((null = fsg_model_null_trans(fsg, i, j)))
<a name="l00222"></a>00222 nulls = <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(nulls, null);
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="comment">/*</span>
<a name="l00228"></a>00228 <span class="comment"> * Probably not the most efficient closure implementation, in general, but</span>
<a name="l00229"></a>00229 <span class="comment"> * probably reasonably efficient for a sparse null transition matrix.</span>
<a name="l00230"></a>00230 <span class="comment"> */</span>
<a name="l00231"></a>00231 n = 0;
<a name="l00232"></a>00232 <span class="keywordflow">do</span> {
<a name="l00233"></a>00233 updated = FALSE;
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="keywordflow">for</span> (gn1 = nulls; gn1; gn1 = gnode_next(gn1)) {
<a name="l00236"></a>00236 tl1 = (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *) <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn1);
<a name="l00237"></a>00237 assert(tl1-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> < 0);
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="keywordflow">for</span> (gn2 = nulls; gn2; gn2 = gnode_next(gn2)) {
<a name="l00240"></a>00240 tl2 = (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *) <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn2);
<a name="l00241"></a>00241
<a name="l00242"></a>00242 <span class="keywordflow">if</span> (tl1->to_state == tl2->from_state) {
<a name="l00243"></a>00243 k = fsg_model_null_trans_add(fsg,
<a name="l00244"></a>00244 tl1->from_state,
<a name="l00245"></a>00245 tl2->to_state,
<a name="l00246"></a>00246 tl1-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> +
<a name="l00247"></a>00247 tl2-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a>);
<a name="l00248"></a>00248 <span class="keywordflow">if</span> (k >= 0) {
<a name="l00249"></a>00249 updated = TRUE;
<a name="l00250"></a>00250 <span class="keywordflow">if</span> (k > 0) {
<a name="l00251"></a>00251 nulls =
<a name="l00252"></a>00252 <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(nulls, (<span class="keywordtype">void</span> *)
<a name="l00253"></a>00253 fsg_model_null_trans
<a name="l00254"></a>00254 (fsg, tl1->from_state,
<a name="l00255"></a>00255 tl2->to_state));
<a name="l00256"></a>00256 n++;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262 } <span class="keywordflow">while</span> (updated);
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"%d null transitions added\n"</span>, n);
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="keywordflow">return</span> nulls;
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00270"></a>00270 fsg_model_trans(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, int32 i, int32 j)
<a name="l00271"></a>00271 {
<a name="l00272"></a>00272 <span class="keywordtype">void</span> *val;
<a name="l00273"></a>00273
<a name="l00274"></a>00274 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans == NULL)
<a name="l00275"></a>00275 <span class="keywordflow">return</span> NULL;
<a name="l00276"></a>00276 <span class="keywordflow">if</span> (<a class="code" href="hash__table_8h.html#a91f5b3924c0e3a50f94c86bb5fd078e8" title="Like hash_lookup, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_lookup_bkey</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans, (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&j,
<a name="l00277"></a>00277 <span class="keyword">sizeof</span>(j), &val) < 0)
<a name="l00278"></a>00278 <span class="keywordflow">return</span> NULL;
<a name="l00279"></a>00279 <span class="keywordflow">return</span> (<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>)val;
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *
<a name="l00283"></a>00283 fsg_model_null_trans(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, int32 i, int32 j)
<a name="l00284"></a>00284 {
<a name="l00285"></a>00285 <span class="keywordtype">void</span> *val;
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans == NULL)
<a name="l00288"></a>00288 <span class="keywordflow">return</span> NULL;
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (<a class="code" href="hash__table_8h.html#a91f5b3924c0e3a50f94c86bb5fd078e8" title="Like hash_lookup, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_lookup_bkey</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans, (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&j,
<a name="l00290"></a>00290 <span class="keyword">sizeof</span>(j), &val) < 0)
<a name="l00291"></a>00291 <span class="keywordflow">return</span> NULL;
<a name="l00292"></a>00292 <span class="keywordflow">return</span> (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *)val;
<a name="l00293"></a>00293 }
<a name="l00294"></a>00294
<a name="l00295"></a>00295 <a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *
<a name="l00296"></a>00296 fsg_model_arcs(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, int32 i)
<a name="l00297"></a>00297 {
<a name="l00298"></a>00298 <a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor;
<a name="l00299"></a>00299
<a name="l00300"></a>00300 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans == NULL && fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans == NULL)
<a name="l00301"></a>00301 <span class="keywordflow">return</span> NULL;
<a name="l00302"></a>00302 itor = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(1, <span class="keyword">sizeof</span>(*itor));
<a name="l00303"></a>00303 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans)
<a name="l00304"></a>00304 itor->null_itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans);
<a name="l00305"></a>00305 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans)
<a name="l00306"></a>00306 itor->itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans);
<a name="l00307"></a>00307 <span class="keywordflow">if</span> (itor->itor != NULL)
<a name="l00308"></a>00308 itor->gn = <a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor->itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00309"></a>00309 <span class="keywordflow">return</span> itor;
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *
<a name="l00313"></a>00313 fsg_arciter_get(<a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor)
<a name="l00314"></a>00314 {
<a name="l00315"></a>00315 <span class="comment">/* Iterate over non-null arcs first. */</span>
<a name="l00316"></a>00316 <span class="keywordflow">if</span> (itor->gn)
<a name="l00317"></a>00317 <span class="keywordflow">return</span> (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *)<a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(itor->gn);
<a name="l00318"></a>00318 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (itor->null_itor)
<a name="l00319"></a>00319 <span class="keywordflow">return</span> (<a class="code" href="structfsg__link__s.html">fsg_link_t</a> *)<a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor->null_itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00320"></a>00320 <span class="keywordflow">else</span>
<a name="l00321"></a>00321 <span class="keywordflow">return</span> NULL;
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323
<a name="l00324"></a>00324 <a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *
<a name="l00325"></a>00325 fsg_arciter_next(<a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor)
<a name="l00326"></a>00326 {
<a name="l00327"></a>00327 <span class="comment">/* Iterate over non-null arcs first. */</span>
<a name="l00328"></a>00328 <span class="keywordflow">if</span> (itor->gn) {
<a name="l00329"></a>00329 itor->gn = gnode_next(itor->gn);
<a name="l00330"></a>00330 <span class="comment">/* Move to the next destination arc. */</span>
<a name="l00331"></a>00331 <span class="keywordflow">if</span> (itor->gn == NULL) {
<a name="l00332"></a>00332 itor->itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor->itor);
<a name="l00333"></a>00333 <span class="keywordflow">if</span> (itor->itor != NULL)
<a name="l00334"></a>00334 itor->gn = <a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor->itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00335"></a>00335 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (itor->null_itor == NULL)
<a name="l00336"></a>00336 <span class="keywordflow">goto</span> stop_iteration;
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339 <span class="keywordflow">else</span> {
<a name="l00340"></a>00340 <span class="keywordflow">if</span> (itor->null_itor == NULL)
<a name="l00341"></a>00341 <span class="keywordflow">goto</span> stop_iteration;
<a name="l00342"></a>00342 itor->null_itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor->null_itor);
<a name="l00343"></a>00343 <span class="keywordflow">if</span> (itor->null_itor == NULL)
<a name="l00344"></a>00344 <span class="keywordflow">goto</span> stop_iteration;
<a name="l00345"></a>00345 }
<a name="l00346"></a>00346 <span class="keywordflow">return</span> itor;
<a name="l00347"></a>00347 stop_iteration:
<a name="l00348"></a>00348 fsg_arciter_free(itor);
<a name="l00349"></a>00349 <span class="keywordflow">return</span> NULL;
<a name="l00350"></a>00350
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="keywordtype">void</span>
<a name="l00354"></a>00354 fsg_arciter_free(<a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor)
<a name="l00355"></a>00355 {
<a name="l00356"></a>00356 <span class="keywordflow">if</span> (itor == NULL)
<a name="l00357"></a>00357 <span class="keywordflow">return</span>;
<a name="l00358"></a>00358 <a class="code" href="hash__table_8h.html#a7aa43b228d7dc24f5221d281debeb025" title="Delete an unfinished iterator.">hash_table_iter_free</a>(itor->null_itor);
<a name="l00359"></a>00359 <a class="code" href="hash__table_8h.html#a7aa43b228d7dc24f5221d281debeb025" title="Delete an unfinished iterator.">hash_table_iter_free</a>(itor->itor);
<a name="l00360"></a>00360 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(itor);
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="keywordtype">int</span>
<a name="l00364"></a>00364 fsg_model_word_id(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *word)
<a name="l00365"></a>00365 {
<a name="l00366"></a>00366 <span class="keywordtype">int</span> wid;
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="comment">/* Search for an existing word matching this. */</span>
<a name="l00369"></a>00369 <span class="keywordflow">for</span> (wid = 0; wid < fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>; ++wid) {
<a name="l00370"></a>00370 <span class="keywordflow">if</span> (0 == strcmp(fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>[wid], word))
<a name="l00371"></a>00371 <span class="keywordflow">break</span>;
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373 <span class="comment">/* If not found, add this to the vocab. */</span>
<a name="l00374"></a>00374 <span class="keywordflow">if</span> (wid == fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>)
<a name="l00375"></a>00375 <span class="keywordflow">return</span> -1;
<a name="l00376"></a>00376 <span class="keywordflow">return</span> wid;
<a name="l00377"></a>00377 }
<a name="l00378"></a>00378
<a name="l00379"></a>00379 <span class="keywordtype">int</span>
<a name="l00380"></a>00380 fsg_model_word_add(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *word)
<a name="l00381"></a>00381 {
<a name="l00382"></a>00382 <span class="keywordtype">int</span> wid;
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="comment">/* Search for an existing word matching this. */</span>
<a name="l00385"></a>00385 wid = fsg_model_word_id(fsg, word);
<a name="l00386"></a>00386 <span class="comment">/* If not found, add this to the vocab. */</span>
<a name="l00387"></a>00387 <span class="keywordflow">if</span> (wid == -1) {
<a name="l00388"></a>00388 wid = fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>;
<a name="l00389"></a>00389 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a> == fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>) {
<a name="l00390"></a>00390 fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a> += 10;
<a name="l00391"></a>00391 fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a> = <a class="code" href="ckd__alloc_8h.html#afd496738b3e114bd494c5a0955f1bfb3" title="Macro for __ckd_realloc__.">ckd_realloc</a>(fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>,
<a name="l00392"></a>00392 fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a> * <span class="keyword">sizeof</span>(*fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>));
<a name="l00393"></a>00393 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a>)
<a name="l00394"></a>00394 fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a> = <a class="code" href="bitvec_8h.html#ae53ebce7c4c616fdc601e8306aebcc4b" title="Resize a bit vector.">bitvec_realloc</a>(fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a>, fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>);
<a name="l00395"></a>00395 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a>)
<a name="l00396"></a>00396 fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a> = <a class="code" href="bitvec_8h.html#ae53ebce7c4c616fdc601e8306aebcc4b" title="Resize a bit vector.">bitvec_realloc</a>(fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a>, fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>);
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398 ++fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>;
<a name="l00399"></a>00399 fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>[wid] = <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(word);
<a name="l00400"></a>00400 }
<a name="l00401"></a>00401 <span class="keywordflow">return</span> wid;
<a name="l00402"></a>00402 }
<a name="l00403"></a>00403
<a name="l00404"></a>00404 <span class="keywordtype">int</span>
<a name="l00405"></a>00405 fsg_model_add_silence(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *silword,
<a name="l00406"></a>00406 <span class="keywordtype">int</span> state, float32 silprob)
<a name="l00407"></a>00407 {
<a name="l00408"></a>00408 int32 logsilp;
<a name="l00409"></a>00409 <span class="keywordtype">int</span> n_trans, silwid, src;
<a name="l00410"></a>00410
<a name="l00411"></a>00411 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Adding silence transitions for %s to FSG\n"</span>, silword);
<a name="l00412"></a>00412
<a name="l00413"></a>00413 silwid = fsg_model_word_add(fsg, silword);
<a name="l00414"></a>00414 logsilp = (int32) (<a class="code" href="logmath_8h.html#aebb4711268322fa7aec31e5798fe7e90" title="Convert linear floating point number to integer log in base B.">logmath_log</a>(fsg-><a class="code" href="structfsg__model__s.html#ab0b22dadb593ee1901829f89c4a47fe2" title="Pointer to log math computation object.">lmath</a>, silprob) * fsg-><a class="code" href="structfsg__model__s.html#aeaff529953d494b9891dbc0fdac8e97f" title="Language weight that&#39;s been applied to transition logprobs.">lw</a>);
<a name="l00415"></a>00415 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a> == NULL)
<a name="l00416"></a>00416 fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a> = <a class="code" href="bitvec_8h.html#a866043a7ac23e137f6c2f2466f4abc70" title="Allocate a bit vector.">bitvec_alloc</a>(fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>);
<a name="l00417"></a>00417 <a class="code" href="bitvec_8h.html#ae90878b8f2316f5733d83a3f47d378ac" title="Set the b-th bit of bit vector v.">bitvec_set</a>(fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a>, silwid);
<a name="l00418"></a>00418
<a name="l00419"></a>00419 n_trans = 0;
<a name="l00420"></a>00420 <span class="keywordflow">if</span> (state == -1) {
<a name="l00421"></a>00421 <span class="keywordflow">for</span> (src = 0; src < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; src++) {
<a name="l00422"></a>00422 fsg_model_trans_add(fsg, src, src, logsilp, silwid);
<a name="l00423"></a>00423 ++n_trans;
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425 }
<a name="l00426"></a>00426 <span class="keywordflow">else</span> {
<a name="l00427"></a>00427 fsg_model_trans_add(fsg, state, state, logsilp, silwid);
<a name="l00428"></a>00428 ++n_trans;
<a name="l00429"></a>00429 }
<a name="l00430"></a>00430
<a name="l00431"></a>00431 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Added %d silence word transitions\n"</span>, n_trans);
<a name="l00432"></a>00432 <span class="keywordflow">return</span> n_trans;
<a name="l00433"></a>00433 }
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="keywordtype">int</span>
<a name="l00436"></a>00436 fsg_model_add_alt(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *baseword,
<a name="l00437"></a>00437 <span class="keywordtype">char</span> <span class="keyword">const</span> *altword)
<a name="l00438"></a>00438 {
<a name="l00439"></a>00439 <span class="keywordtype">int</span> i, basewid, altwid;
<a name="l00440"></a>00440 <span class="keywordtype">int</span> ntrans;
<a name="l00441"></a>00441
<a name="l00442"></a>00442 <span class="comment">/* FIXME: This will get slow, eventually... */</span>
<a name="l00443"></a>00443 <span class="keywordflow">for</span> (basewid = 0; basewid < fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>; ++basewid)
<a name="l00444"></a>00444 <span class="keywordflow">if</span> (0 == strcmp(fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>[basewid], baseword))
<a name="l00445"></a>00445 <span class="keywordflow">break</span>;
<a name="l00446"></a>00446 <span class="keywordflow">if</span> (basewid == fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>) {
<a name="l00447"></a>00447 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Base word %s not present in FSG vocabulary!\n"</span>, baseword);
<a name="l00448"></a>00448 <span class="keywordflow">return</span> -1;
<a name="l00449"></a>00449 }
<a name="l00450"></a>00450 altwid = fsg_model_word_add(fsg, altword);
<a name="l00451"></a>00451 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a> == NULL)
<a name="l00452"></a>00452 fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a> = <a class="code" href="bitvec_8h.html#a866043a7ac23e137f6c2f2466f4abc70" title="Allocate a bit vector.">bitvec_alloc</a>(fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>);
<a name="l00453"></a>00453 <a class="code" href="bitvec_8h.html#ae90878b8f2316f5733d83a3f47d378ac" title="Set the b-th bit of bit vector v.">bitvec_set</a>(fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a>, altwid);
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <a class="code" href="err_8h.html#af46f94d0e21f22f1153f8f1cd9a372d6" title="Print debugging information to standard error stream.">E_DEBUG</a>(2,(<span class="stringliteral">"Adding alternate word transitions (%s,%s) to FSG\n"</span>,
<a name="l00456"></a>00456 baseword, altword));
<a name="l00457"></a>00457
<a name="l00458"></a>00458 <span class="comment">/* Look for all transitions involving baseword and duplicate them. */</span>
<a name="l00459"></a>00459 <span class="comment">/* FIXME: This will also get slow, eventually... */</span>
<a name="l00460"></a>00460 ntrans = 0;
<a name="l00461"></a>00461 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; ++i) {
<a name="l00462"></a>00462 <a class="code" href="structhash__iter__s.html">hash_iter_t</a> *itor;
<a name="l00463"></a>00463 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans == NULL)
<a name="l00464"></a>00464 <span class="keywordflow">continue</span>;
<a name="l00465"></a>00465 <span class="keywordflow">for</span> (itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans); itor;
<a name="l00466"></a>00466 itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor)) {
<a name="l00467"></a>00467 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> trans;
<a name="l00468"></a>00468 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00469"></a>00469
<a name="l00470"></a>00470 trans = <a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00471"></a>00471 <span class="keywordflow">for</span> (gn = trans; gn; gn = gnode_next(gn)) {
<a name="l00472"></a>00472 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *fl = <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn);
<a name="l00473"></a>00473 <span class="keywordflow">if</span> (fl-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> == basewid) {
<a name="l00474"></a>00474 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *link;
<a name="l00475"></a>00475
<a name="l00476"></a>00476 <span class="comment">/* Create transition object */</span>
<a name="l00477"></a>00477 link = <a class="code" href="listelem__alloc_8h.html#ad0c40e65d9cca0d7ec08fcf416b09af2" title="Allocate a list element and return pointer to it.">listelem_malloc</a>(fsg-><a class="code" href="structfsg__model__s.html#ac4e2a36305bbe62a5c7468588eb058b1" title="Allocator for FSG links.">link_alloc</a>);
<a name="l00478"></a>00478 link->from_state = fl->from_state;
<a name="l00479"></a>00479 link->to_state = fl->to_state;
<a name="l00480"></a>00480 link-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> = fl-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a>; <span class="comment">/* FIXME!!!??? */</span>
<a name="l00481"></a>00481 link-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> = altwid;
<a name="l00482"></a>00482
<a name="l00483"></a>00483 trans =
<a name="l00484"></a>00484 <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(trans, (<span class="keywordtype">void</span> *) link);
<a name="l00485"></a>00485 ++ntrans;
<a name="l00486"></a>00486 }
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488 <a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>) = trans;
<a name="l00489"></a>00489 }
<a name="l00490"></a>00490 }
<a name="l00491"></a>00491
<a name="l00492"></a>00492 <a class="code" href="err_8h.html#af46f94d0e21f22f1153f8f1cd9a372d6" title="Print debugging information to standard error stream.">E_DEBUG</a>(2,(<span class="stringliteral">"Added %d alternate word transitions\n"</span>, ntrans));
<a name="l00493"></a>00493 <span class="keywordflow">return</span> ntrans;
<a name="l00494"></a>00494 }
<a name="l00495"></a>00495
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *
<a name="l00498"></a>00498 fsg_model_init(<span class="keywordtype">char</span> <span class="keyword">const</span> *name, <a class="code" href="structlogmath__s.html">logmath_t</a> *lmath, float32 lw, int32 n_state)
<a name="l00499"></a>00499 {
<a name="l00500"></a>00500 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg;
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="comment">/* Allocate basic stuff. */</span>
<a name="l00503"></a>00503 fsg = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(1, <span class="keyword">sizeof</span>(*fsg));
<a name="l00504"></a>00504 fsg-><a class="code" href="structfsg__model__s.html#af329127556a42f6ea3b27f41a99a0b17" title="Reference count.">refcount</a> = 1;
<a name="l00505"></a>00505 fsg-><a class="code" href="structfsg__model__s.html#ac4e2a36305bbe62a5c7468588eb058b1" title="Allocator for FSG links.">link_alloc</a> = <a class="code" href="listelem__alloc_8h.html#a4b08b49eaa74cbe9a3c95170cee78de7" title="Initialize and return a list element allocator.">listelem_alloc_init</a>(<span class="keyword">sizeof</span>(<a class="code" href="structfsg__link__s.html">fsg_link_t</a>));
<a name="l00506"></a>00506 fsg-><a class="code" href="structfsg__model__s.html#ab0b22dadb593ee1901829f89c4a47fe2" title="Pointer to log math computation object.">lmath</a> = lmath;
<a name="l00507"></a>00507 fsg-><a class="code" href="structfsg__model__s.html#ab23ae2c362f1a3b18bbe135b97dfb467" title="A unique string identifier for this FSG.">name</a> = name ? <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(name) : NULL;
<a name="l00508"></a>00508 fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a> = n_state;
<a name="l00509"></a>00509 fsg-><a class="code" href="structfsg__model__s.html#aeaff529953d494b9891dbc0fdac8e97f" title="Language weight that&#39;s been applied to transition logprobs.">lw</a> = lw;
<a name="l00510"></a>00510
<a name="l00511"></a>00511 fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a> = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>, <span class="keyword">sizeof</span>(*fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>));
<a name="l00512"></a>00512
<a name="l00513"></a>00513 <span class="keywordflow">return</span> fsg;
<a name="l00514"></a>00514 }
<a name="l00515"></a>00515
<a name="l00516"></a>00516 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *
<a name="l00517"></a>00517 fsg_model_read(FILE * fp, <a class="code" href="structlogmath__s.html">logmath_t</a> *lmath, float32 lw)
<a name="l00518"></a>00518 {
<a name="l00519"></a>00519 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg;
<a name="l00520"></a>00520 <a class="code" href="structhash__table__t.html">hash_table_t</a> *vocab;
<a name="l00521"></a>00521 <a class="code" href="structhash__iter__s.html">hash_iter_t</a> *itor;
<a name="l00522"></a>00522 int32 lastwid;
<a name="l00523"></a>00523 <span class="keywordtype">char</span> **wordptr;
<a name="l00524"></a>00524 <span class="keywordtype">char</span> *lineptr;
<a name="l00525"></a>00525 <span class="keywordtype">char</span> *fsgname;
<a name="l00526"></a>00526 int32 lineno;
<a name="l00527"></a>00527 int32 n, i, j;
<a name="l00528"></a>00528 <span class="keywordtype">int</span> n_state, n_trans, n_null_trans;
<a name="l00529"></a>00529 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> nulls;
<a name="l00530"></a>00530 float32 p;
<a name="l00531"></a>00531
<a name="l00532"></a>00532 lineno = 0;
<a name="l00533"></a>00533 vocab = <a class="code" href="hash__table_8h.html#a56d93e8c03e066b77377ac6eab50cfae" title="Allocate a new hash table for a given expected size.">hash_table_new</a>(32, FALSE);
<a name="l00534"></a>00534 wordptr = NULL;
<a name="l00535"></a>00535 lineptr = NULL;
<a name="l00536"></a>00536 nulls = NULL;
<a name="l00537"></a>00537 fsgname = NULL;
<a name="l00538"></a>00538 fsg = NULL;
<a name="l00539"></a>00539
<a name="l00540"></a>00540 <span class="comment">/* Scan upto FSG_BEGIN header */</span>
<a name="l00541"></a>00541 <span class="keywordflow">for</span> (;;) {
<a name="l00542"></a>00542 n = nextline_str2words(fp, &lineno, &lineptr, &wordptr);
<a name="l00543"></a>00543 <span class="keywordflow">if</span> (n < 0) {
<a name="l00544"></a>00544 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"%s declaration missing\n"</span>, FSG_MODEL_BEGIN_DECL);
<a name="l00545"></a>00545 <span class="keywordflow">goto</span> parse_error;
<a name="l00546"></a>00546 }
<a name="l00547"></a>00547
<a name="l00548"></a>00548 <span class="keywordflow">if</span> ((strcmp(wordptr[0], FSG_MODEL_BEGIN_DECL) == 0)) {
<a name="l00549"></a>00549 <span class="keywordflow">if</span> (n > 2) {
<a name="l00550"></a>00550 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Line[%d]: malformed FSG_BEGIN declaration\n"</span>,
<a name="l00551"></a>00551 lineno);
<a name="l00552"></a>00552 <span class="keywordflow">goto</span> parse_error;
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554 <span class="keywordflow">break</span>;
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556 }
<a name="l00557"></a>00557 <span class="comment">/* Save FSG name, or it will get clobbered below :(.</span>
<a name="l00558"></a>00558 <span class="comment"> * If name is missing, try the default.</span>
<a name="l00559"></a>00559 <span class="comment"> */</span>
<a name="l00560"></a>00560 <span class="keywordflow">if</span> (n == 2) {
<a name="l00561"></a>00561 fsgname = <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(wordptr[1]);
<a name="l00562"></a>00562 } <span class="keywordflow">else</span> {
<a name="l00563"></a>00563 <a class="code" href="err_8h.html#a6a794bec721b555ac1f2167f9e12f662" title="Print warning information to standard error stream.">E_WARN</a> (<span class="stringliteral">"FSG name is missing\n"</span>);
<a name="l00564"></a>00564 fsgname = <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(<span class="stringliteral">"unknown"</span>);
<a name="l00565"></a>00565 }
<a name="l00566"></a>00566
<a name="l00567"></a>00567 <span class="comment">/* Read #states */</span>
<a name="l00568"></a>00568 n = nextline_str2words(fp, &lineno, &lineptr, &wordptr);
<a name="l00569"></a>00569 <span class="keywordflow">if</span> ((n != 2)
<a name="l00570"></a>00570 || ((strcmp(wordptr[0], FSG_MODEL_N_DECL) != 0)
<a name="l00571"></a>00571 && (strcmp(wordptr[0], FSG_MODEL_NUM_STATES_DECL) != 0))
<a name="l00572"></a>00572 || (sscanf(wordptr[1], <span class="stringliteral">"%d"</span>, &n_state) != 1)
<a name="l00573"></a>00573 || (n_state <= 0)) {
<a name="l00574"></a>00574 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>
<a name="l00575"></a>00575 (<span class="stringliteral">"Line[%d]: #states declaration line missing or malformed\n"</span>,
<a name="l00576"></a>00576 lineno);
<a name="l00577"></a>00577 <span class="keywordflow">goto</span> parse_error;
<a name="l00578"></a>00578 }
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="comment">/* Now create the FSG. */</span>
<a name="l00581"></a>00581 fsg = fsg_model_init(fsgname, lmath, lw, n_state);
<a name="l00582"></a>00582 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsgname);
<a name="l00583"></a>00583 fsgname = NULL;
<a name="l00584"></a>00584
<a name="l00585"></a>00585 <span class="comment">/* Read start state */</span>
<a name="l00586"></a>00586 n = nextline_str2words(fp, &lineno, &lineptr, &wordptr);
<a name="l00587"></a>00587 <span class="keywordflow">if</span> ((n != 2)
<a name="l00588"></a>00588 || ((strcmp(wordptr[0], FSG_MODEL_S_DECL) != 0)
<a name="l00589"></a>00589 && (strcmp(wordptr[0], FSG_MODEL_START_STATE_DECL) != 0))
<a name="l00590"></a>00590 || (sscanf(wordptr[1], <span class="stringliteral">"%d"</span>, &(fsg-><a class="code" href="structfsg__model__s.html#a4ff49da3938ecc236d45a68d009f97b9" title="Must be in the range [0..n_state-1].">start_state</a>)) != 1)
<a name="l00591"></a>00591 || (fsg-><a class="code" href="structfsg__model__s.html#a4ff49da3938ecc236d45a68d009f97b9" title="Must be in the range [0..n_state-1].">start_state</a> < 0)
<a name="l00592"></a>00592 || (fsg-><a class="code" href="structfsg__model__s.html#a4ff49da3938ecc236d45a68d009f97b9" title="Must be in the range [0..n_state-1].">start_state</a> >= fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>)) {
<a name="l00593"></a>00593 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>
<a name="l00594"></a>00594 (<span class="stringliteral">"Line[%d]: start state declaration line missing or malformed\n"</span>,
<a name="l00595"></a>00595 lineno);
<a name="l00596"></a>00596 <span class="keywordflow">goto</span> parse_error;
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598
<a name="l00599"></a>00599 <span class="comment">/* Read final state */</span>
<a name="l00600"></a>00600 n = nextline_str2words(fp, &lineno, &lineptr, &wordptr);
<a name="l00601"></a>00601 <span class="keywordflow">if</span> ((n != 2)
<a name="l00602"></a>00602 || ((strcmp(wordptr[0], FSG_MODEL_F_DECL) != 0)
<a name="l00603"></a>00603 && (strcmp(wordptr[0], FSG_MODEL_FINAL_STATE_DECL) != 0))
<a name="l00604"></a>00604 || (sscanf(wordptr[1], <span class="stringliteral">"%d"</span>, &(fsg-><a class="code" href="structfsg__model__s.html#ada19c76db4f1fc89c8b5cd674ec865da" title="Must be in the range [0..n_state-1].">final_state</a>)) != 1)
<a name="l00605"></a>00605 || (fsg-><a class="code" href="structfsg__model__s.html#ada19c76db4f1fc89c8b5cd674ec865da" title="Must be in the range [0..n_state-1].">final_state</a> < 0)
<a name="l00606"></a>00606 || (fsg-><a class="code" href="structfsg__model__s.html#ada19c76db4f1fc89c8b5cd674ec865da" title="Must be in the range [0..n_state-1].">final_state</a> >= fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>)) {
<a name="l00607"></a>00607 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>
<a name="l00608"></a>00608 (<span class="stringliteral">"Line[%d]: final state declaration line missing or malformed\n"</span>,
<a name="l00609"></a>00609 lineno);
<a name="l00610"></a>00610 <span class="keywordflow">goto</span> parse_error;
<a name="l00611"></a>00611 }
<a name="l00612"></a>00612
<a name="l00613"></a>00613 <span class="comment">/* Read transitions */</span>
<a name="l00614"></a>00614 lastwid = 0;
<a name="l00615"></a>00615 n_trans = n_null_trans = 0;
<a name="l00616"></a>00616 <span class="keywordflow">for</span> (;;) {
<a name="l00617"></a>00617 int32 wid, tprob;
<a name="l00618"></a>00618
<a name="l00619"></a>00619 n = nextline_str2words(fp, &lineno, &lineptr, &wordptr);
<a name="l00620"></a>00620 <span class="keywordflow">if</span> (n <= 0) {
<a name="l00621"></a>00621 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Line[%d]: transition or FSG_END statement expected\n"</span>,
<a name="l00622"></a>00622 lineno);
<a name="l00623"></a>00623 <span class="keywordflow">goto</span> parse_error;
<a name="l00624"></a>00624 }
<a name="l00625"></a>00625
<a name="l00626"></a>00626 <span class="keywordflow">if</span> ((strcmp(wordptr[0], FSG_MODEL_END_DECL) == 0)) {
<a name="l00627"></a>00627 <span class="keywordflow">break</span>;
<a name="l00628"></a>00628 }
<a name="l00629"></a>00629
<a name="l00630"></a>00630 <span class="keywordflow">if</span> ((strcmp(wordptr[0], FSG_MODEL_T_DECL) == 0)
<a name="l00631"></a>00631 || (strcmp(wordptr[0], FSG_MODEL_TRANSITION_DECL) == 0)) {
<a name="l00632"></a>00632
<a name="l00633"></a>00633
<a name="l00634"></a>00634 <span class="keywordflow">if</span> (((n != 4) && (n != 5))
<a name="l00635"></a>00635 || (sscanf(wordptr[1], <span class="stringliteral">"%d"</span>, &i) != 1)
<a name="l00636"></a>00636 || (sscanf(wordptr[2], <span class="stringliteral">"%d"</span>, &j) != 1)
<a name="l00637"></a>00637 || (i < 0) || (i >= fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>)
<a name="l00638"></a>00638 || (j < 0) || (j >= fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>)) {
<a name="l00639"></a>00639 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>
<a name="l00640"></a>00640 (<span class="stringliteral">"Line[%d]: transition spec malformed; Expecting: from-state to-state trans-prob [word]\n"</span>,
<a name="l00641"></a>00641 lineno);
<a name="l00642"></a>00642 <span class="keywordflow">goto</span> parse_error;
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644
<a name="l00645"></a>00645 p = <a class="code" href="strfuncs_8h.html#ab708351fe7308551632a782bfad75a1e" title="Locale independent version of atof().">atof_c</a>(wordptr[3]);
<a name="l00646"></a>00646 <span class="keywordflow">if</span> ((p <= 0.0) || (p > 1.0)) {
<a name="l00647"></a>00647 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>
<a name="l00648"></a>00648 (<span class="stringliteral">"Line[%d]: transition spec malformed; Expecting float as transition probability\n"</span>,
<a name="l00649"></a>00649 lineno);
<a name="l00650"></a>00650 <span class="keywordflow">goto</span> parse_error;
<a name="l00651"></a>00651 }
<a name="l00652"></a>00652 }
<a name="l00653"></a>00653 <span class="keywordflow">else</span> {
<a name="l00654"></a>00654 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Line[%d]: transition or FSG_END statement expected\n"</span>,
<a name="l00655"></a>00655 lineno);
<a name="l00656"></a>00656 <span class="keywordflow">goto</span> parse_error;
<a name="l00657"></a>00657 }
<a name="l00658"></a>00658
<a name="l00659"></a>00659 tprob = (int32)(<a class="code" href="logmath_8h.html#aebb4711268322fa7aec31e5798fe7e90" title="Convert linear floating point number to integer log in base B.">logmath_log</a>(lmath, p) * fsg-><a class="code" href="structfsg__model__s.html#aeaff529953d494b9891dbc0fdac8e97f" title="Language weight that&#39;s been applied to transition logprobs.">lw</a>);
<a name="l00660"></a>00660 <span class="comment">/* Add word to "dictionary". */</span>
<a name="l00661"></a>00661 <span class="keywordflow">if</span> (n > 4) {
<a name="l00662"></a>00662 <span class="keywordflow">if</span> (<a class="code" href="hash__table_8h.html#acaf27e8e7e336faf6653649937c42ed8" title="Look up a 32-bit integer value in a hash table.">hash_table_lookup_int32</a>(vocab, wordptr[4], &wid) < 0) {
<a name="l00663"></a>00663 (void)<a class="code" href="hash__table_8h.html#a393c56322e54607a48e6bc61169d92bf" title="Add a 32-bit integer value to a hash table.">hash_table_enter_int32</a>(vocab, <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(wordptr[4]), lastwid);
<a name="l00664"></a>00664 wid = lastwid;
<a name="l00665"></a>00665 ++lastwid;
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 fsg_model_trans_add(fsg, i, j, tprob, wid);
<a name="l00668"></a>00668 ++n_trans;
<a name="l00669"></a>00669 }
<a name="l00670"></a>00670 <span class="keywordflow">else</span> {
<a name="l00671"></a>00671 <span class="keywordflow">if</span> (fsg_model_null_trans_add(fsg, i, j, tprob) == 1) {
<a name="l00672"></a>00672 ++n_null_trans;
<a name="l00673"></a>00673 nulls = <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(nulls, fsg_model_null_trans(fsg, i, j));
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675 }
<a name="l00676"></a>00676 }
<a name="l00677"></a>00677
<a name="l00678"></a>00678 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"FSG: %d states, %d unique words, %d transitions (%d null)\n"</span>,
<a name="l00679"></a>00679 fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>, hash_table_inuse(vocab), n_trans, n_null_trans);
<a name="l00680"></a>00680
<a name="l00681"></a>00681 <span class="comment">/* Do transitive closure on null transitions */</span>
<a name="l00682"></a>00682 nulls = fsg_model_null_trans_closure(fsg, nulls);
<a name="l00683"></a>00683 <a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c" title="Free the given generic list; user-defined data contained within is not automatically freed...">glist_free</a>(nulls);
<a name="l00684"></a>00684
<a name="l00685"></a>00685 <span class="comment">/* Now create a string table from the "dictionary" */</span>
<a name="l00686"></a>00686 fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a> = hash_table_inuse(vocab);
<a name="l00687"></a>00687 fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a> = fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a> + 10; <span class="comment">/* Pad it a bit. */</span>
<a name="l00688"></a>00688 fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a> = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(fsg-><a class="code" href="structfsg__model__s.html#a329ae88c26111df8cd64657b46b9108f" title="Number of words allocated in vocab.">n_word_alloc</a>, <span class="keyword">sizeof</span>(*fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>));
<a name="l00689"></a>00689 <span class="keywordflow">for</span> (itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(vocab); itor; itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor)) {
<a name="l00690"></a>00690 <span class="keywordtype">char</span> <span class="keyword">const</span> *word = hash_entry_key(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00691"></a>00691 int32 wid = (int32)(<span class="keywordtype">long</span>)<a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00692"></a>00692 fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>[wid] = (<span class="keywordtype">char</span> *)word;
<a name="l00693"></a>00693 }
<a name="l00694"></a>00694 <a class="code" href="hash__table_8h.html#a0a588c22946f8cc16328973035ed19e3" title="Free the specified hash table; the caller is responsible for freeing the key strings pointed to by th...">hash_table_free</a>(vocab);
<a name="l00695"></a>00695 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(lineptr);
<a name="l00696"></a>00696 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(wordptr);
<a name="l00697"></a>00697
<a name="l00698"></a>00698 <span class="keywordflow">return</span> fsg;
<a name="l00699"></a>00699
<a name="l00700"></a>00700 parse_error:
<a name="l00701"></a>00701 <span class="keywordflow">for</span> (itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(vocab); itor; itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor))
<a name="l00702"></a>00702 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>((<span class="keywordtype">char</span> *)hash_entry_key(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>));
<a name="l00703"></a>00703 <a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c" title="Free the given generic list; user-defined data contained within is not automatically freed...">glist_free</a>(nulls);
<a name="l00704"></a>00704 <a class="code" href="hash__table_8h.html#a0a588c22946f8cc16328973035ed19e3" title="Free the specified hash table; the caller is responsible for freeing the key strings pointed to by th...">hash_table_free</a>(vocab);
<a name="l00705"></a>00705 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsgname);
<a name="l00706"></a>00706 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(lineptr);
<a name="l00707"></a>00707 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(wordptr);
<a name="l00708"></a>00708 fsg_model_free(fsg);
<a name="l00709"></a>00709 <span class="keywordflow">return</span> NULL;
<a name="l00710"></a>00710 }
<a name="l00711"></a>00711
<a name="l00712"></a>00712
<a name="l00713"></a>00713 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *
<a name="l00714"></a>00714 fsg_model_readfile(<span class="keyword">const</span> <span class="keywordtype">char</span> *file, <a class="code" href="structlogmath__s.html">logmath_t</a> *lmath, float32 lw)
<a name="l00715"></a>00715 {
<a name="l00716"></a>00716 FILE *fp;
<a name="l00717"></a>00717 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg;
<a name="l00718"></a>00718
<a name="l00719"></a>00719 <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"r"</span>)) == NULL) {
<a name="l00720"></a>00720 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to open FSG file '%s' for reading: %s\n"</span>, file, strerror(errno));
<a name="l00721"></a>00721 <span class="keywordflow">return</span> NULL;
<a name="l00722"></a>00722 }
<a name="l00723"></a>00723 fsg = fsg_model_read(fp, lmath, lw);
<a name="l00724"></a>00724 fclose(fp);
<a name="l00725"></a>00725 <span class="keywordflow">return</span> fsg;
<a name="l00726"></a>00726 }
<a name="l00727"></a>00727
<a name="l00728"></a>00728 <a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *
<a name="l00729"></a>00729 fsg_model_retain(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg)
<a name="l00730"></a>00730 {
<a name="l00731"></a>00731 ++fsg-><a class="code" href="structfsg__model__s.html#af329127556a42f6ea3b27f41a99a0b17" title="Reference count.">refcount</a>;
<a name="l00732"></a>00732 <span class="keywordflow">return</span> fsg;
<a name="l00733"></a>00733 }
<a name="l00734"></a>00734
<a name="l00735"></a>00735 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00736"></a>00736 trans_list_free(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, int32 i)
<a name="l00737"></a>00737 {
<a name="l00738"></a>00738 <a class="code" href="structhash__iter__s.html">hash_iter_t</a> *itor;
<a name="l00739"></a>00739
<a name="l00740"></a>00740 <span class="comment">/* FIXME (maybe): FSG links will all get freed when we call</span>
<a name="l00741"></a>00741 <span class="comment"> * listelem_alloc_free() so don't bother freeing them explicitly</span>
<a name="l00742"></a>00742 <span class="comment"> * here. */</span>
<a name="l00743"></a>00743 <span class="keywordflow">if</span> (fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans) {
<a name="l00744"></a>00744 <span class="keywordflow">for</span> (itor = <a class="code" href="hash__table_8h.html#aae6e6373d3c371d57861a9a875edb207" title="Start iterating over key-value pairs in a hash table.">hash_table_iter</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans);
<a name="l00745"></a>00745 itor; itor = <a class="code" href="hash__table_8h.html#ad023321efab26a30bd6d855fbdbe08a3" title="Get the next key-value pair in iteration.">hash_table_iter_next</a>(itor)) {
<a name="l00746"></a>00746 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> gl = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>)<a class="code" href="hash__table_8h.html#ac98525ff8ec582358783aecbd388842d" title="Access macros.">hash_entry_val</a>(itor-><a class="code" href="structhash__iter__s.html#a8aa7d6656a165e2e74c42ae4c48ed78f" title="Current entry in that table.">ent</a>);
<a name="l00747"></a>00747 <a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c" title="Free the given generic list; user-defined data contained within is not automatically freed...">glist_free</a>(gl);
<a name="l00748"></a>00748 }
<a name="l00749"></a>00749 }
<a name="l00750"></a>00750 <a class="code" href="hash__table_8h.html#a0a588c22946f8cc16328973035ed19e3" title="Free the specified hash table; the caller is responsible for freeing the key strings pointed to by th...">hash_table_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].trans);
<a name="l00751"></a>00751 <a class="code" href="hash__table_8h.html#a0a588c22946f8cc16328973035ed19e3" title="Free the specified hash table; the caller is responsible for freeing the key strings pointed to by th...">hash_table_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>[i].null_trans);
<a name="l00752"></a>00752 }
<a name="l00753"></a>00753
<a name="l00754"></a>00754 <span class="keywordtype">int</span>
<a name="l00755"></a>00755 fsg_model_free(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg)
<a name="l00756"></a>00756 {
<a name="l00757"></a>00757 <span class="keywordtype">int</span> i;
<a name="l00758"></a>00758
<a name="l00759"></a>00759 <span class="keywordflow">if</span> (fsg == NULL)
<a name="l00760"></a>00760 <span class="keywordflow">return</span> 0;
<a name="l00761"></a>00761
<a name="l00762"></a>00762 <span class="keywordflow">if</span> (--fsg-><a class="code" href="structfsg__model__s.html#af329127556a42f6ea3b27f41a99a0b17" title="Reference count.">refcount</a> > 0)
<a name="l00763"></a>00763 <span class="keywordflow">return</span> fsg-><a class="code" href="structfsg__model__s.html#af329127556a42f6ea3b27f41a99a0b17" title="Reference count.">refcount</a>;
<a name="l00764"></a>00764
<a name="l00765"></a>00765 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a99ed2894f7690a960d11e1590d11a6b9" title="Number of unique words in this FSG.">n_word</a>; ++i)
<a name="l00766"></a>00766 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>[i]);
<a name="l00767"></a>00767 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; ++i)
<a name="l00768"></a>00768 trans_list_free(fsg, i);
<a name="l00769"></a>00769 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ac5cd4b72818b7a9f2dc543d6a6ac9cc7" title="Transitions out of each state, if any.">trans</a>);
<a name="l00770"></a>00770 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsg-><a class="code" href="structfsg__model__s.html#a6bbfce2d672624d792ff964200a64031" title="Vocabulary for this FSG.">vocab</a>);
<a name="l00771"></a>00771 <a class="code" href="listelem__alloc_8h.html#a94c02e93a0abaa2bd79636cbac6cced2" title="Finalize and release all memory associated with a list element allocator.">listelem_alloc_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ac4e2a36305bbe62a5c7468588eb058b1" title="Allocator for FSG links.">link_alloc</a>);
<a name="l00772"></a>00772 <a class="code" href="bitvec_8h.html#a5628e35c88ac7e91b99dce916758824a" title="Free a bit vector.">bitvec_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ab5709e67c1b7506ab024f2060d50331c" title="Indicates which words are silence/fillers.">silwords</a>);
<a name="l00773"></a>00773 <a class="code" href="bitvec_8h.html#a5628e35c88ac7e91b99dce916758824a" title="Free a bit vector.">bitvec_free</a>(fsg-><a class="code" href="structfsg__model__s.html#adb51d840853d7ef3315bd833cddeb748" title="Indicates which words are pronunciation alternates.">altwords</a>);
<a name="l00774"></a>00774 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsg-><a class="code" href="structfsg__model__s.html#ab23ae2c362f1a3b18bbe135b97dfb467" title="A unique string identifier for this FSG.">name</a>);
<a name="l00775"></a>00775 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(fsg);
<a name="l00776"></a>00776 <span class="keywordflow">return</span> 0;
<a name="l00777"></a>00777 }
<a name="l00778"></a>00778
<a name="l00779"></a>00779
<a name="l00780"></a>00780 <span class="keywordtype">void</span>
<a name="l00781"></a>00781 fsg_model_write(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, FILE * fp)
<a name="l00782"></a>00782 {
<a name="l00783"></a>00783 int32 i;
<a name="l00784"></a>00784
<a name="l00785"></a>00785 fprintf(fp, <span class="stringliteral">"%s %s\n"</span>, FSG_MODEL_BEGIN_DECL, fsg-><a class="code" href="structfsg__model__s.html#ab23ae2c362f1a3b18bbe135b97dfb467" title="A unique string identifier for this FSG.">name</a> ? fsg-><a class="code" href="structfsg__model__s.html#ab23ae2c362f1a3b18bbe135b97dfb467" title="A unique string identifier for this FSG.">name</a> : <span class="stringliteral">""</span>);
<a name="l00786"></a>00786 fprintf(fp, <span class="stringliteral">"%s %d\n"</span>, FSG_MODEL_NUM_STATES_DECL, fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>);
<a name="l00787"></a>00787 fprintf(fp, <span class="stringliteral">"%s %d\n"</span>, FSG_MODEL_START_STATE_DECL, fsg-><a class="code" href="structfsg__model__s.html#a4ff49da3938ecc236d45a68d009f97b9" title="Must be in the range [0..n_state-1].">start_state</a>);
<a name="l00788"></a>00788 fprintf(fp, <span class="stringliteral">"%s %d\n"</span>, FSG_MODEL_FINAL_STATE_DECL, fsg-><a class="code" href="structfsg__model__s.html#ada19c76db4f1fc89c8b5cd674ec865da" title="Must be in the range [0..n_state-1].">final_state</a>);
<a name="l00789"></a>00789
<a name="l00790"></a>00790 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; i++) {
<a name="l00791"></a>00791 <a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor;
<a name="l00792"></a>00792
<a name="l00793"></a>00793 <span class="keywordflow">for</span> (itor = fsg_model_arcs(fsg, i); itor; itor = fsg_arciter_next(itor)) {
<a name="l00794"></a>00794 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *tl = fsg_arciter_get(itor);
<a name="l00795"></a>00795
<a name="l00796"></a>00796 fprintf(fp, <span class="stringliteral">"%s %d %d %f %s\n"</span>, FSG_MODEL_TRANSITION_DECL,
<a name="l00797"></a>00797 tl->from_state, tl->to_state,
<a name="l00798"></a>00798 <a class="code" href="logmath_8h.html#ae8b0a168e29e448c0d6de66dc46e099e" title="Convert integer log in base B to linear floating point.">logmath_exp</a>(fsg-><a class="code" href="structfsg__model__s.html#ab0b22dadb593ee1901829f89c4a47fe2" title="Pointer to log math computation object.">lmath</a>, (int32)(tl-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> / fsg-><a class="code" href="structfsg__model__s.html#aeaff529953d494b9891dbc0fdac8e97f" title="Language weight that&#39;s been applied to transition logprobs.">lw</a>)),
<a name="l00799"></a>00799 (tl-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> < 0) ? <span class="stringliteral">""</span> : fsg_model_word_str(fsg, tl-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a>));
<a name="l00800"></a>00800 }
<a name="l00801"></a>00801 }
<a name="l00802"></a>00802
<a name="l00803"></a>00803 fprintf(fp, <span class="stringliteral">"%s\n"</span>, FSG_MODEL_END_DECL);
<a name="l00804"></a>00804
<a name="l00805"></a>00805 fflush(fp);
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807
<a name="l00808"></a>00808 <span class="keywordtype">void</span>
<a name="l00809"></a>00809 fsg_model_writefile(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *file)
<a name="l00810"></a>00810 {
<a name="l00811"></a>00811 FILE *fp;
<a name="l00812"></a>00812
<a name="l00813"></a>00813 assert(fsg);
<a name="l00814"></a>00814
<a name="l00815"></a>00815 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Writing FSG file '%s'\n"</span>, file);
<a name="l00816"></a>00816
<a name="l00817"></a>00817 <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"w"</span>)) == NULL) {
<a name="l00818"></a>00818 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to open FSG file '%s' for reading: %s\n"</span>, file, strerror(errno));
<a name="l00819"></a>00819 <span class="keywordflow">return</span>;
<a name="l00820"></a>00820 }
<a name="l00821"></a>00821
<a name="l00822"></a>00822 fsg_model_write(fsg, fp);
<a name="l00823"></a>00823
<a name="l00824"></a>00824 fclose(fp);
<a name="l00825"></a>00825 }
<a name="l00826"></a>00826
<a name="l00827"></a>00827 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00828"></a>00828 fsg_model_write_fsm_trans(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">int</span> i, FILE *fp)
<a name="l00829"></a>00829 {
<a name="l00830"></a>00830 <a class="code" href="structfsg__arciter__s.html" title="Implementation of arc iterator.">fsg_arciter_t</a> *itor;
<a name="l00831"></a>00831
<a name="l00832"></a>00832 <span class="keywordflow">for</span> (itor = fsg_model_arcs(fsg, i); itor;
<a name="l00833"></a>00833 itor = fsg_arciter_next(itor)) {
<a name="l00834"></a>00834 <a class="code" href="structfsg__link__s.html">fsg_link_t</a> *tl = fsg_arciter_get(itor);
<a name="l00835"></a>00835 fprintf(fp, <span class="stringliteral">"%d %d %s %f\n"</span>,
<a name="l00836"></a>00836 tl->from_state, tl->to_state,
<a name="l00837"></a>00837 (tl-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a> < 0) ? <span class="stringliteral">"<eps>"</span> : fsg_model_word_str(fsg, tl-><a class="code" href="structfsg__link__s.html#a99b8eb916944d981adf2c492b8193d4e" title="Word-ID; &lt;0 if epsilon or null transition.">wid</a>),
<a name="l00838"></a>00838 -<a class="code" href="logmath_8h.html#a8035e176636eae8b4e02fe488f25457a" title="Convert integer log in base B to natural log (in floating point).">logmath_log_to_ln</a>(fsg-><a class="code" href="structfsg__model__s.html#ab0b22dadb593ee1901829f89c4a47fe2" title="Pointer to log math computation object.">lmath</a>, tl-><a class="code" href="structfsg__link__s.html#a4bc31131cca140338254c43eada509dc" title="log(transition probability)*lw">logs2prob</a> / fsg-><a class="code" href="structfsg__model__s.html#aeaff529953d494b9891dbc0fdac8e97f" title="Language weight that&#39;s been applied to transition logprobs.">lw</a>));
<a name="l00839"></a>00839 }
<a name="l00840"></a>00840 }
<a name="l00841"></a>00841
<a name="l00842"></a>00842 <span class="keywordtype">void</span>
<a name="l00843"></a>00843 fsg_model_write_fsm(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> * fsg, FILE * fp)
<a name="l00844"></a>00844 {
<a name="l00845"></a>00845 <span class="keywordtype">int</span> i;
<a name="l00846"></a>00846
<a name="l00847"></a>00847 <span class="comment">/* Write transitions from initial state first. */</span>
<a name="l00848"></a>00848 fsg_model_write_fsm_trans(fsg, fsg_model_start_state(fsg), fp);
<a name="l00849"></a>00849
<a name="l00850"></a>00850 <span class="comment">/* Other states. */</span>
<a name="l00851"></a>00851 <span class="keywordflow">for</span> (i = 0; i < fsg-><a class="code" href="structfsg__model__s.html#a80cdb0b5e7463221ce14135c9f5a3b01" title="number of states in FSG">n_state</a>; i++) {
<a name="l00852"></a>00852 <span class="keywordflow">if</span> (i == fsg_model_start_state(fsg))
<a name="l00853"></a>00853 <span class="keywordflow">continue</span>;
<a name="l00854"></a>00854 fsg_model_write_fsm_trans(fsg, i, fp);
<a name="l00855"></a>00855 }
<a name="l00856"></a>00856
<a name="l00857"></a>00857 <span class="comment">/* Final state. */</span>
<a name="l00858"></a>00858 fprintf(fp, <span class="stringliteral">"%d 0\n"</span>, fsg_model_final_state(fsg));
<a name="l00859"></a>00859
<a name="l00860"></a>00860 fflush(fp);
<a name="l00861"></a>00861 }
<a name="l00862"></a>00862
<a name="l00863"></a>00863 <span class="keywordtype">void</span>
<a name="l00864"></a>00864 fsg_model_writefile_fsm(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *file)
<a name="l00865"></a>00865 {
<a name="l00866"></a>00866 FILE *fp;
<a name="l00867"></a>00867
<a name="l00868"></a>00868 assert(fsg);
<a name="l00869"></a>00869
<a name="l00870"></a>00870 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Writing FSM file '%s'\n"</span>, file);
<a name="l00871"></a>00871
<a name="l00872"></a>00872 <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"w"</span>)) == NULL) {
<a name="l00873"></a>00873 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to open fsm file '%s' for writing: %s\n"</span>, file, strerror(errno));
<a name="l00874"></a>00874 <span class="keywordflow">return</span>;
<a name="l00875"></a>00875 }
<a name="l00876"></a>00876
<a name="l00877"></a>00877 fsg_model_write_fsm(fsg, fp);
<a name="l00878"></a>00878
<a name="l00879"></a>00879 fclose(fp);
<a name="l00880"></a>00880 }
<a name="l00881"></a>00881
<a name="l00882"></a>00882 <span class="keywordtype">void</span>
<a name="l00883"></a>00883 fsg_model_write_symtab(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, FILE *file)
<a name="l00884"></a>00884 {
<a name="l00885"></a>00885 <span class="keywordtype">int</span> i;
<a name="l00886"></a>00886
<a name="l00887"></a>00887 fprintf(file, <span class="stringliteral">"<eps> 0\n"</span>);
<a name="l00888"></a>00888 <span class="keywordflow">for</span> (i = 0; i < fsg_model_n_word(fsg); ++i) {
<a name="l00889"></a>00889 fprintf(file, <span class="stringliteral">"%s %d\n"</span>, fsg_model_word_str(fsg, i), i + 1);
<a name="l00890"></a>00890 }
<a name="l00891"></a>00891 fflush(file);
<a name="l00892"></a>00892 }
<a name="l00893"></a>00893
<a name="l00894"></a>00894 <span class="keywordtype">void</span>
<a name="l00895"></a>00895 fsg_model_writefile_symtab(<a class="code" href="structfsg__model__s.html" title="Word level FSG definition.">fsg_model_t</a> *fsg, <span class="keywordtype">char</span> <span class="keyword">const</span> *file)
<a name="l00896"></a>00896 {
<a name="l00897"></a>00897 FILE *fp;
<a name="l00898"></a>00898
<a name="l00899"></a>00899 assert(fsg);
<a name="l00900"></a>00900
<a name="l00901"></a>00901 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Writing FSM symbol table '%s'\n"</span>, file);
<a name="l00902"></a>00902
<a name="l00903"></a>00903 <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"w"</span>)) == NULL) {
<a name="l00904"></a>00904 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to open symbol table '%s' for writing: %s\n"</span>, file, strerror(errno));
<a name="l00905"></a>00905 <span class="keywordflow">return</span>;
<a name="l00906"></a>00906 }
<a name="l00907"></a>00907
<a name="l00908"></a>00908 fsg_model_write_symtab(fsg, fp);
<a name="l00909"></a>00909
<a name="l00910"></a>00910 fclose(fp);
<a name="l00911"></a>00911 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>fsg_model.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase 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>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
137
