2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
4 * Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved.
6 * The contents of this file are subject to the terms of either the GNU Lesser
7 * General Public License Version 2.1 only ("LGPL") or the Common Development and
8 * Distribution License ("CDDL")(collectively, the "License"). You may not use this
9 * file except in compliance with the License. You can obtain a copy of the CDDL at
10 * http://www.opensource.org/licenses/cddl1.php and a copy of the LGPLv2.1 at
11 * http://www.opensource.org/licenses/lgpl-license.php. See the License for the
12 * specific language governing permissions and limitations under the License. When
13 * distributing the software, include this License Header Notice in each file and
14 * include the full text of the License in the License file as well as the
17 * NOTICE PURSUANT TO SECTION 9 OF THE COMMON DEVELOPMENT AND DISTRIBUTION LICENSE
19 * For Covered Software in this distribution, this License shall be governed by the
20 * laws of the State of California (excluding conflict-of-law provisions).
21 * Any litigation relating to this License shall be subject to the jurisdiction of
22 * the Federal Courts of the Northern District of California and the state courts
23 * of the State of California, with venue lying in Santa Clara County, California.
27 * If you wish your version of this file to be governed by only the CDDL or only
28 * the LGPL Version 2.1, indicate your decision by adding "[Contributor]" elects to
29 * include this software in this distribution under the [CDDL or LGPL Version 2.1]
30 * license." If you don't indicate a single choice of license, a recipient has the
31 * option to distribute your version of this file under either the CDDL or the LGPL
32 * Version 2.1, or to extend the choice of license to its licensees as provided
33 * above. However, if you add LGPL Version 2.1 code and therefore, elected the LGPL
34 * Version 2 license, then the option applies only if the new code is made subject
35 * to such option by the copyright holder.
44 CSIMSlm::Load(const char* fname)
47 FILE* fp = fopen(fname, "rb");
48 if (fp != NULL && fread(&N, sizeof(N), 1, fp) == 1 &&
49 fread(&bUseLogPr, sizeof(bUseLogPr), 1, fp) == 1) {
51 level = new void* [N + 1];
52 fread(sz, sizeof(int), N + 1, fp);
53 for (int lvl = 0; lvl <= N; ++lvl) {
55 level[lvl] = new TNode [sz[lvl]];
56 fread(level[lvl], sizeof(TNode), sz[lvl], fp);
58 level[lvl] = new TLeaf [sz[lvl]];
59 fread(level[lvl], sizeof(TLeaf), sz[lvl], fp);
72 for (int lvl = 0; lvl <= N; ++lvl) {
74 delete [] ((TLeaf*)level[lvl]);
76 delete [] ((TNode*)level[lvl]);
85 CSIMSlm::getNegLogPr(int n, TSIMWordId* hw)
87 double val = (bUseLogPr) ? (getPrAsLog(n, hw)) : (getPrDirect(n, hw));
88 return (bUseLogPr) ? (val) : (-log(val));
92 CSIMSlm::getPr(int n, TSIMWordId* hw)
94 double val = (bUseLogPr) ? (getPrAsLog(n, hw)) : (getPrDirect(n, hw));
95 return (bUseLogPr) ? (exp(-val)) : (val);
99 * Only used when this model using -log(pr) value, also
100 * the return value is also -log(pr) value
103 CSIMSlm::getPrAsLog(int n, TSIMWordId* hw)
105 void* pstate = ((TNode*)level[0]);
111 for (int lvl = 0; lvl < n && pstate != NULL; ++lvl) {
112 int h = ((TNode*)pstate)->child;
113 int t = (((TNode*)pstate) + 1)->child;
115 bow = ((TNode*)pstate)->bow;
117 TLeaf* p = (TLeaf*)level[lvl + 1];
118 pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
120 TNode* p = (TNode*)level[lvl + 1];
121 pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
124 if (pstate == NULL) {
125 return bow + getPrAsLog(n - 1, hw + 1);
127 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf
132 * Only used when this model using direct pr value, also
133 * the return value is also direct pr value.
136 CSIMSlm::getPrDirect(int n, TSIMWordId* hw)
138 void* pstate = ((TNode*)level[0]);
144 for (int lvl = 0; lvl < n && pstate != NULL; ++lvl) {
145 int h = ((TNode*)pstate)->child;
146 int t = (((TNode*)pstate) + 1)->child;
148 bow = ((TNode*)pstate)->bow;
150 TLeaf* p = (TLeaf*)level[lvl + 1];
151 pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
153 TNode* p = (TNode*)level[lvl + 1];
154 pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
157 if (pstate == NULL) {
158 return bow * getPrDirect(n - 1, hw + 1);
160 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf