Changes to chart decoder cube pruning: create one cube per dotted rule

instead of one per translation and do 'non-lazy' scoring, i.e. fully
score the corner and neighbor hypotheses inside the rule cube instead
of waiting until an item is popped.  The old behaviour -- faster but
with more search errors -- is available via the
cube-pruning-lazy-scoring option.

git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@4039 1f5c12ca-751b-0410-a591-d2e778427230

1 files changed, 9 insertions, 1 deletions

diff --git a/moses-chart-cmd/src/IOWrapper.cpp b/moses-chart-cmd/src/IOWrapper.cpp
index 39498104b..31ec4c4ee 100644
--- a/moses-chart-cmd/src/IOWrapper.cpp
+++ b/moses-chart-cmd/src/IOWrapper.cpp
@@ -43,6 +43,10 @@ POSSIBILITY OF SUCH DAMAGE.
 #include "PhraseDictionary.h"
 #include "ChartTrellisPathList.h"
 #include "ChartTrellisPath.h"
+#include "ChartTranslationOption.h"
+#include "ChartHypothesis.h"
+#include "CoveredChartSpan.h"
+
 
 using namespace std;
 using namespace Moses;
@@ -223,7 +227,11 @@ void OutputTranslationOptions(std::ostream &out, const ChartHypothesis *hypo, lo
 {
   // recursive
   if (hypo != NULL) {
-    out << "Trans Opt " << translationId << " " << hypo->GetCurrSourceRange() << ": " <<  hypo->GetTranslationOption()
+    out << "Trans Opt " << translationId
+        << " " << hypo->GetCurrSourceRange()
+        << ": " << hypo->GetTranslationOption().GetLastCoveredChartSpan()
+        << ": " << hypo->GetCurrTargetPhrase().GetTargetLHS()
+        << "->" << hypo->GetCurrTargetPhrase()
         << " " << hypo->GetTotalScore() << hypo->GetScoreBreakdown()
         << endl;
   }