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
|
// $Id$
// vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 Hieu Hoang
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 "ChartTrellisNode.h"
#include "ScoreComponentCollection.h"
#include "Phrase.h"
namespace Moses
{
class ChartHypothesis;
class ChartTrellisPathCollection;
class ChartTrellisPath
{
friend std::ostream& operator<<(std::ostream&, const ChartTrellisPath&);
protected:
// recursively point backwards
ChartTrellisNode *m_finalNode;
const ChartTrellisNode *m_prevNodeChanged;
const ChartTrellisPath *m_prevPath;
ScoreComponentCollection m_scoreBreakdown;
float m_totalScore;
// deviate by 1 hypo
ChartTrellisPath(const ChartTrellisPath &origPath
, const ChartTrellisNode &soughtNode
, const ChartHypothesis &replacementHypo
, ScoreComponentCollection &scoreChange);
void CreateDeviantPaths(ChartTrellisPathCollection &pathColl, const ChartTrellisNode &soughtNode) const;
const ChartTrellisNode &GetFinalNode() const {
assert (m_finalNode);
return *m_finalNode;
}
public:
ChartTrellisPath(const ChartHypothesis *hypo);
~ChartTrellisPath();
//! get score for this path throught trellis
inline float GetTotalScore() const {
return m_totalScore;
}
Phrase GetOutputPhrase() const;
/** returns detailed component scores */
inline const ScoreComponentCollection &GetScoreBreakdown() const {
return m_scoreBreakdown;
}
void CreateDeviantPaths(ChartTrellisPathCollection &pathColl) const;
};
}
|
