mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2025-01-01 00:12:27 +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 |
||
---|---|---|
.. | ||
OnDiskPt.xcodeproj | ||
src | ||
OnDiskPt.vcproj |