-
Notifications
You must be signed in to change notification settings - Fork 125
/
sim_slm.cpp
164 lines (155 loc) · 5.35 KB
/
sim_slm.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
*
* Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved.
*
* The contents of this file are subject to the terms of either the GNU Lesser
* General Public License Version 2.1 only ("LGPL") or the Common Development and
* Distribution License ("CDDL")(collectively, the "License"). You may not use this
* file except in compliance with the License. You can obtain a copy of the CDDL at
* http://www.opensource.org/licenses/cddl1.php and a copy of the LGPLv2.1 at
* http://www.opensource.org/licenses/lgpl-license.php. See the License for the
* specific language governing permissions and limitations under the License. When
* distributing the software, include this License Header Notice in each file and
* include the full text of the License in the License file as well as the
* following notice:
*
* NOTICE PURSUANT TO SECTION 9 OF THE COMMON DEVELOPMENT AND DISTRIBUTION LICENSE
* (CDDL)
* For Covered Software in this distribution, this License shall be governed by the
* laws of the State of California (excluding conflict-of-law provisions).
* Any litigation relating to this License shall be subject to the jurisdiction of
* the Federal Courts of the Northern District of California and the state courts
* of the State of California, with venue lying in Santa Clara County, California.
*
* Contributor(s):
*
* If you wish your version of this file to be governed by only the CDDL or only
* the LGPL Version 2.1, indicate your decision by adding "[Contributor]" elects to
* include this software in this distribution under the [CDDL or LGPL Version 2.1]
* license." If you don't indicate a single choice of license, a recipient has the
* option to distribute your version of this file under either the CDDL or the LGPL
* Version 2.1, or to extend the choice of license to its licensees as provided
* above. However, if you add LGPL Version 2.1 code and therefore, elected the LGPL
* Version 2 license, then the option applies only if the new code is made subject
* to such option by the copyright holder.
*/
#include <stdio.h>
#include <math.h>
#include "sim_slm.h"
bool
CSIMSlm::Load(const char* fname)
{
bool suc = false;
FILE* fp = fopen(fname, "rb");
if (fp != NULL && fread(&N, sizeof(N), 1, fp) == 1 &&
fread(&bUseLogPr, sizeof(bUseLogPr), 1, fp) == 1) {
sz = new int[N + 1];
level = new void* [N + 1];
fread(sz, sizeof(int), N + 1, fp);
for (int lvl = 0; lvl <= N; ++lvl) {
if (lvl < N) {
level[lvl] = new TNode [sz[lvl]];
fread(level[lvl], sizeof(TNode), sz[lvl], fp);
} else {
level[lvl] = new TLeaf [sz[lvl]];
fread(level[lvl], sizeof(TLeaf), sz[lvl], fp);
}
}
suc = true;
}
fclose(fp);
return suc;
}
void
CSIMSlm::Free()
{
delete [] sz;
for (int lvl = 0; lvl <= N; ++lvl) {
if (lvl == N)
delete [] ((TLeaf*)level[lvl]);
else
delete [] ((TNode*)level[lvl]);
}
level = NULL;
sz = NULL;
bUseLogPr = 0;
N = 0;
}
double
CSIMSlm::getNegLogPr(int n, TSIMWordId* hw)
{
double val = (bUseLogPr) ? (getPrAsLog(n, hw)) : (getPrDirect(n, hw));
return (bUseLogPr) ? (val) : (-log(val));
}
double
CSIMSlm::getPr(int n, TSIMWordId* hw)
{
double val = (bUseLogPr) ? (getPrAsLog(n, hw)) : (getPrDirect(n, hw));
return (bUseLogPr) ? (exp(-val)) : (val);
}
/**
* Only used when this model using -log(pr) value, also
* the return value is also -log(pr) value
*/
double
CSIMSlm::getPrAsLog(int n, TSIMWordId* hw)
{
void* pstate = ((TNode*)level[0]);
double bow = 0.0;
if (n > N) {
hw += (N - n);
n = N;
}
for (int lvl = 0; lvl < n && pstate != NULL; ++lvl) {
int h = ((TNode*)pstate)->child;
int t = (((TNode*)pstate) + 1)->child;
if (lvl == n - 1)
bow = ((TNode*)pstate)->bow;
if (lvl == N - 1) {
TLeaf* p = (TLeaf*)level[lvl + 1];
pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
} else {
TNode* p = (TNode*)level[lvl + 1];
pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
}
}
if (pstate == NULL) {
return bow + getPrAsLog(n - 1, hw + 1);
} else {
return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf
}
}
/**
* Only used when this model using direct pr value, also
* the return value is also direct pr value.
*/
double
CSIMSlm::getPrDirect(int n, TSIMWordId* hw)
{
void* pstate = ((TNode*)level[0]);
double bow = 1.0;
if (n > N) {
hw += (N - n);
n = N;
}
for (int lvl = 0; lvl < n && pstate != NULL; ++lvl) {
int h = ((TNode*)pstate)->child;
int t = (((TNode*)pstate) + 1)->child;
if (lvl == n - 1)
bow = ((TNode*)pstate)->bow;
if (lvl == N - 1) {
TLeaf* p = (TLeaf*)level[lvl + 1];
pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
} else {
TNode* p = (TNode*)level[lvl + 1];
pstate = (void*)binary_find_id(p + h, p + t, hw[lvl]);
}
}
if (pstate == NULL) {
return bow * getPrDirect(n - 1, hw + 1);
} else {
return ((TLeaf*)pstate)->pr; // as we derive TNode from TLeaf
}
}
// -*- indent-tabs-mode: nil -*- vim:et:ts=4