blob: b83fc54dfbcfdf107e71410fe641bdb8adaf2f02 (
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
|
#include "cfg.h"
#include "hg.h"
#include "cfg_format.h"
using namespace std;
void CFG::Init(Hypergraph const& hg,bool target_side,bool copy_features,bool push_weights) {
hg_=&hg;
Hypergraph::NodeProbs np;
goal_inside=hg.ComputeNodeViterbi(&np);
pushed_inside=push_weights ? goal_inside : prob_t(1);
int nn=hg.nodes_.size(),ne=hg.edges_.size();
nts.resize(nn);
goal_nt=nn-1;
rules.resize(ne);
for (int i=0;i<nn;++i)
nts[i].ruleids=hg.nodes_[i].in_edges_;
for (int i=0;i<ne;++i) {
Rule &cfgr=rules[i];
Hypergraph::Edge const& e=hg.edges_[i];
TRule const& er=*e.rule_; vector<WordID> const& rule_rhs=target_side?er.e():er.f();
RHS &rhs=cfgr.rhs;
int nr=rule_rhs.size();
rhs.resize(nr);
prob_t &crp=cfgr.p;
crp=e.edge_prob_;
cfgr.lhs=e.head_node_;
#if CFG_DEBUG
cfgr.rule=e.rule_;
#endif
if (copy_features) cfgr.f=e.feature_values_;
if (push_weights) crp /=np[e.head_node_];
for (int j=0;j<nr;++j) {
WordID w=rule_rhs[j];
if (w>0)
rhs[j]=w;
else {
int n=e.tail_nodes_[-w];
if (push_weights) crp*=np[n];
rhs[j]=n;
}
}
}
}
namespace {
}
void CFG::Print(std::ostream &o,CFGFormat const& f) const {
char const* partsep=" ||| ";
if (!f.goal_nt_name.empty())
o << '['<<f.goal_nt_name <<']' << partsep; // print rhs
//TODO:
}
|
