Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorUlrich Germann <Ulrich.Germann@gmail.com>2015-11-03 22:36:43 +0300
committerUlrich Germann <Ulrich.Germann@gmail.com>2015-11-03 22:36:43 +0300
commitd773ad428ec65a8496dee51a3f398843fa90cf39 (patch)
treee683cf12e6a5c60fe311e936772d217aeac87caa /moses/TrellisPath.h
parent9dc31e197be697582cfe724c8292c0e631841570 (diff)
More options cleanup.
Diffstat (limited to 'moses/TrellisPath.h')
-rw-r--r--moses/TrellisPath.h25
1 files changed, 16 insertions, 9 deletions
diff --git a/moses/TrellisPath.h b/moses/TrellisPath.h
index 1e6914a5c..2ec50bc72 100644
--- a/moses/TrellisPath.h
+++ b/moses/TrellisPath.h
@@ -1,5 +1,4 @@
-// $Id$
-
+// -*- mode: c++; indent-tabs-mode: nil; tab-width:2 -*-
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 University of Edinburgh
@@ -34,10 +33,12 @@ namespace Moses
class TrellisPathCollection;
class TrellisPathList;
-/** Encapsulate the set of hypotheses/arcs that goes from decoding 1 phrase to all the source phrases
- * to reach a final translation. For the best translation, this consist of all hypotheses, for the other
- * n-best paths, the node on the path can consist of hypotheses or arcs.
- * Used by phrase-based decoding
+/** Encapsulate the set of hypotheses/arcs that goes from decoding 1
+ * phrase to all the source phrases to reach a final
+ * translation. For the best translation, this consist of all
+ * hypotheses, for the other n-best paths, the node on the path
+ * can consist of hypotheses or arcs. Used by phrase-based
+ * decoding
*/
class TrellisPath
{
@@ -46,9 +47,10 @@ class TrellisPath
protected:
std::vector<const Hypothesis *> m_path; //< list of hypotheses/arcs
- size_t m_prevEdgeChanged; /**< the last node that was wiggled to create this path
- , or NOT_FOUND if this path is the best trans so consist of only hypos
- */
+ size_t m_prevEdgeChanged;
+ /**< the last node that was wiggled to create this path
+ , or NOT_FOUND if this path is the best trans so consist of only hypos
+ */
float m_totalScore;
mutable boost::shared_ptr<ScoreComponentCollection> m_scoreBreakdown;
@@ -58,6 +60,11 @@ protected:
void InitTotalScore();
+ Manager const& manager() const {
+ UTIL_THROW_IF2(m_path.size() == 0, "zero-length trellis path");
+ return m_path[0]->GetManager();
+ }
+
public:
TrellisPath(); // not implemented