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
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#pragma once
#include "Phrase.h"
#include "RuleTableLoader.h"
#include "TypeDef.h"
#include "Word.h"
#include <istream>
#include <string>
#include <vector>
namespace Moses
{
class LMList;
class PhraseDictionarySCFG;
class WordPenaltyProducer;
class RuleTableLoaderCompact : public RuleTableLoader
{
public:
bool Load(const std::vector<FactorType> &input,
const std::vector<FactorType> &output,
std::istream &inStream,
const std::vector<float> &weight,
size_t tableLimit,
const LMList &languageModels,
const WordPenaltyProducer* wpProducer,
PhraseDictionarySCFG &);
private:
struct LineReader {
LineReader(std::istream &input) : m_input(input), m_lineNum(0) {}
void ReadLine() {
std::getline(m_input, m_line);
// Assume everything's hunky-dory.
++m_lineNum;
}
std::istream &m_input;
std::string m_line;
size_t m_lineNum;
};
void LoadVocabularySection(LineReader &,
const std::vector<FactorType> &,
std::vector<Word> &);
void LoadPhraseSection(LineReader &,
const std::vector<Word> &,
std::vector<Phrase> &,
std::vector<size_t> &);
void LoadAlignmentSection(LineReader &,
std::vector<const AlignmentInfo *> &,
std::vector<Phrase> &);
bool LoadRuleSection(LineReader &,
const std::vector<Word> &,
const std::vector<Phrase> &,
const std::vector<Phrase> &,
const std::vector<size_t> &,
const std::vector<const AlignmentInfo *> &,
const LMList &languageModels,
const WordPenaltyProducer *wpProducer,
const std::vector<float> &weights,
PhraseDictionarySCFG &ruleTable);
// Like Tokenize() but records starting positions of tokens (instead of
// copying substrings) and assumes delimiter is ASCII space character.
void FindTokens(std::vector<size_t> &output, const std::string &str) const
{
// Skip delimiters at beginning.
size_t lastPos = str.find_first_not_of(' ', 0);
// Find first "non-delimiter".
size_t pos = str.find_first_of(' ', lastPos);
while (std::string::npos != pos || std::string::npos != lastPos) {
// Found a token, add it to the vector.
output.push_back(lastPos);
// Skip delimiters. Note the "not_of"
lastPos = str.find_first_not_of(' ', pos);
// Find next "non-delimiter"
pos = str.find_first_of(' ', lastPos);
}
}
};
} // namespace Moses
|
