<!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/lm3g_templates.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('lm3g__templates_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/lm/lm3g_templates.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-2007 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037 <span class="comment">/*</span>
<a name="l00038"></a>00038 <span class="comment"> * \file lm3g_templates.c Core Sphinx 3-gram code used in</span>
<a name="l00039"></a>00039 <span class="comment"> * DMP/DMP32/ARPA (for now) model code.</span>
<a name="l00040"></a>00040 <span class="comment"> */</span>
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="preprocessor">#include <assert.h></span>
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="comment">/* Locate a specific bigram within a bigram list */</span>
<a name="l00045"></a>00045 <span class="preprocessor">#define BINARY_SEARCH_THRESH 16</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span><span class="keyword">static</span> int32
<a name="l00047"></a>00047 find_bg(<a class="code" href="structbigram__s.html" title="Bigram structure.">bigram_t</a> * bg, int32 n, int32 w)
<a name="l00048"></a>00048 {
<a name="l00049"></a>00049 int32 i, b, e;
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="comment">/* Binary search until segment size < threshold */</span>
<a name="l00052"></a>00052 b = 0;
<a name="l00053"></a>00053 e = n;
<a name="l00054"></a>00054 <span class="keywordflow">while</span> (e - b > BINARY_SEARCH_THRESH) {
<a name="l00055"></a>00055 i = (b + e) >> 1;
<a name="l00056"></a>00056 <span class="keywordflow">if</span> (bg[i].wid < w)
<a name="l00057"></a>00057 b = i + 1;
<a name="l00058"></a>00058 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bg[i].wid > w)
<a name="l00059"></a>00059 e = i;
<a name="l00060"></a>00060 <span class="keywordflow">else</span>
<a name="l00061"></a>00061 <span class="keywordflow">return</span> i;
<a name="l00062"></a>00062 }
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="comment">/* Linear search within narrowed segment */</span>
<a name="l00065"></a>00065 <span class="keywordflow">for</span> (i = b; (i < e) && (bg[i].wid != w); i++);
<a name="l00066"></a>00066 <span class="keywordflow">return</span> ((i < e) ? i : -1);
<a name="l00067"></a>00067 }
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="keyword">static</span> int32
<a name="l00070"></a>00070 lm3g_bg_score(NGRAM_MODEL_TYPE *model,
<a name="l00071"></a>00071 int32 lw1, int32 lw2, int32 *n_used)
<a name="l00072"></a>00072 {
<a name="l00073"></a>00073 int32 i, n, b, score;
<a name="l00074"></a>00074 <a class="code" href="structbigram__s.html" title="Bigram structure.">bigram_t</a> *bg;
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="keywordflow">if</span> (lw1 < 0 || model->base.n < 2) {
<a name="l00077"></a>00077 *n_used = 1;
<a name="l00078"></a>00078 <span class="keywordflow">return</span> model->lm3g.unigrams[lw2].prob1.l;
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a>00081 b = FIRST_BG(model, lw1);
<a name="l00082"></a>00082 n = FIRST_BG(model, lw1 + 1) - b;
<a name="l00083"></a>00083 bg = model->lm3g.bigrams + b;
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keywordflow">if</span> ((i = find_bg(bg, n, lw2)) >= 0) {
<a name="l00086"></a>00086 <span class="comment">/* Access mode = bigram */</span>
<a name="l00087"></a>00087 *n_used = 2;
<a name="l00088"></a>00088 score = model->lm3g.<a class="code" href="structbigram__s.html#a769b8a54f864ac4844e37cfa17ed1af0" title="Index into array of actual bigram probs.">prob2</a>[bg[i].<a class="code" href="structbigram__s.html#a769b8a54f864ac4844e37cfa17ed1af0" title="Index into array of actual bigram probs.">prob2</a>].l;
<a name="l00089"></a>00089 }
<a name="l00090"></a>00090 <span class="keywordflow">else</span> {
<a name="l00091"></a>00091 <span class="comment">/* Access mode = unigram */</span>
<a name="l00092"></a>00092 *n_used = 1;
<a name="l00093"></a>00093 score = model->lm3g.unigrams[lw1].bo_wt1.l + model->lm3g.unigrams[lw2].prob1.l;
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="keywordflow">return</span> (score);
<a name="l00097"></a>00097 }
<a name="l00098"></a>00098
<a name="l00099"></a>00099 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00100"></a>00100 load_tginfo(NGRAM_MODEL_TYPE *model, int32 lw1, int32 lw2)
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 int32 i, n, b, t;
<a name="l00103"></a>00103 <a class="code" href="structbigram__s.html" title="Bigram structure.">bigram_t</a> *bg;
<a name="l00104"></a>00104 <a class="code" href="structtginfo__s.html" title="Trigram information cache.">tginfo_t</a> *tginfo;
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="comment">/* First allocate space for tg information for bg lw1,lw2 */</span>
<a name="l00107"></a>00107 tginfo = (<a class="code" href="structtginfo__s.html" title="Trigram information cache.">tginfo_t</a> *) <a class="code" href="listelem__alloc_8h.html#ad0c40e65d9cca0d7ec08fcf416b09af2" title="Allocate a list element and return pointer to it.">listelem_malloc</a>(model->lm3g.le);
<a name="l00108"></a>00108 tginfo-><a class="code" href="structtginfo__s.html#aa151a34891820c55e0fef60cc74b6e05" title="lw1 component of bigram lw1,lw2.">w1</a> = lw1;
<a name="l00109"></a>00109 tginfo-><a class="code" href="structtginfo__s.html#a3642dc5ac56de1829665bb7d42c9372a" title="Trigrams for lw1,lw2.">tg</a> = NULL;
<a name="l00110"></a>00110 tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a> = model->lm3g.tginfo[lw2];
<a name="l00111"></a>00111 model->lm3g.tginfo[lw2] = tginfo;
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="comment">/* Locate bigram lw1,lw2 */</span>
<a name="l00114"></a>00114 b = model->lm3g.unigrams[lw1].bigrams;
<a name="l00115"></a>00115 n = model->lm3g.unigrams[lw1 + 1].bigrams - b;
<a name="l00116"></a>00116 bg = model->lm3g.bigrams + b;
<a name="l00117"></a>00117
<a name="l00118"></a>00118 <span class="keywordflow">if</span> ((n > 0) && ((i = find_bg(bg, n, lw2)) >= 0)) {
<a name="l00119"></a>00119 tginfo-><a class="code" href="structtginfo__s.html#ac5e9be48da8563941be03f3cd09e3c25" title="tg bowt for lw1,lw2">bowt</a> = model->lm3g.bo_wt2[bg[i].<a class="code" href="structbigram__s.html#a410991054e81251285cbc209964cdaf4" title="Index into array of actual bigram backoff wts.">bo_wt2</a>].l;
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="comment">/* Find t = Absolute first trigram index for bigram lw1,lw2 */</span>
<a name="l00122"></a>00122 b += i; <span class="comment">/* b = Absolute index of bigram lw1,lw2 on disk */</span>
<a name="l00123"></a>00123 t = FIRST_TG(model, b);
<a name="l00124"></a>00124
<a name="l00125"></a>00125 tginfo-><a class="code" href="structtginfo__s.html#a3642dc5ac56de1829665bb7d42c9372a" title="Trigrams for lw1,lw2.">tg</a> = model->lm3g.trigrams + t;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="comment">/* Find #tg for bigram w1,w2 */</span>
<a name="l00128"></a>00128 tginfo-><a class="code" href="structtginfo__s.html#a5eb046b3d09a4c80e4cdf216c6c7eb46" title="number tg for parent bigram lw1,lw2">n_tg</a> = FIRST_TG(model, b + 1) - t;
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130 <span class="keywordflow">else</span> { <span class="comment">/* No bigram w1,w2 */</span>
<a name="l00131"></a>00131 tginfo-><a class="code" href="structtginfo__s.html#ac5e9be48da8563941be03f3cd09e3c25" title="tg bowt for lw1,lw2">bowt</a> = 0;
<a name="l00132"></a>00132 tginfo-><a class="code" href="structtginfo__s.html#a5eb046b3d09a4c80e4cdf216c6c7eb46" title="number tg for parent bigram lw1,lw2">n_tg</a> = 0;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="comment">/* Similar to find_bg */</span>
<a name="l00137"></a>00137 <span class="keyword">static</span> int32
<a name="l00138"></a>00138 find_tg(<a class="code" href="structtrigram__s.html" title="Trigram structure.">trigram_t</a> * tg, int32 n, int32 w)
<a name="l00139"></a>00139 {
<a name="l00140"></a>00140 int32 i, b, e;
<a name="l00141"></a>00141
<a name="l00142"></a>00142 b = 0;
<a name="l00143"></a>00143 e = n;
<a name="l00144"></a>00144 <span class="keywordflow">while</span> (e - b > BINARY_SEARCH_THRESH) {
<a name="l00145"></a>00145 i = (b + e) >> 1;
<a name="l00146"></a>00146 <span class="keywordflow">if</span> (tg[i].wid < w)
<a name="l00147"></a>00147 b = i + 1;
<a name="l00148"></a>00148 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (tg[i].wid > w)
<a name="l00149"></a>00149 e = i;
<a name="l00150"></a>00150 <span class="keywordflow">else</span>
<a name="l00151"></a>00151 <span class="keywordflow">return</span> i;
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00154"></a>00154 <span class="keywordflow">for</span> (i = b; (i < e) && (tg[i].wid != w); i++);
<a name="l00155"></a>00155 <span class="keywordflow">return</span> ((i < e) ? i : -1);
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keyword">static</span> int32
<a name="l00159"></a>00159 lm3g_tg_score(NGRAM_MODEL_TYPE *model, int32 lw1,
<a name="l00160"></a>00160 int32 lw2, int32 lw3, int32 *n_used)
<a name="l00161"></a>00161 {
<a name="l00162"></a>00162 <a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base = &model->base;
<a name="l00163"></a>00163 int32 i, n, score;
<a name="l00164"></a>00164 <a class="code" href="structtrigram__s.html" title="Trigram structure.">trigram_t</a> *tg;
<a name="l00165"></a>00165 <a class="code" href="structtginfo__s.html" title="Trigram information cache.">tginfo_t</a> *tginfo, *prev_tginfo;
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="keywordflow">if</span> ((base-><a class="code" href="structngram__model__s.html#a3c87bc1b678662a2c8930b3b8c33a80f" title="This is an n-gram model (1, 2, 3, ...).">n</a> < 3) || (lw1 < 0) || (lw2 < 0))
<a name="l00168"></a>00168 <span class="keywordflow">return</span> (lm3g_bg_score(model, lw2, lw3, n_used));
<a name="l00169"></a>00169
<a name="l00170"></a>00170 prev_tginfo = NULL;
<a name="l00171"></a>00171 <span class="keywordflow">for</span> (tginfo = model->lm3g.tginfo[lw2]; tginfo; tginfo = tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a>) {
<a name="l00172"></a>00172 <span class="keywordflow">if</span> (tginfo-><a class="code" href="structtginfo__s.html#aa151a34891820c55e0fef60cc74b6e05" title="lw1 component of bigram lw1,lw2.">w1</a> == lw1)
<a name="l00173"></a>00173 <span class="keywordflow">break</span>;
<a name="l00174"></a>00174 prev_tginfo = tginfo;
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (!tginfo) {
<a name="l00178"></a>00178 load_tginfo(model, lw1, lw2);
<a name="l00179"></a>00179 tginfo = model->lm3g.tginfo[lw2];
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (prev_tginfo) {
<a name="l00182"></a>00182 prev_tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a> = tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a>;
<a name="l00183"></a>00183 tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a> = model->lm3g.tginfo[lw2];
<a name="l00184"></a>00184 model->lm3g.tginfo[lw2] = tginfo;
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186
<a name="l00187"></a>00187 tginfo-><a class="code" href="structtginfo__s.html#a38d6aa51b244a7138c476a6e663ffbb4" title="whether used since last lm_reset">used</a> = 1;
<a name="l00188"></a>00188
<a name="l00189"></a>00189 <span class="comment">/* Trigrams for w1,w2 now pointed to by tginfo */</span>
<a name="l00190"></a>00190 n = tginfo-><a class="code" href="structtginfo__s.html#a5eb046b3d09a4c80e4cdf216c6c7eb46" title="number tg for parent bigram lw1,lw2">n_tg</a>;
<a name="l00191"></a>00191 tg = tginfo-><a class="code" href="structtginfo__s.html#a3642dc5ac56de1829665bb7d42c9372a" title="Trigrams for lw1,lw2.">tg</a>;
<a name="l00192"></a>00192 <span class="keywordflow">if</span> ((i = find_tg(tg, n, lw3)) >= 0) {
<a name="l00193"></a>00193 <span class="comment">/* Access mode = trigram */</span>
<a name="l00194"></a>00194 *n_used = 3;
<a name="l00195"></a>00195 score = model->lm3g.<a class="code" href="structtrigram__s.html#a52f3fad42f7c653a469af0c1b75988a9" title="Index into array of actual trigram probs.">prob3</a>[tg[i].<a class="code" href="structtrigram__s.html#a52f3fad42f7c653a469af0c1b75988a9" title="Index into array of actual trigram probs.">prob3</a>].l;
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197 <span class="keywordflow">else</span> {
<a name="l00198"></a>00198 score = tginfo-><a class="code" href="structtginfo__s.html#ac5e9be48da8563941be03f3cd09e3c25" title="tg bowt for lw1,lw2">bowt</a> + lm3g_bg_score(model, lw2, lw3, n_used);
<a name="l00199"></a>00199 }
<a name="l00200"></a>00200
<a name="l00201"></a>00201 <span class="keywordflow">return</span> (score);
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="keyword">static</span> int32
<a name="l00205"></a>00205 lm3g_template_score(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base, int32 wid,
<a name="l00206"></a>00206 int32 *history, int32 n_hist,
<a name="l00207"></a>00207 int32 *n_used)
<a name="l00208"></a>00208 {
<a name="l00209"></a>00209 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00210"></a>00210 <span class="keywordflow">switch</span> (n_hist) {
<a name="l00211"></a>00211 <span class="keywordflow">case</span> 0:
<a name="l00212"></a>00212 <span class="comment">/* Access mode: unigram */</span>
<a name="l00213"></a>00213 *n_used = 1;
<a name="l00214"></a>00214 <span class="keywordflow">return</span> model->lm3g.unigrams[wid].prob1.l;
<a name="l00215"></a>00215 <span class="keywordflow">case</span> 1:
<a name="l00216"></a>00216 <span class="keywordflow">return</span> lm3g_bg_score(model, history[0], wid, n_used);
<a name="l00217"></a>00217 <span class="keywordflow">case</span> 2:
<a name="l00218"></a>00218 <span class="keywordflow">default</span>:
<a name="l00219"></a>00219 <span class="comment">/* Anything greater than 2 is the same as a trigram for now. */</span>
<a name="l00220"></a>00220 <span class="keywordflow">return</span> lm3g_tg_score(model, history[1], history[0], wid, n_used);
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 }
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="keyword">static</span> int32
<a name="l00225"></a>00225 lm3g_template_raw_score(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base, int32 wid,
<a name="l00226"></a>00226 int32 *history, int32 n_hist,
<a name="l00227"></a>00227 int32 *n_used)
<a name="l00228"></a>00228 {
<a name="l00229"></a>00229 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00230"></a>00230 int32 score;
<a name="l00231"></a>00231
<a name="l00232"></a>00232 <span class="keywordflow">switch</span> (n_hist) {
<a name="l00233"></a>00233 <span class="keywordflow">case</span> 0:
<a name="l00234"></a>00234 <span class="comment">/* Access mode: unigram */</span>
<a name="l00235"></a>00235 *n_used = 1;
<a name="l00236"></a>00236 <span class="comment">/* Undo insertion penalty. */</span>
<a name="l00237"></a>00237 score = model->lm3g.unigrams[wid].prob1.l - base-><a class="code" href="structngram__model__s.html#a3d6bf5632760a16e52cb881d7010d774" title="Log of word insertion penalty.">log_wip</a>;
<a name="l00238"></a>00238 <span class="comment">/* Undo language weight. */</span>
<a name="l00239"></a>00239 score = (int32)(score / base-><a class="code" href="structngram__model__s.html#a76ea0c65b23de80091e7c602bdb43bde" title="Language model scaling factor.">lw</a>);
<a name="l00240"></a>00240 <span class="comment">/* Undo unigram interpolation */</span>
<a name="l00241"></a>00241 <span class="keywordflow">if</span> (strcmp(base-><a class="code" href="structngram__model__s.html#ae625e779e340845f03fb3da164e93039" title="Unigram names.">word_str</a>[wid], <span class="stringliteral">"<s>"</span>) != 0) { <span class="comment">/* FIXME: configurable start_sym */</span>
<a name="l00242"></a>00242 score = <a class="code" href="logmath_8h.html#aebb4711268322fa7aec31e5798fe7e90" title="Convert linear floating point number to integer log in base B.">logmath_log</a>(base-><a class="code" href="structngram__model__s.html#a2ca373109c651ac998b33153eb38fd95" title="Log-math object.">lmath</a>,
<a name="l00243"></a>00243 <a class="code" href="logmath_8h.html#ae8b0a168e29e448c0d6de66dc46e099e" title="Convert integer log in base B to linear floating point.">logmath_exp</a>(base-><a class="code" href="structngram__model__s.html#a2ca373109c651ac998b33153eb38fd95" title="Log-math object.">lmath</a>, score)
<a name="l00244"></a>00244 - <a class="code" href="logmath_8h.html#ae8b0a168e29e448c0d6de66dc46e099e" title="Convert integer log in base B to linear floating point.">logmath_exp</a>(base-><a class="code" href="structngram__model__s.html#a2ca373109c651ac998b33153eb38fd95" title="Log-math object.">lmath</a>,
<a name="l00245"></a>00245 base-><a class="code" href="structngram__model__s.html#a616bf871a67f9cedce17d6b589ee33ea" title="Log of uniform (0-gram) probability.">log_uniform</a> + base-><a class="code" href="structngram__model__s.html#aa38c5fdecaefd9a2f43b69f26ae492c1" title="Log of uniform weight (i.e.">log_uniform_weight</a>));
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247 <span class="keywordflow">return</span> score;
<a name="l00248"></a>00248 <span class="keywordflow">case</span> 1:
<a name="l00249"></a>00249 score = lm3g_bg_score(model, history[0], wid, n_used);
<a name="l00250"></a>00250 <span class="keywordflow">break</span>;
<a name="l00251"></a>00251 <span class="keywordflow">case</span> 2:
<a name="l00252"></a>00252 <span class="keywordflow">default</span>:
<a name="l00253"></a>00253 <span class="comment">/* Anything greater than 2 is the same as a trigram for now. */</span>
<a name="l00254"></a>00254 score = lm3g_tg_score(model, history[1], history[0], wid, n_used);
<a name="l00255"></a>00255 <span class="keywordflow">break</span>;
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257 <span class="comment">/* FIXME (maybe): This doesn't undo unigram weighting in backoff cases. */</span>
<a name="l00258"></a>00258 <span class="keywordflow">return</span> (int32)((score - base-><a class="code" href="structngram__model__s.html#a3d6bf5632760a16e52cb881d7010d774" title="Log of word insertion penalty.">log_wip</a>) / base-><a class="code" href="structngram__model__s.html#a76ea0c65b23de80091e7c602bdb43bde" title="Language model scaling factor.">lw</a>);
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="keyword">static</span> int32
<a name="l00262"></a>00262 lm3g_template_add_ug(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base,
<a name="l00263"></a>00263 int32 wid, int32 lweight)
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00266"></a>00266 <span class="keywordflow">return</span> lm3g_add_ug(base, &model->lm3g, wid, lweight);
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00270"></a>00270 lm3g_template_flush(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base)
<a name="l00271"></a>00271 {
<a name="l00272"></a>00272 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00273"></a>00273 lm3g_tginfo_reset(base, &model->lm3g);
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275
<a name="l00276"></a><a class="code" href="structlm3g__iter__s.html">00276</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structlm3g__iter__s.html">lm3g_iter_s</a> {
<a name="l00277"></a>00277 <a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> base;
<a name="l00278"></a>00278 <a class="code" href="structunigram__s.html" title="Unigram structure (common among all lm3g implementations)">unigram_t</a> *ug;
<a name="l00279"></a>00279 <a class="code" href="structbigram__s.html" title="Bigram structure.">bigram_t</a> *bg;
<a name="l00280"></a>00280 <a class="code" href="structtrigram__s.html" title="Trigram structure.">trigram_t</a> *tg;
<a name="l00281"></a>00281 } <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a>;
<a name="l00282"></a>00282
<a name="l00283"></a>00283 <span class="keyword">static</span> <a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *
<a name="l00284"></a>00284 lm3g_template_iter(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base, int32 wid,
<a name="l00285"></a>00285 int32 *history, int32 n_hist)
<a name="l00286"></a>00286 {
<a name="l00287"></a>00287 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00288"></a>00288 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *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="l00289"></a>00289
<a name="l00290"></a>00290 ngram_iter_init((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor, base, n_hist, FALSE);
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keywordflow">if</span> (n_hist == 0) {
<a name="l00293"></a>00293 <span class="comment">/* Unigram is the easiest. */</span>
<a name="l00294"></a>00294 itor->ug = model->lm3g.unigrams + wid;
<a name="l00295"></a>00295 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n_hist == 1) {
<a name="l00298"></a>00298 int32 i, n, b;
<a name="l00299"></a>00299 <span class="comment">/* Find the bigram, as in bg_score above (duplicate code...) */</span>
<a name="l00300"></a>00300 itor->ug = model->lm3g.unigrams + history[0];
<a name="l00301"></a>00301 b = FIRST_BG(model, history[0]);
<a name="l00302"></a>00302 n = FIRST_BG(model, history[0] + 1) - b;
<a name="l00303"></a>00303 itor->bg = model->lm3g.bigrams + b;
<a name="l00304"></a>00304 <span class="comment">/* If no such bigram exists then fail. */</span>
<a name="l00305"></a>00305 <span class="keywordflow">if</span> ((i = find_bg(itor->bg, n, wid)) < 0) {
<a name="l00306"></a>00306 <a class="code" href="ngram__model_8h.html#ac9f746c8a5db78ef8b2fb7c312be4a22" title="Terminate an M-gram iterator.">ngram_iter_free</a>((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor);
<a name="l00307"></a>00307 <span class="keywordflow">return</span> NULL;
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309 itor->bg += i;
<a name="l00310"></a>00310 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00311"></a>00311 }
<a name="l00312"></a>00312 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n_hist == 2) {
<a name="l00313"></a>00313 int32 i, n;
<a name="l00314"></a>00314 <a class="code" href="structtginfo__s.html" title="Trigram information cache.">tginfo_t</a> *tginfo, *prev_tginfo;
<a name="l00315"></a>00315 <span class="comment">/* Find the trigram, as in tg_score above (duplicate code...) */</span>
<a name="l00316"></a>00316 itor->ug = model->lm3g.unigrams + history[1];
<a name="l00317"></a>00317 prev_tginfo = NULL;
<a name="l00318"></a>00318 <span class="keywordflow">for</span> (tginfo = model->lm3g.tginfo[history[0]];
<a name="l00319"></a>00319 tginfo; tginfo = tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a>) {
<a name="l00320"></a>00320 <span class="keywordflow">if</span> (tginfo-><a class="code" href="structtginfo__s.html#aa151a34891820c55e0fef60cc74b6e05" title="lw1 component of bigram lw1,lw2.">w1</a> == history[1])
<a name="l00321"></a>00321 <span class="keywordflow">break</span>;
<a name="l00322"></a>00322 prev_tginfo = tginfo;
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324
<a name="l00325"></a>00325 <span class="keywordflow">if</span> (!tginfo) {
<a name="l00326"></a>00326 load_tginfo(model, history[1], history[0]);
<a name="l00327"></a>00327 tginfo = model->lm3g.tginfo[history[0]];
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (prev_tginfo) {
<a name="l00330"></a>00330 prev_tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a> = tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a>;
<a name="l00331"></a>00331 tginfo-><a class="code" href="structtginfo__s.html#a184e60660a4c8168b5268260cd98ffa5" title="Next lw1 with same parent lw2; NULL if none.">next</a> = model->lm3g.tginfo[history[0]];
<a name="l00332"></a>00332 model->lm3g.tginfo[history[0]] = tginfo;
<a name="l00333"></a>00333 }
<a name="l00334"></a>00334
<a name="l00335"></a>00335 tginfo-><a class="code" href="structtginfo__s.html#a38d6aa51b244a7138c476a6e663ffbb4" title="whether used since last lm_reset">used</a> = 1;
<a name="l00336"></a>00336
<a name="l00337"></a>00337 <span class="comment">/* Trigrams for w1,w2 now pointed to by tginfo */</span>
<a name="l00338"></a>00338 n = tginfo-><a class="code" href="structtginfo__s.html#a5eb046b3d09a4c80e4cdf216c6c7eb46" title="number tg for parent bigram lw1,lw2">n_tg</a>;
<a name="l00339"></a>00339 itor->tg = tginfo-><a class="code" href="structtginfo__s.html#a3642dc5ac56de1829665bb7d42c9372a" title="Trigrams for lw1,lw2.">tg</a>;
<a name="l00340"></a>00340 <span class="keywordflow">if</span> ((i = find_tg(itor->tg, n, wid)) >= 0) {
<a name="l00341"></a>00341 itor->tg += i;
<a name="l00342"></a>00342 <span class="comment">/* Now advance the bigram pointer accordingly. FIXME:</span>
<a name="l00343"></a>00343 <span class="comment"> * Note that we actually already found the relevant bigram</span>
<a name="l00344"></a>00344 <span class="comment"> * in load_tginfo. */</span>
<a name="l00345"></a>00345 itor->bg = model->lm3g.bigrams;
<a name="l00346"></a>00346 <span class="keywordflow">while</span> (FIRST_TG(model, (itor->bg - model->lm3g.bigrams + 1))
<a name="l00347"></a>00347 <= (itor->tg - model->lm3g.trigrams))
<a name="l00348"></a>00348 ++itor->bg;
<a name="l00349"></a>00349 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00350"></a>00350 }
<a name="l00351"></a>00351 <span class="keywordflow">else</span> {
<a name="l00352"></a>00352 <a class="code" href="ngram__model_8h.html#ac9f746c8a5db78ef8b2fb7c312be4a22" title="Terminate an M-gram iterator.">ngram_iter_free</a>((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor);
<a name="l00353"></a>00353 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)NULL;
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356 <span class="keywordflow">else</span> {
<a name="l00357"></a>00357 <span class="comment">/* Should not happen. */</span>
<a name="l00358"></a>00358 assert(n_hist == 0); <span class="comment">/* Guaranteed to fail. */</span>
<a name="l00359"></a>00359 <a class="code" href="ngram__model_8h.html#ac9f746c8a5db78ef8b2fb7c312be4a22" title="Terminate an M-gram iterator.">ngram_iter_free</a>((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor);
<a name="l00360"></a>00360 <span class="keywordflow">return</span> NULL;
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362 }
<a name="l00363"></a>00363
<a name="l00364"></a>00364 <span class="keyword">static</span> <a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *
<a name="l00365"></a>00365 lm3g_template_mgrams(<a class="code" href="structngram__model__s.html" title="Common implementation of ngram_model_t.">ngram_model_t</a> *base, <span class="keywordtype">int</span> m)
<a name="l00366"></a>00366 {
<a name="l00367"></a>00367 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base;
<a name="l00368"></a>00368 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *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="l00369"></a>00369 ngram_iter_init((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor, base, m, FALSE);
<a name="l00370"></a>00370
<a name="l00371"></a>00371 itor->ug = model->lm3g.unigrams;
<a name="l00372"></a>00372 itor->bg = model->lm3g.bigrams;
<a name="l00373"></a>00373 itor->tg = model->lm3g.trigrams;
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="comment">/* Advance bigram pointer to match first trigram. */</span>
<a name="l00376"></a>00376 <span class="keywordflow">if</span> (m > 1 && base-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[1] > 1) {
<a name="l00377"></a>00377 <span class="keywordflow">while</span> (FIRST_TG(model, (itor->bg - model->lm3g.bigrams + 1))
<a name="l00378"></a>00378 <= (itor->tg - model->lm3g.trigrams))
<a name="l00379"></a>00379 ++itor->bg;
<a name="l00380"></a>00380 }
<a name="l00381"></a>00381
<a name="l00382"></a>00382 <span class="comment">/* Advance unigram pointer to match first bigram. */</span>
<a name="l00383"></a>00383 <span class="keywordflow">if</span> (m > 0 && base-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[0] > 1) {
<a name="l00384"></a>00384 <span class="keywordflow">while</span> (itor->ug[1].<a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a> <= (itor->bg - model->lm3g.bigrams))
<a name="l00385"></a>00385 ++itor->ug;
<a name="l00386"></a>00386 }
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00389"></a>00389 }
<a name="l00390"></a>00390
<a name="l00391"></a>00391 <span class="keyword">static</span> <a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *
<a name="l00392"></a>00392 lm3g_template_successors(<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *bitor)
<a name="l00393"></a>00393 {
<a name="l00394"></a>00394 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)bitor->model;
<a name="l00395"></a>00395 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *from = (<a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *)bitor;
<a name="l00396"></a>00396 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *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="l00397"></a>00397
<a name="l00398"></a>00398 itor->ug = from->ug;
<a name="l00399"></a>00399 <span class="keywordflow">switch</span> (bitor-><a class="code" href="structngram__iter__s.html#a80bce30ba5b180f85ca84d7288715858" title="Order of history.">m</a>) {
<a name="l00400"></a>00400 <span class="keywordflow">case</span> 0:
<a name="l00401"></a>00401 <span class="comment">/* Next itor bigrams is the same as this itor bigram or</span>
<a name="l00402"></a>00402 <span class="comment"> itor bigrams is more than total count. This means no successors */</span>
<a name="l00403"></a>00403 <span class="keywordflow">if</span> (((itor->ug + 1) - model->lm3g.unigrams < bitor->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[0] &&
<a name="l00404"></a>00404 itor->ug-><a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a> == (itor->ug + 1)->bigrams) ||
<a name="l00405"></a>00405 itor->ug-><a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a> == bitor->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[1])
<a name="l00406"></a>00406 <span class="keywordflow">goto</span> done;
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <span class="comment">/* Start iterating from first bigram successor of from->ug. */</span>
<a name="l00409"></a>00409 itor->bg = model->lm3g.bigrams + itor->ug-><a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a>;
<a name="l00410"></a>00410 <span class="keywordflow">break</span>;
<a name="l00411"></a>00411 <span class="keywordflow">case</span> 1:
<a name="l00412"></a>00412 itor->bg = from->bg;
<a name="l00413"></a>00413
<a name="l00414"></a>00414 <span class="comment">/* This indicates no successors */</span>
<a name="l00415"></a>00415 <span class="keywordflow">if</span> (((itor->bg + 1) - model->lm3g.bigrams < bitor->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[1] &&
<a name="l00416"></a>00416 FIRST_TG (model, itor->bg - model->lm3g.bigrams) ==
<a name="l00417"></a>00417 FIRST_TG (model, (itor->bg + 1) - model->lm3g.bigrams)) ||
<a name="l00418"></a>00418 FIRST_TG (model, itor->bg - model->lm3g.bigrams) == bitor->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[2])
<a name="l00419"></a>00419 <span class="keywordflow">goto</span> done;
<a name="l00420"></a>00420
<a name="l00421"></a>00421 <span class="comment">/* Start iterating from first trigram successor of from->bg. */</span>
<a name="l00422"></a>00422 itor->tg = (model->lm3g.trigrams
<a name="l00423"></a>00423 + FIRST_TG(model, (itor->bg - model->lm3g.bigrams)));
<a name="l00424"></a>00424 <span class="preprocessor">#if 0</span>
<a name="l00425"></a>00425 <span class="preprocessor"></span> printf(<span class="stringliteral">"%s %s => %d (%s)\n"</span>,
<a name="l00426"></a>00426 model->base.word_str[itor->ug - model->lm3g.unigrams],
<a name="l00427"></a>00427 model->base.word_str[itor->bg-><a class="code" href="structbigram__s.html#af66faad954d56f5ceaf6ba47cdcd9b1f" title="Index of unigram entry for this.">wid</a>],
<a name="l00428"></a>00428 FIRST_TG(model, (itor->bg - model->lm3g.bigrams)),
<a name="l00429"></a>00429 model->base.word_str[itor->tg-><a class="code" href="structtrigram__s.html#a492e1fedb16fa11d26a941177c1305be" title="Index of unigram entry for this.">wid</a>]);
<a name="l00430"></a>00430 <span class="preprocessor">#endif</span>
<a name="l00431"></a>00431 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l00432"></a>00432 <span class="keywordflow">case</span> 2:
<a name="l00433"></a>00433 <span class="keywordflow">default</span>:
<a name="l00434"></a>00434 <span class="comment">/* All invalid! */</span>
<a name="l00435"></a>00435 <span class="keywordflow">goto</span> done;
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437
<a name="l00438"></a>00438 ngram_iter_init((<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor, bitor->model, bitor-><a class="code" href="structngram__iter__s.html#a80bce30ba5b180f85ca84d7288715858" title="Order of history.">m</a> + 1, TRUE);
<a name="l00439"></a>00439 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00440"></a>00440 done:
<a name="l00441"></a>00441 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(itor);
<a name="l00442"></a>00442 <span class="keywordflow">return</span> NULL;
<a name="l00443"></a>00443 }
<a name="l00444"></a>00444
<a name="l00445"></a>00445 <span class="keyword">static</span> int32 <span class="keyword">const</span> *
<a name="l00446"></a>00446 lm3g_template_iter_get(<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *base,
<a name="l00447"></a>00447 int32 *out_score, int32 *out_bowt)
<a name="l00448"></a>00448 {
<a name="l00449"></a>00449 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base->model;
<a name="l00450"></a>00450 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *itor = (<a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *)base;
<a name="l00451"></a>00451
<a name="l00452"></a>00452 base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[0] = itor->ug - model->lm3g.unigrams;
<a name="l00453"></a>00453 <span class="keywordflow">if</span> (itor->bg) base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[1] = itor->bg-><a class="code" href="structbigram__s.html#af66faad954d56f5ceaf6ba47cdcd9b1f" title="Index of unigram entry for this.">wid</a>;
<a name="l00454"></a>00454 <span class="keywordflow">if</span> (itor->tg) base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[2] = itor->tg-><a class="code" href="structtrigram__s.html#a492e1fedb16fa11d26a941177c1305be" title="Index of unigram entry for this.">wid</a>;
<a name="l00455"></a>00455 <span class="preprocessor">#if 0</span>
<a name="l00456"></a>00456 <span class="preprocessor"></span> printf(<span class="stringliteral">"itor_get: %d %d %d\n"</span>, base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[0], base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[1], base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>[2]);
<a name="l00457"></a>00457 <span class="preprocessor">#endif</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span>
<a name="l00459"></a>00459 <span class="keywordflow">switch</span> (base-><a class="code" href="structngram__iter__s.html#a80bce30ba5b180f85ca84d7288715858" title="Order of history.">m</a>) {
<a name="l00460"></a>00460 <span class="keywordflow">case</span> 0:
<a name="l00461"></a>00461 *out_score = itor->ug-><a class="code" href="structunigram__s.html#a488db9623272838a933cd4b768409fea" title="Unigram probability.">prob1</a>.l;
<a name="l00462"></a>00462 *out_bowt = itor->ug-><a class="code" href="structunigram__s.html#ad33b4af5b40a8d13ffae932bab003df6" title="Unigram backoff weight.">bo_wt1</a>.l;
<a name="l00463"></a>00463 <span class="keywordflow">break</span>;
<a name="l00464"></a>00464 <span class="keywordflow">case</span> 1:
<a name="l00465"></a>00465 *out_score = model->lm3g.prob2[itor->bg-><a class="code" href="structbigram__s.html#a769b8a54f864ac4844e37cfa17ed1af0" title="Index into array of actual bigram probs.">prob2</a>].l;
<a name="l00466"></a>00466 <span class="keywordflow">if</span> (model->lm3g.bo_wt2)
<a name="l00467"></a>00467 *out_bowt = model->lm3g.bo_wt2[itor->bg-><a class="code" href="structbigram__s.html#a410991054e81251285cbc209964cdaf4" title="Index into array of actual bigram backoff wts.">bo_wt2</a>].l;
<a name="l00468"></a>00468 <span class="keywordflow">else</span>
<a name="l00469"></a>00469 *out_bowt = 0;
<a name="l00470"></a>00470 <span class="keywordflow">break</span>;
<a name="l00471"></a>00471 <span class="keywordflow">case</span> 2:
<a name="l00472"></a>00472 *out_score = model->lm3g.prob3[itor->tg-><a class="code" href="structtrigram__s.html#a52f3fad42f7c653a469af0c1b75988a9" title="Index into array of actual trigram probs.">prob3</a>].l;
<a name="l00473"></a>00473 *out_bowt = 0;
<a name="l00474"></a>00474 <span class="keywordflow">break</span>;
<a name="l00475"></a>00475 <span class="keywordflow">default</span>: <span class="comment">/* Should not happen. */</span>
<a name="l00476"></a>00476 <span class="keywordflow">return</span> NULL;
<a name="l00477"></a>00477 }
<a name="l00478"></a>00478 <span class="keywordflow">return</span> base-><a class="code" href="structngram__iter__s.html#a1362ebe2dcf1c441929c845fc97958cb" title="Scratch space for word IDs.">wids</a>;
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480
<a name="l00481"></a>00481 <span class="keyword">static</span> <a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *
<a name="l00482"></a>00482 lm3g_template_iter_next(<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *base)
<a name="l00483"></a>00483 {
<a name="l00484"></a>00484 NGRAM_MODEL_TYPE *model = (NGRAM_MODEL_TYPE *)base->model;
<a name="l00485"></a>00485 <a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *itor = (<a class="code" href="structlm3g__iter__s.html">lm3g_iter_t</a> *)base;
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="keywordflow">switch</span> (base-><a class="code" href="structngram__iter__s.html#a80bce30ba5b180f85ca84d7288715858" title="Order of history.">m</a>) {
<a name="l00488"></a>00488 <span class="keywordflow">case</span> 0:
<a name="l00489"></a>00489 ++itor->ug;
<a name="l00490"></a>00490 <span class="comment">/* Check for end condition. */</span>
<a name="l00491"></a>00491 <span class="keywordflow">if</span> (itor->ug - model->lm3g.unigrams >= base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[0])
<a name="l00492"></a>00492 <span class="keywordflow">goto</span> done;
<a name="l00493"></a>00493 <span class="keywordflow">break</span>;
<a name="l00494"></a>00494 <span class="keywordflow">case</span> 1:
<a name="l00495"></a>00495 ++itor->bg;
<a name="l00496"></a>00496 <span class="comment">/* Check for end condition. */</span>
<a name="l00497"></a>00497 <span class="keywordflow">if</span> (itor->bg - model->lm3g.bigrams >= base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[1])
<a name="l00498"></a>00498 <span class="keywordflow">goto</span> done;
<a name="l00499"></a>00499 <span class="comment">/* Advance unigram pointer if necessary in order to get one</span>
<a name="l00500"></a>00500 <span class="comment"> * that points to this bigram. */</span>
<a name="l00501"></a>00501 <span class="keywordflow">while</span> (itor->bg - model->lm3g.bigrams >= itor->ug[1].<a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a>) {
<a name="l00502"></a>00502 <span class="comment">/* Stop if this is a successor iterator, since we don't</span>
<a name="l00503"></a>00503 <span class="comment"> * want a new unigram. */</span>
<a name="l00504"></a>00504 <span class="keywordflow">if</span> (base-><a class="code" href="structngram__iter__s.html#a7802a7883b1cc246b1bff629cd2cfb08" title="Is this a successor iterator?">successor</a>)
<a name="l00505"></a>00505 <span class="keywordflow">goto</span> done;
<a name="l00506"></a>00506 ++itor->ug;
<a name="l00507"></a>00507 <span class="keywordflow">if</span> (itor->ug == model->lm3g.unigrams + base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[0]) {
<a name="l00508"></a>00508 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Bigram %d has no valid unigram parent\n"</span>,
<a name="l00509"></a>00509 itor->bg - model->lm3g.bigrams);
<a name="l00510"></a>00510 <span class="keywordflow">goto</span> done;
<a name="l00511"></a>00511 }
<a name="l00512"></a>00512 }
<a name="l00513"></a>00513 <span class="keywordflow">break</span>;
<a name="l00514"></a>00514 <span class="keywordflow">case</span> 2:
<a name="l00515"></a>00515 ++itor->tg;
<a name="l00516"></a>00516 <span class="comment">/* Check for end condition. */</span>
<a name="l00517"></a>00517 <span class="keywordflow">if</span> (itor->tg - model->lm3g.trigrams >= base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[2])
<a name="l00518"></a>00518 <span class="keywordflow">goto</span> done;
<a name="l00519"></a>00519 <span class="comment">/* Advance bigram pointer if necessary. */</span>
<a name="l00520"></a>00520 <span class="keywordflow">while</span> (itor->tg - model->lm3g.trigrams >=
<a name="l00521"></a>00521 FIRST_TG(model, (itor->bg - model->lm3g.bigrams + 1))) {
<a name="l00522"></a>00522 <span class="keywordflow">if</span> (base-><a class="code" href="structngram__iter__s.html#a7802a7883b1cc246b1bff629cd2cfb08" title="Is this a successor iterator?">successor</a>)
<a name="l00523"></a>00523 <span class="keywordflow">goto</span> done;
<a name="l00524"></a>00524 ++itor->bg;
<a name="l00525"></a>00525 <span class="keywordflow">if</span> (itor->bg == model->lm3g.bigrams + base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[1]) {
<a name="l00526"></a>00526 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Trigram %d has no valid bigram parent\n"</span>,
<a name="l00527"></a>00527 itor->tg - model->lm3g.trigrams);
<a name="l00528"></a>00528
<a name="l00529"></a>00529 <span class="keywordflow">goto</span> done;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 }
<a name="l00532"></a>00532 <span class="comment">/* Advance unigram pointer if necessary. */</span>
<a name="l00533"></a>00533 <span class="keywordflow">while</span> (itor->bg - model->lm3g.bigrams >= itor->ug[1].<a class="code" href="structunigram__s.html#ae148f631c0d9851b14bb9cb31c0c061d" title="Index of 1st entry in lm_t.bigrams[].">bigrams</a>) {
<a name="l00534"></a>00534 ++itor->ug;
<a name="l00535"></a>00535 <span class="keywordflow">if</span> (itor->ug == model->lm3g.unigrams + base->model-><a class="code" href="structngram__model__s.html#a9dcba9b49cc1cd189b257e5838da0eee" title="Counts for 1, 2, 3, ...">n_counts</a>[0]) {
<a name="l00536"></a>00536 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Trigram %d has no valid unigram parent\n"</span>,
<a name="l00537"></a>00537 itor->tg - model->lm3g.trigrams);
<a name="l00538"></a>00538 <span class="keywordflow">goto</span> done;
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541 <span class="keywordflow">break</span>;
<a name="l00542"></a>00542 <span class="keywordflow">default</span>: <span class="comment">/* Should not happen. */</span>
<a name="l00543"></a>00543 <span class="keywordflow">goto</span> done;
<a name="l00544"></a>00544 }
<a name="l00545"></a>00545
<a name="l00546"></a>00546 <span class="keywordflow">return</span> (<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *)itor;
<a name="l00547"></a>00547 done:
<a name="l00548"></a>00548 <a class="code" href="ngram__model_8h.html#ac9f746c8a5db78ef8b2fb7c312be4a22" title="Terminate an M-gram iterator.">ngram_iter_free</a>(base);
<a name="l00549"></a>00549 <span class="keywordflow">return</span> NULL;
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551
<a name="l00552"></a>00552 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00553"></a>00553 lm3g_template_iter_free(<a class="code" href="structngram__iter__s.html" title="Base iterator structure for N-grams.">ngram_iter_t</a> *base)
<a name="l00554"></a>00554 {
<a name="l00555"></a>00555 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(base);
<a name="l00556"></a>00556 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>lm3g_templates.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
>
274
