blob: e9af5bd07c015f3faebc6fe8781a56587a740dc8 (
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
#ifndef _DATA_ARRAY_H_
#define _DATA_ARRAY_H_
#include <string>
#include <unordered_map>
#include <vector>
#include <boost/serialization/serialization.hpp>
#include <boost/serialization/split_member.hpp>
#include <boost/serialization/string.hpp>
#include <boost/serialization/vector.hpp>
using namespace std;
namespace extractor {
enum Side {
SOURCE,
TARGET
};
/**
* Data structure storing information about a single side of a parallel corpus.
*
* Each word is mapped to a unique integer (word_id). The data structure holds
* the corpus in the numberized format, together with the hash table mapping
* words to word_ids. It also holds additional information such as the starting
* index for each sentence and, for each token, the index of the sentence it
* belongs to.
*
* Note: This class has features for both the source and target data arrays.
* Maybe we can save some memory by having more specific implementations (not
* likely to save a lot of memory tough).
*/
class DataArray {
public:
static int NULL_WORD;
static int END_OF_LINE;
static string NULL_WORD_STR;
static string END_OF_LINE_STR;
// Reads data array from text file.
DataArray(const string& filename);
// Reads data array from bitext file where the sentences are separated by |||.
DataArray(const string& filename, const Side& side);
// Creates empty data array.
DataArray();
virtual ~DataArray();
// Returns a vector containing the word ids.
virtual vector<int> GetData() const;
// Returns the word id at the specified position.
virtual int AtIndex(int index) const;
// Returns the original word at the specified position.
virtual string GetWordAtIndex(int index) const;
// Returns the size of the data array.
virtual int GetSize() const;
// Returns the number of distinct words in the data array.
virtual int GetVocabularySize() const;
// Returns whether a word has ever been observed in the data array.
virtual bool HasWord(const string& word) const;
// Returns the word id for a given word or -1 if it the word has never been
// observed.
virtual int GetWordId(const string& word) const;
// Returns the word corresponding to a particular word id.
virtual string GetWord(int word_id) const;
// Returns the number of sentences in the data.
virtual int GetNumSentences() const;
// Returns the index where the sentence containing the given position starts.
virtual int GetSentenceStart(int position) const;
// Returns the length of the sentence.
virtual int GetSentenceLength(int sentence_id) const;
// Returns the number of the sentence containing the given position.
virtual int GetSentenceId(int position) const;
bool operator==(const DataArray& other) const;
private:
// Sets up specific constants.
void InitializeDataArray();
// Constructs the data array.
void CreateDataArray(const vector<string>& lines);
friend class boost::serialization::access;
template<class Archive> void save(Archive& ar, unsigned int) const {
ar << id2word;
ar << data;
ar << sentence_id;
ar << sentence_start;
}
template<class Archive> void load(Archive& ar, unsigned int) {
ar >> id2word;
for (size_t i = 0; i < id2word.size(); ++i) {
word2id[id2word[i]] = i;
}
ar >> data;
ar >> sentence_id;
ar >> sentence_start;
}
BOOST_SERIALIZATION_SPLIT_MEMBER();
unordered_map<string, int> word2id;
vector<string> id2word;
vector<int> data;
vector<int> sentence_id;
vector<int> sentence_start;
};
} // namespace extractor
#endif
|
