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
112
113
114
115
116
117
118
119
120
|
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#include <algorithm>
#include "TargetPhraseCollection.h"
#include "util/exception.hh"
using namespace std;
namespace Moses
{
// helper for sort
bool
CompareTargetPhrase::
operator() (const TargetPhrase *a, const TargetPhrase *b) const
{
return a->GetFutureScore() > b->GetFutureScore();
}
bool
CompareTargetPhrase::
operator() (const TargetPhrase &a, const TargetPhrase &b) const
{
return a.GetFutureScore() > b.GetFutureScore();
}
TargetPhraseCollection::TargetPhraseCollection(const TargetPhraseCollection ©)
{
for (const_iterator iter = copy.begin(); iter != copy.end(); ++iter) {
const TargetPhrase &origTP = **iter;
TargetPhrase *newTP = new TargetPhrase(origTP);
Add(newTP);
}
}
void TargetPhraseCollection::NthElement(size_t tableLimit)
{
CollType::iterator nth;
nth = (tableLimit && tableLimit <= m_collection.size()
? m_collection.begin() + tableLimit
: m_collection.end());
NTH_ELEMENT4(m_collection.begin(), nth, m_collection.end(), CompareTargetPhrase());
}
void TargetPhraseCollection::Prune(bool adhereTableLimit, size_t tableLimit)
{
NthElement(tableLimit);
if (adhereTableLimit && m_collection.size() > tableLimit) {
for (size_t ind = tableLimit; ind < m_collection.size(); ++ind) {
const TargetPhrase *targetPhrase = m_collection[ind];
delete targetPhrase;
}
m_collection.erase(m_collection.begin() + tableLimit, m_collection.end());
}
}
void TargetPhraseCollection::Sort(bool adhereTableLimit, size_t tableLimit)
{
CollType::iterator iterMiddle;
iterMiddle = (tableLimit == 0 || m_collection.size() < tableLimit)
? m_collection.end()
: m_collection.begin()+tableLimit;
std::partial_sort(m_collection.begin(), iterMiddle, m_collection.end(),
CompareTargetPhrase());
if (adhereTableLimit && tableLimit && m_collection.size() > tableLimit) {
for (size_t i = tableLimit; i < m_collection.size(); ++i) {
const TargetPhrase *targetPhrase = m_collection[i];
delete targetPhrase;
}
m_collection.erase(m_collection.begin()+tableLimit, m_collection.end());
}
}
std::ostream& operator<<(std::ostream &out, const TargetPhraseCollection &obj)
{
TargetPhraseCollection::const_iterator iter;
for (iter = obj.begin(); iter != obj.end(); ++iter) {
const TargetPhrase &tp = **iter;
out << tp << endl;
}
return out;
}
void TargetPhraseCollectionWithSourcePhrase::Add(TargetPhrase *targetPhrase)
{
UTIL_THROW(util::Exception, "Must use method Add(TargetPhrase*, const Phrase&)");
}
void TargetPhraseCollectionWithSourcePhrase::Add(TargetPhrase *targetPhrase, const Phrase &sourcePhrase)
{
m_collection.push_back(targetPhrase);
m_sourcePhrases.push_back(sourcePhrase);
}
} // namespace
|
