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
165
166
167
168
|
#include "base_measures.h"
#include <iostream>
#include "filelib.h"
using namespace std;
void Model1::LoadModel1(const string& fname) {
cerr << "Loading Model 1 parameters from " << fname << " ..." << endl;
ReadFile rf(fname);
istream& in = *rf.stream();
string line;
unsigned lc = 0;
while(getline(in, line)) {
++lc;
int cur = 0;
int start = 0;
while(cur < line.size() && line[cur] != ' ') { ++cur; }
assert(cur != line.size());
line[cur] = 0;
const WordID src = TD::Convert(&line[0]);
++cur;
start = cur;
while(cur < line.size() && line[cur] != ' ') { ++cur; }
assert(cur != line.size());
line[cur] = 0;
WordID trg = TD::Convert(&line[start]);
const double logprob = strtod(&line[cur + 1], NULL);
if (src >= ttable.size()) ttable.resize(src + 1);
ttable[src][trg].logeq(logprob);
}
cerr << " read " << lc << " parameters.\n";
}
prob_t PhraseConditionalBase::p0(const vector<WordID>& vsrc,
const vector<WordID>& vtrg,
int start_src, int start_trg) const {
const int flen = vsrc.size() - start_src;
const int elen = vtrg.size() - start_trg;
prob_t uniform_src_alignment; uniform_src_alignment.logeq(-log(flen + 1));
prob_t p;
p.logeq(log_poisson(elen, flen + 0.01)); // elen | flen ~Pois(flen + 0.01)
for (int i = 0; i < elen; ++i) { // for each position i in e-RHS
const WordID trg = vtrg[i + start_trg];
prob_t tp = prob_t::Zero();
for (int j = -1; j < flen; ++j) {
const WordID src = j < 0 ? 0 : vsrc[j + start_src];
tp += kM1MIXTURE * model1(src, trg);
tp += kUNIFORM_MIXTURE * kUNIFORM_TARGET;
}
tp *= uniform_src_alignment; // draw a_i ~uniform
p *= tp; // draw e_i ~Model1(f_a_i) / uniform
}
if (p.is_0()) {
cerr << "Zero! " << vsrc << "\nTRG=" << vtrg << endl;
abort();
}
return p;
}
prob_t PhraseJointBase::p0(const vector<WordID>& vsrc,
const vector<WordID>& vtrg,
int start_src, int start_trg) const {
const int flen = vsrc.size() - start_src;
const int elen = vtrg.size() - start_trg;
prob_t uniform_src_alignment; uniform_src_alignment.logeq(-log(flen + 1));
prob_t p;
p.logeq(log_poisson(flen, 1.0)); // flen ~Pois(1)
// elen | flen ~Pois(flen + 0.01)
prob_t ptrglen; ptrglen.logeq(log_poisson(elen, flen + 0.01));
p *= ptrglen;
p *= kUNIFORM_SOURCE.pow(flen); // each f in F ~Uniform
for (int i = 0; i < elen; ++i) { // for each position i in E
const WordID trg = vtrg[i + start_trg];
prob_t tp = prob_t::Zero();
for (int j = -1; j < flen; ++j) {
const WordID src = j < 0 ? 0 : vsrc[j + start_src];
tp += kM1MIXTURE * model1(src, trg);
tp += kUNIFORM_MIXTURE * kUNIFORM_TARGET;
}
tp *= uniform_src_alignment; // draw a_i ~uniform
p *= tp; // draw e_i ~Model1(f_a_i) / uniform
}
if (p.is_0()) {
cerr << "Zero! " << vsrc << "\nTRG=" << vtrg << endl;
abort();
}
return p;
}
prob_t PhraseJointBase_BiDir::p0(const vector<WordID>& vsrc,
const vector<WordID>& vtrg,
int start_src, int start_trg) const {
const int flen = vsrc.size() - start_src;
const int elen = vtrg.size() - start_trg;
prob_t uniform_src_alignment; uniform_src_alignment.logeq(-log(flen + 1));
prob_t uniform_trg_alignment; uniform_trg_alignment.logeq(-log(elen + 1));
prob_t p1;
p1.logeq(log_poisson(flen, 1.0)); // flen ~Pois(1)
// elen | flen ~Pois(flen + 0.01)
prob_t ptrglen; ptrglen.logeq(log_poisson(elen, flen + 0.01));
p1 *= ptrglen;
p1 *= kUNIFORM_SOURCE.pow(flen); // each f in F ~Uniform
for (int i = 0; i < elen; ++i) { // for each position i in E
const WordID trg = vtrg[i + start_trg];
prob_t tp = prob_t::Zero();
for (int j = -1; j < flen; ++j) {
const WordID src = j < 0 ? 0 : vsrc[j + start_src];
tp += kM1MIXTURE * model1(src, trg);
tp += kUNIFORM_MIXTURE * kUNIFORM_TARGET;
}
tp *= uniform_src_alignment; // draw a_i ~uniform
p1 *= tp; // draw e_i ~Model1(f_a_i) / uniform
}
if (p1.is_0()) {
cerr << "Zero! " << vsrc << "\nTRG=" << vtrg << endl;
abort();
}
prob_t p2;
p2.logeq(log_poisson(elen, 1.0)); // elen ~Pois(1)
// flen | elen ~Pois(flen + 0.01)
prob_t psrclen; psrclen.logeq(log_poisson(flen, elen + 0.01));
p2 *= psrclen;
p2 *= kUNIFORM_TARGET.pow(elen); // each f in F ~Uniform
for (int i = 0; i < flen; ++i) { // for each position i in E
const WordID src = vsrc[i + start_src];
prob_t tp = prob_t::Zero();
for (int j = -1; j < elen; ++j) {
const WordID trg = j < 0 ? 0 : vtrg[j + start_trg];
tp += kM1MIXTURE * invmodel1(trg, src);
tp += kUNIFORM_MIXTURE * kUNIFORM_SOURCE;
}
tp *= uniform_trg_alignment; // draw a_i ~uniform
p2 *= tp; // draw e_i ~Model1(f_a_i) / uniform
}
if (p2.is_0()) {
cerr << "Zero! " << vsrc << "\nTRG=" << vtrg << endl;
abort();
}
static const prob_t kHALF(0.5);
return (p1 + p2) * kHALF;
}
JumpBase::JumpBase() : p(200) {
for (unsigned src_len = 1; src_len < 200; ++src_len) {
map<int, prob_t>& cpd = p[src_len];
int min_jump = 1 - src_len;
int max_jump = src_len;
prob_t z;
for (int j = min_jump; j <= max_jump; ++j) {
prob_t& cp = cpd[j];
if (j < 0)
cp.logeq(log_poisson(1.5-j, 1));
else if (j > 0)
cp.logeq(log_poisson(j, 1));
cp.poweq(0.2);
z += cp;
}
for (int j = min_jump; j <= max_jump; ++j) {
cpd[j] /= z;
}
}
}
|
