diff options
| author | MosesAdmin <moses-support-owner@mit.edu> | 2015-12-09 03:00:35 +0300 |
|---|---|---|
| committer | MosesAdmin <moses-support-owner@mit.edu> | 2015-12-09 03:00:35 +0300 |
| commit | 59365f2bd3f2ed6d7f77d7fee08ab6d2ac201750 (patch) | |
| tree | efb8beb9aa968992fc63385d2343848fc834fe76 /moses/TrellisPath.cpp | |
| parent | 2da95fe74a7a9f5388f7a57b1134a04881a908c7 (diff) | |
daily automatic beautifier
Diffstat (limited to 'moses/TrellisPath.cpp')
| -rw-r--r-- | moses/TrellisPath.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/moses/TrellisPath.cpp b/moses/TrellisPath.cpp index a749939cb..2448229bc 100644 --- a/moses/TrellisPath.cpp +++ b/moses/TrellisPath.cpp @@ -169,15 +169,15 @@ TrellisPath:: GetScoreBreakdown() const { if (!m_scoreBreakdown) { - float totalScore = m_path[0]->GetWinningHypo()->GetFutureScore(); + float totalScore = m_path[0]->GetWinningHypo()->GetFutureScore(); // calculated for sanity check only m_scoreBreakdown.reset(new ScoreComponentCollection()); m_scoreBreakdown->PlusEquals(m_path[0]->GetWinningHypo()->GetScoreBreakdown()); - + // adjust score // I assume things are done this way on the assumption that most hypothesis edges - // are shared with the winning path, so that score adjustments are cheaper than + // are shared with the winning path, so that score adjustments are cheaper than // recomputing the score from scratch. UG size_t sizePath = m_path.size(); for (size_t pos = 0 ; pos < sizePath ; pos++) { |