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
|
#include "search/weights.hh"
#include "util/tokenize_piece.hh"
#include <cstdlib>
namespace search {
namespace {
struct Insert {
void operator()(boost::unordered_map<std::string, search::Score> &map, StringPiece name, search::Score score) const {
std::string copy(name.data(), name.size());
map[copy] = score;
}
};
struct DotProduct {
search::Score total;
DotProduct() : total(0.0) {}
void operator()(const boost::unordered_map<std::string, search::Score> &map, StringPiece name, search::Score score) {
boost::unordered_map<std::string, search::Score>::const_iterator i(FindStringPiece(map, name));
if (i != map.end())
total += score * i->second;
}
};
template <class Map, class Op> void Parse(StringPiece text, Map &map, Op &op) {
for (util::TokenIter<util::SingleCharacter, true> spaces(text, ' '); spaces; ++spaces) {
util::TokenIter<util::SingleCharacter> equals(*spaces, '=');
UTIL_THROW_IF(!equals, WeightParseException, "Bad weight token " << *spaces);
StringPiece name(*equals);
UTIL_THROW_IF(!++equals, WeightParseException, "Bad weight token " << *spaces);
char *end;
// Assumes proper termination.
double value = std::strtod(equals->data(), &end);
UTIL_THROW_IF(end != equals->data() + equals->size(), WeightParseException, "Failed to parse weight" << *equals);
UTIL_THROW_IF(++equals, WeightParseException, "Too many equals in " << *spaces);
op(map, name, value);
}
}
} // namespace
Weights::Weights(StringPiece text) {
Insert op;
Parse<Map, Insert>(text, map_, op);
lm_ = Steal("LanguageModel");
oov_ = Steal("OOV");
word_penalty_ = Steal("WordPenalty");
}
search::Score Weights::DotNoLM(StringPiece text) const {
DotProduct dot;
Parse<const Map, DotProduct>(text, map_, dot);
return dot.total;
}
float Weights::Steal(const std::string &str) {
Map::iterator i(map_.find(str));
if (i == map_.end()) {
return 0.0;
} else {
float ret = i->second;
map_.erase(i);
return ret;
}
}
} // namespace search
|
