1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
/*
* NBests.cpp
*
* Created on: 24 Aug 2016
* Author: hieu
*/
#include <boost/foreach.hpp>
#include "NBests.h"
#include "../Manager.h"
#include "../../System.h"
using namespace std;
namespace Moses2
{
namespace SCFG
{
NBests::NBests(const SCFG::Manager &mgr,
const ArcList &arcList,
NBestColl &nbestColl)
:indIter(0)
{
// best
NBest *contender = new NBest(mgr, arcList, 0, nbestColl);
contenders.push(contender);
bool extended = Extend(mgr, nbestColl, 0);
assert(extended);
}
NBests::~NBests()
{
BOOST_FOREACH(const NBest *nbest, m_coll) {
delete nbest;
}
// delete bad contenders left in queue
while (!contenders.empty()) {
NBest *contender = contenders.top();
contenders.pop();
delete contender;
}
}
bool NBests::Extend(const SCFG::Manager &mgr,
NBestColl &nbestColl,
size_t ind)
{
if (ind < m_coll.size()) {
// asking for 1 we've dont already
return true;
}
assert(ind == m_coll.size());
// checks
if (ind >= mgr.system.options.nbest.nbest_size) {
return false;
}
size_t maxIter = mgr.system.options.nbest.nbest_size * mgr.system.options.nbest.factor;
// MAIN LOOP, create 1 new deriv.
// The loop is for distinct nbest
bool ok = false;
while (!ok) {
++indIter;
if (indIter > maxIter) {
return false;
}
if (contenders.empty()) {
return false;
}
NBest *contender = contenders.top();
contenders.pop();
contender->CreateDeviants(mgr, nbestColl, contenders);
if (mgr.system.options.nbest.only_distinct) {
const string &tgtPhrase = contender->GetString();
//cerr << "tgtPhrase=" << tgtPhrase << endl;
boost::hash<std::string> string_hash;
size_t hash = string_hash(tgtPhrase);
if (distinctHypos.insert(hash).second) {
ok = true;
}
}
else {
ok = true;
}
if (ok) {
Add(contender);
//cerr << best->GetScores().GetTotalScore() << " ";
//cerr << best->Debug(mgr.system) << endl;
return true;
}
else {
delete contender;
}
}
return false;
}
}
}
|
