blob: 16c8698c6b07e0a86bcf10e453b450aea8c9827a (
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
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
|
#ifndef MERT_VOCABULARY_H_
#define MERT_VOCABULARY_H_
#include <boost/unordered_map.hpp>
#include <string>
namespace mert
{
/**
* A map to handle vocabularies to calculate
* various scores such as BLEU.
*
* TODO: replace this with more efficient data structure.
*/
class Vocabulary
{
public:
typedef boost::unordered_map<std::string, int>::iterator iterator;
typedef boost::unordered_map<std::string, int>::const_iterator const_iterator;
Vocabulary() {}
virtual ~Vocabulary() {}
/** Returns the assiged id for given "token". */
int Encode(const std::string& token);
/**
* Return true iff the specified "str" is found in the container.
*/
bool Lookup(const std::string&str , int* v) const;
void clear() {
m_vocab.clear();
}
bool empty() const {
return m_vocab.empty();
}
std::size_t size() const {
return m_vocab.size();
}
iterator find(const std::string& str) {
return m_vocab.find(str);
}
const_iterator find(const std::string& str) const {
return m_vocab.find(str);
}
int& operator[](const std::string& str) {
return m_vocab[str];
}
iterator begin() {
return m_vocab.begin();
}
const_iterator begin() const {
return m_vocab.begin();
}
iterator end() {
return m_vocab.end();
}
const_iterator end() const {
return m_vocab.end();
}
private:
boost::unordered_map<std::string, int> m_vocab;
};
class VocabularyFactory
{
public:
static Vocabulary* GetVocabulary();
static void SetVocabulary(Vocabulary* vocab);
private:
VocabularyFactory() {}
virtual ~VocabularyFactory() {}
};
} // namespace mert
#endif // MERT_VOCABULARY_H_
|
