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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
// -*- c++ -*-
// $Id$
// vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 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
***********************************************************************/
#ifndef moses_InputType_h
#define moses_InputType_h
#include <string>
#include "TypeDef.h"
#include "Phrase.h"
#include "TargetPhraseCollection.h"
#include "ReorderingConstraint.h"
#include "NonTerminal.h"
#include "WordsRange.h"
namespace Moses
{
class Factor;
class PhraseDictionary;
class TranslationOptionCollection;
class ChartTranslationOptions;
class TranslationTask;
/** base class for all types of inputs to the decoder,
* eg. sentences, confusion networks, lattices and tree
*/
class InputType
{
protected:
long m_translationId; //< contiguous Id
long m_documentId;
long m_topicId;
std::string m_weightSetting;
std::vector<std::string> m_topicIdAndProb;
bool m_useTopicId;
bool m_useTopicIdAndProb;
bool m_hasMetaData;
bool m_specifiesWeightSetting;
long m_segId;
ReorderingConstraint m_reorderingConstraint; /**< limits on reordering specified either by "-mp" switch or xml tags */
std::string m_textType;
std::string m_passthrough;
TranslationTask const* m_ttask; // Translation task that "owns" this instance
public:
// used in -continue-partial-translation
std::vector<bool> m_sourceCompleted;
std::string m_initialTargetPhrase;
size_t m_frontSpanCoveredLength;
// how many words from the beginning are covered
InputType(TranslationTask const* ttask, long translationId = 0);
virtual ~InputType();
virtual InputTypeEnum GetType() const = 0;
TranslationTask const*
GetTranslationTask() const { return m_ttask; }
long GetTranslationId() const {
return m_translationId;
}
void SetTranslationId(long translationId) {
m_translationId = translationId;
}
long GetDocumentId() const {
return m_documentId;
}
void SetDocumentId(long documentId) {
m_documentId = documentId;
}
long GetTopicId() const {
return m_topicId;
}
void SetTopicId(long topicId) {
m_topicId = topicId;
}
const std::vector<std::string>* GetTopicIdAndProb() const {
return &m_topicIdAndProb;
}
void SetTopicIdAndProb(std::vector<std::string> topicIdAndProb) {
m_topicIdAndProb = topicIdAndProb;
}
bool GetUseTopicId() const {
return m_useTopicId;
}
void SetUseTopicId(bool useTopicId) {
m_useTopicId = useTopicId;
}
bool GetUseTopicIdAndProb() const {
return m_useTopicIdAndProb;
}
void SetUseTopicIdAndProb(bool useTopicIdAndProb) {
m_useTopicIdAndProb = useTopicIdAndProb;
}
std::string GetTextType() const {
return m_textType;
}
void SetSpecifiesWeightSetting(bool specifiesWeightSetting) {
m_specifiesWeightSetting = specifiesWeightSetting;
}
bool GetSpecifiesWeightSetting() const {
return m_specifiesWeightSetting;
}
void SetWeightSetting(std::string settingName) {
m_weightSetting = settingName;
}
std::string GetWeightSetting() const {
return m_weightSetting;
}
void SetTextType(std::string type) {
m_textType = type;
}
std::string GetPassthroughInformation() const {
return m_passthrough;
}
void SetPassthroughInformation(std::string &passthrough) {
m_passthrough = passthrough;
}
//! returns the number of words moved
virtual int ComputeDistortionDistance(const WordsRange& prev, const WordsRange& current) const;
//! In a word lattice, tells you if there's a path from node start to node end
virtual bool CanIGetFromAToB(size_t start, size_t end) const;
//! is there a path covering [range] (lattice only, otherwise true)
inline bool IsCoveragePossible(const WordsRange& range) const {
return CanIGetFromAToB(range.GetStartPos(), range.GetEndPos() + 1);
}
//! In a word lattice, you can't always get from node A to node B
inline bool IsExtensionPossible(const WordsRange& prev, const WordsRange& current) const {
// return ComputeDistortionDistance(prev, current) < 100000;
size_t t = prev.GetEndPos()+1; // 2
size_t l = current.GetEndPos()+1; //l=1
size_t r = l;
if (l<t) {
r = t; //r=2
} else {
l = t;
}
if (!CanIGetFromAToB(l,r)) return false;
// there's another check here: a current span may end at a place that previous could get to,
// but it may not *START* at a place it can get to. We'll also have to check if we're going left or right
r = current.GetStartPos();
l = prev.GetEndPos()+1;
if (l == r) return true;
if (prev.GetEndPos() > current.GetStartPos()) {
r = prev.GetStartPos();
l = current.GetEndPos()+1;
if (r == l) return true;
}
return CanIGetFromAToB(l,r);
}
//! number of words in this sentence/confusion network
virtual size_t GetSize() const =0;
//! populate this InputType with data from in stream
virtual int Read(std::istream& in,const std::vector<FactorType>& factorOrder) =0;
//! Output debugging info to stream out
virtual void Print(std::ostream&) const =0;
//! create trans options specific to this InputType
virtual TranslationOptionCollection*
CreateTranslationOptionCollection() const=0;
//! return substring. Only valid for Sentence class. TODO - get rid of this fn
virtual Phrase GetSubString(const WordsRange&) const =0;
//! return substring at a particular position. Only valid for Sentence class. TODO - get rid of this fn
virtual const Word& GetWord(size_t pos) const=0;
//! Returns the reordering constraints
const ReorderingConstraint& GetReorderingConstraint() const {
return m_reorderingConstraint;
};
virtual const NonTerminalSet &GetLabelSet(size_t startPos, size_t endPos) const = 0;
virtual std::vector <ChartTranslationOptions*> GetXmlChartTranslationOptions() const;
TO_STRING();
};
std::ostream& operator<<(std::ostream&,InputType const&);
}
#endif
|