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
|
#include "ff_rules.h"
#include <sstream>
#include <cassert>
#include <cmath>
#include "filelib.h"
#include "stringlib.h"
#include "sentence_metadata.h"
#include "lattice.h"
#include "fdict.h"
#include "verbose.h"
#include "tdict.h"
#include "hg.h"
using namespace std;
namespace {
string Escape(const string& x) {
string y = x;
for (int i = 0; i < y.size(); ++i) {
if (y[i] == '=') y[i]='_';
if (y[i] == ';') y[i]='_';
}
return y;
}
}
RuleIdentityFeatures::RuleIdentityFeatures(const std::string& param) {
}
void RuleIdentityFeatures::PrepareForInput(const SentenceMetadata& smeta) {
// std::map<const TRule*, SparseVector<double> >
rule2_fid_.clear();
}
void RuleIdentityFeatures::TraversalFeaturesImpl(const SentenceMetadata& smeta,
const Hypergraph::Edge& edge,
const vector<const void*>& ant_contexts,
SparseVector<double>* features,
SparseVector<double>* estimated_features,
void* context) const {
map<const TRule*, int>::iterator it = rule2_fid_.find(edge.rule_.get());
if (it == rule2_fid_.end()) {
const TRule& rule = *edge.rule_;
ostringstream os;
os << "R:";
if (rule.lhs_ < 0) os << TD::Convert(-rule.lhs_) << ':';
for (unsigned i = 0; i < rule.f_.size(); ++i) {
if (i > 0) os << '_';
WordID w = rule.f_[i];
if (w < 0) { os << 'N'; w = -w; }
assert(w > 0);
os << TD::Convert(w);
}
os << ':';
for (unsigned i = 0; i < rule.e_.size(); ++i) {
if (i > 0) os << '_';
WordID w = rule.e_[i];
if (w <= 0) {
os << 'N' << (1-w);
} else {
os << TD::Convert(w);
}
}
it = rule2_fid_.insert(make_pair(&rule, FD::Convert(Escape(os.str())))).first;
}
features->add_value(it->second, 1);
}
RuleNgramFeatures::RuleNgramFeatures(const std::string& param) {
}
void RuleNgramFeatures::PrepareForInput(const SentenceMetadata& smeta) {
// std::map<const TRule*, SparseVector<double> >
rule2_feats_.clear();
}
void RuleNgramFeatures::TraversalFeaturesImpl(const SentenceMetadata& smeta,
const Hypergraph::Edge& edge,
const vector<const void*>& ant_contexts,
SparseVector<double>* features,
SparseVector<double>* estimated_features,
void* context) const {
map<const TRule*, SparseVector<double> >::iterator it = rule2_feats_.find(edge.rule_.get());
if (it == rule2_feats_.end()) {
const TRule& rule = *edge.rule_;
it = rule2_feats_.insert(make_pair(&rule, SparseVector<double>())).first;
SparseVector<double>& f = it->second;
string prev = "<r>";
for (int i = 0; i < rule.f_.size(); ++i) {
WordID w = rule.f_[i];
if (w < 0) w = -w;
assert(w > 0);
const string& cur = TD::Convert(w);
ostringstream os;
os << "RB:" << prev << '_' << cur;
const int fid = FD::Convert(Escape(os.str()));
if (fid <= 0) return;
f.add_value(fid, 1.0);
prev = cur;
}
ostringstream os;
os << "RB:" << prev << '_' << "</r>";
f.set_value(FD::Convert(Escape(os.str())), 1.0);
}
(*features) += it->second;
}
|
