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:
ccorbett 2006-08-13 18:11:52 +00:00
parent dd70be5e13
commit 7019abf652

View File

@ -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) {