mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-10-27 20:12:02 +03:00
2451371ca2
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 |
||
---|---|---|
.. | ||
Makefile.am | ||
OnDiskWrapper.cpp | ||
OnDiskWrapper.h | ||
Phrase.cpp | ||
Phrase.h | ||
PhraseNode.cpp | ||
PhraseNode.h | ||
SourcePhrase.cpp | ||
SourcePhrase.h | ||
TargetPhrase.cpp | ||
TargetPhrase.h | ||
TargetPhraseCollection.cpp | ||
TargetPhraseCollection.h | ||
Vocab.cpp | ||
Vocab.h | ||
Word.cpp | ||
Word.h |