From 1f38032a66722a3ffbdadfbd9a4b8ad57fe950e2 Mon Sep 17 00:00:00 2001 From: chardmeier Date: Sat, 14 Jun 2008 10:57:33 +0000 Subject: Fixed n-best list generation with cube pruning. git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@1852 1f5c12ca-751b-0410-a591-d2e778427230 --- moses/src/SearchCubePruning.cpp | 2 ++ 1 file changed, 2 insertions(+) diff --git a/moses/src/SearchCubePruning.cpp b/moses/src/SearchCubePruning.cpp index 8a2a1b6df..7c3313c94 100644 --- a/moses/src/SearchCubePruning.cpp +++ b/moses/src/SearchCubePruning.cpp @@ -77,6 +77,8 @@ void SearchCubePruning::ProcessSentence() HypothesisStackCubePruning &firstStack = *static_cast(m_hypoStackColl.front()); firstStack.AddInitial(hypo); + // Call this here because the loop below starts at the second stack. + firstStack.CleanupArcList(); CreateForwardTodos(firstStack); const size_t PopLimit = StaticData::Instance().GetCubePruningPopLimit(); -- cgit v1.2.3