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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
// $Id$
/***********************************************************************
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
***********************************************************************/
#include "TrellisPath.h"
#include "TrellisPathList.h"
#include "TrellisPathCollection.h"
#include "StaticData.h"
using namespace std;
namespace Moses
{
TrellisPath::TrellisPath(const Hypothesis *hypo)
: m_prevEdgeChanged(NOT_FOUND)
{
m_scoreBreakdown = hypo->GetScoreBreakdown();
m_totalScore = hypo->GetTotalScore();
// enumerate path using prevHypo
while (hypo != NULL) {
m_path.push_back(hypo);
hypo = hypo->GetPrevHypo();
}
}
void TrellisPath::InitScore() {
m_totalScore = m_path[0]->GetWinningHypo()->GetTotalScore();
m_scoreBreakdown= m_path[0]->GetWinningHypo()->GetScoreBreakdown();
//calc score
size_t sizePath = m_path.size();
for (size_t pos = 0 ; pos < sizePath ; pos++) {
const Hypothesis *hypo = m_path[pos];
const Hypothesis *winningHypo = hypo->GetWinningHypo();
if (hypo != winningHypo) {
m_totalScore = m_totalScore - winningHypo->GetTotalScore() + hypo->GetTotalScore();
m_scoreBreakdown.MinusEquals(winningHypo->GetScoreBreakdown());
m_scoreBreakdown.PlusEquals(hypo->GetScoreBreakdown());
}
}
}
TrellisPath::TrellisPath(const TrellisPath ©, size_t edgeIndex, const Hypothesis *arc)
:m_prevEdgeChanged(edgeIndex)
{
m_path.reserve(copy.m_path.size());
for (size_t currEdge = 0 ; currEdge < edgeIndex ; currEdge++) {
// copy path from parent
m_path.push_back(copy.m_path[currEdge]);
}
// 1 deviation
m_path.push_back(arc);
// rest of path comes from following best path backwards
const Hypothesis *prevHypo = arc->GetPrevHypo();
while (prevHypo != NULL) {
m_path.push_back(prevHypo);
prevHypo = prevHypo->GetPrevHypo();
}
InitScore();
}
TrellisPath::TrellisPath(const vector<const Hypothesis*> edges)
:m_prevEdgeChanged(NOT_FOUND)
{
m_path.resize(edges.size());
copy(edges.rbegin(),edges.rend(),m_path.begin());
InitScore();
}
void TrellisPath::CreateDeviantPaths(TrellisPathCollection &pathColl) const
{
const size_t sizePath = m_path.size();
if (m_prevEdgeChanged == NOT_FOUND) {
// initial enumration from a pure hypo
for (size_t currEdge = 0 ; currEdge < sizePath ; currEdge++) {
const Hypothesis *hypo = static_cast<const Hypothesis*>(m_path[currEdge]);
const ArcList *pAL = hypo->GetArcList();
if (!pAL) continue;
const ArcList &arcList = *pAL;
// every possible Arc to replace this edge
ArcList::const_iterator iterArc;
for (iterArc = arcList.begin() ; iterArc != arcList.end() ; ++iterArc) {
const Hypothesis *arc = *iterArc;
TrellisPath *deviantPath = new TrellisPath(*this, currEdge, arc);
pathColl.Add(deviantPath);
}
}
} else {
// wiggle 1 of the edges only
for (size_t currEdge = m_prevEdgeChanged + 1 ; currEdge < sizePath ; currEdge++) {
const ArcList *pAL = m_path[currEdge]->GetArcList();
if (!pAL) continue;
const ArcList &arcList = *pAL;
ArcList::const_iterator iterArc;
for (iterArc = arcList.begin() ; iterArc != arcList.end() ; ++iterArc) {
// copy this Path & change 1 edge
const Hypothesis *arcReplace = *iterArc;
TrellisPath *deviantPath = new TrellisPath(*this, currEdge, arcReplace);
pathColl.Add(deviantPath);
} // for (iterArc...
} // for (currEdge = 0 ...
}
}
void TrellisPath::CreateDeviantPaths(TrellisPathList &pathColl) const
{
const size_t sizePath = m_path.size();
if (m_prevEdgeChanged == NOT_FOUND) {
// initial enumration from a pure hypo
for (size_t currEdge = 0 ; currEdge < sizePath ; currEdge++) {
const Hypothesis *hypo = static_cast<const Hypothesis*>(m_path[currEdge]);
const ArcList *pAL = hypo->GetArcList();
if (!pAL) continue;
const ArcList &arcList = *pAL;
// every possible Arc to replace this edge
ArcList::const_iterator iterArc;
for (iterArc = arcList.begin() ; iterArc != arcList.end() ; ++iterArc) {
const Hypothesis *arc = *iterArc;
TrellisPath *deviantPath = new TrellisPath(*this, currEdge, arc);
pathColl.Add(deviantPath);
}
}
} else {
// wiggle 1 of the edges only
for (size_t currEdge = m_prevEdgeChanged + 1 ; currEdge < sizePath ; currEdge++) {
const ArcList *pAL = m_path[currEdge]->GetArcList();
if (!pAL) continue;
const ArcList &arcList = *pAL;
ArcList::const_iterator iterArc;
for (iterArc = arcList.begin() ; iterArc != arcList.end() ; ++iterArc) {
// copy this Path & change 1 edge
const Hypothesis *arcReplace = *iterArc;
TrellisPath *deviantPath = new TrellisPath(*this, currEdge, arcReplace);
pathColl.Add(deviantPath);
} // for (iterArc...
} // for (currEdge = 0 ...
}
}
Phrase TrellisPath::GetTargetPhrase() const
{
Phrase targetPhrase(Output, ARRAY_SIZE_INCR);
int numHypo = (int) m_path.size();
for (int node = numHypo - 2 ; node >= 0 ; --node) {
// don't do the empty hypo - waste of time and decode step id is invalid
const Hypothesis &hypo = *m_path[node];
const Phrase &currTargetPhrase = hypo.GetCurrTargetPhrase();
targetPhrase.Append(currTargetPhrase);
}
return targetPhrase;
}
Phrase TrellisPath::GetSurfacePhrase() const
{
const std::vector<FactorType> &outputFactor = StaticData::Instance().GetOutputFactorOrder();
Phrase targetPhrase = GetTargetPhrase()
,ret(Output, targetPhrase.GetSize());
for (size_t pos = 0 ; pos < targetPhrase.GetSize() ; ++pos) {
Word &newWord = ret.AddWord();
for (size_t i = 0 ; i < outputFactor.size() ; i++) {
FactorType factorType = outputFactor[i];
const Factor *factor = targetPhrase.GetFactor(pos, factorType);
CHECK(factor);
newWord[factorType] = factor;
}
}
return ret;
}
WordsRange TrellisPath::GetTargetWordsRange(const Hypothesis &hypo) const
{
size_t startPos = 0;
for (int indEdge = (int) m_path.size() - 1 ; indEdge >= 0 ; --indEdge) {
const Hypothesis *currHypo = m_path[indEdge];
size_t endPos = startPos + currHypo->GetCurrTargetLength() - 1;
if (currHypo == &hypo) {
return WordsRange(startPos, endPos);
}
startPos = endPos + 1;
}
// have to give a hypo in the trellis path, but u didn't.
CHECK(false);
return WordsRange(NOT_FOUND, NOT_FOUND);
}
TO_STRING_BODY(TrellisPath);
}
|