File size: 2,592 Bytes
158b61b |
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 |
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 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 "HoleCollection.h"
#include <algorithm>
namespace MosesTraining
{
void HoleCollection::SortSourceHoles()
{
assert(m_sortedSourceHoles.size() == 0);
// add
HoleList::iterator iter;
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter) {
Hole &currHole = *iter;
m_sortedSourceHoles.push_back(&currHole);
}
// sort
std::sort(m_sortedSourceHoles.begin(), m_sortedSourceHoles.end(), HoleSourceOrderer());
}
void HoleCollection::Add(int startT, int endT, int startS, int endS)
{
Hole hole(startS, endS, startT, endT);
m_scope.push_back(Scope(hole));
m_sourceHoleStartPoints.push_back(startS);
m_sourceHoleEndPoints.push_back(endS);
m_holes.push_back(hole);
m_sortedSourceHoles.clear();
}
void HoleCollection::RemoveLast()
{
m_scope.pop_back();
m_sourceHoleStartPoints.pop_back();
m_sourceHoleEndPoints.pop_back();
m_holes.pop_back();
m_sortedSourceHoles.clear();
}
int HoleCollection::Scope(const Hole &proposedHole) const
{
const int holeStart = proposedHole.GetStart(0);
const int holeEnd = proposedHole.GetEnd(0);
int scope = m_scope.back();
if (holeStart == m_sourcePhraseStart.back() ||
find(m_sourceHoleEndPoints.begin(), m_sourceHoleEndPoints.end(), holeStart-1) != m_sourceHoleEndPoints.end()) {
++scope; // Adding hole would introduce choice point at start of hole.
}
if (holeEnd == m_sourcePhraseEnd.back() ||
find(m_sourceHoleStartPoints.begin(), m_sourceHoleStartPoints.end(), holeEnd-1) != m_sourceHoleStartPoints.end()) {
++scope; // Adding hole would introduce choice point at end of hole.
}
return scope;
}
}
|