blob: 312d7d6746a80e00ff82146c464a671cbf5f91e9 (
plain)
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
|
#ifndef _ARC_FACTORED_H_
#define _ARC_FACTORED_H_
#include <vector>
#include <cassert>
#include "array2d.h"
#include "sparse_vector.h"
class ArcFactoredForest {
public:
explicit ArcFactoredForest(short num_words) :
num_words_(num_words),
root_edges_(num_words),
edges_(num_words, num_words) {}
struct Edge {
Edge() : features(), edge_prob(prob_t::Zero()) {}
SparseVector<weight_t> features;
prob_t edge_prob;
};
template <class V>
void Reweight(const V& weights) {
for (int m = 0; m < num_words_; ++m) {
for (int h = 0; h < num_words_; ++h) {
if (h != m) {
Edge& e = edges_(h, m);
e.edge_prob.logeq(e.features.dot(weights));
}
}
if (m) {
Edge& e = root_edges_[m];
e.edge_prob.logeq(e.features.dot(weights));
}
}
}
const Edge& operator()(short h, short m) const {
assert(m > 0);
assert(m <= num_words_);
assert(h >= 0);
assert(h <= num_words_);
return h ? edges_(h - 1, m - 1) : root_edges[m - 1];
}
Edge& operator()(short h, short m) {
assert(m > 0);
assert(m <= num_words_);
assert(h >= 0);
assert(h <= num_words_);
return h ? edges_(h - 1, m - 1) : root_edges[m - 1];
}
private:
unsigned num_words_;
std::vector<Edge> root_edges_;
Array2D<Edge> edges_;
};
#endif
|
