mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-28 14:32:38 +03:00
reordering scores are now implemented for n-best lists
git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@690 1f5c12ca-751b-0410-a591-d2e778427230
This commit is contained in:
parent
dd70be5e13
commit
7019abf652
@ -162,6 +162,17 @@ void IOCommandLine::SetNBest(const LatticePathList &nBestList, long translationI
|
||||
m_nBestFile << "d: ";
|
||||
m_nBestFile << path.GetScoreBreakdown().GetScoreForProducer(StaticData::Instance()->GetDistortionScoreProducer()) << " ";
|
||||
|
||||
//reordering
|
||||
vector<LexicalReordering*> rms = StaticData::Instance()->GetReorderModels();
|
||||
if(rms.size() > 0)
|
||||
{
|
||||
vector<LexicalReordering*>::iterator iter;
|
||||
for(iter = rms.begin(); iter != rms.end(); ++iter)
|
||||
{
|
||||
m_nBestFile << path.GetScoreBreakdown().GetScoreForProducer(*iter) << " ";
|
||||
}
|
||||
}
|
||||
|
||||
// lm
|
||||
const LMList& lml = StaticData::Instance()->GetAllLM();
|
||||
if (lml.size() > 0) {
|
||||
|
Loading…
Reference in New Issue
Block a user