diff options
| author | chardmeier <chardmeier@1f5c12ca-751b-0410-a591-d2e778427230> | 2008-06-14 14:57:33 +0400 |
|---|---|---|
| committer | chardmeier <chardmeier@1f5c12ca-751b-0410-a591-d2e778427230> | 2008-06-14 14:57:33 +0400 |
| commit | 1f38032a66722a3ffbdadfbd9a4b8ad57fe950e2 (patch) | |
| tree | 0c4c99cafa05826864c03e2b7414f4f1bd002537 /moses | |
| parent | 4f84e3ccfe1b8c6e864e764c8777f9b7e1e0f099 (diff) | |
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
Diffstat (limited to 'moses')
| -rw-r--r-- | moses/src/SearchCubePruning.cpp | 2 |
1 files changed, 2 insertions, 0 deletions
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<HypothesisStackCubePruning*>(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(); |