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
|
// $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 "LatticePath.h"
#include "LatticePathCollection.h"
using namespace std;
LatticePath::LatticePath(const Hypothesis *hypo)
: m_prevEdgeChanged(NOT_FOUND)
{ // create path OF pure hypo
m_scoreBreakdown = hypo->GetScoreBreakdown();
m_totalScore = hypo->GetTotalScore();
// enumerate path using prevHypo
while (hypo != NULL)
{
m_path.push_back(hypo);
hypo = hypo->GetPrevHypo();
}
}
LatticePath::LatticePath(const LatticePath ©, size_t edgeIndex, const Hypothesis *arc)
:m_prevEdgeChanged(edgeIndex)
{
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 the deviation
const Hypothesis *prevHypo = arc->GetPrevHypo();
while (prevHypo != NULL)
{
m_path.push_back(prevHypo);
prevHypo = prevHypo->GetPrevHypo();
}
CalcScore(copy, edgeIndex, arc);
}
LatticePath::LatticePath(const LatticePath ©, size_t edgeIndex, const Hypothesis *arc, bool /*reserve*/)
:m_path(copy.m_path)
,m_prevEdgeChanged(edgeIndex)
{
// 1 deviation
m_path[edgeIndex] = arc;
CalcScore(copy, edgeIndex, arc);
}
void LatticePath::CalcScore(const LatticePath ©, size_t edgeIndex, const Hypothesis *arc)
{
#ifdef N_BEST
ScoreComponentCollection2 adj = arc->GetScoreBreakdown();
adj.MinusEquals(copy.m_path[edgeIndex]->GetScoreBreakdown());
m_scoreBreakdown = copy.m_scoreBreakdown;
m_scoreBreakdown.PlusEquals(adj);
float fadj = arc->GetTotalScore() - copy.m_path[edgeIndex]->GetTotalScore();
m_totalScore = copy.GetTotalScore() + fadj;
#endif
}
#ifdef N_BEST
void LatticePath::CreateDeviantPaths(LatticePathCollection &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;
LatticePath *deviantPath = new LatticePath(*this, currEdge, arc);
pathColl.insert(deviantPath);
}
}
}
else
{ // wiggle 1 of the edges only
for (size_t currEdge = 0 ; currEdge < sizePath ; currEdge++)
{
if (currEdge != m_prevEdgeChanged)
{
const Hypothesis *edgeOrig = m_path[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;
if (arcReplace != edgeOrig && arcReplace->GetPrevHypo() == edgeOrig->GetPrevHypo())
{
LatticePath *deviantPath = new LatticePath(*this, currEdge, arcReplace, true);
pathColl.insert(deviantPath);
}
}
}
}
}
}
#endif
TO_STRING_BODY(LatticePath);
|
