File size: 5,750 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 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 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 |
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 Hieu Hoang
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 "ChartTranslationOptions.h"
#include "ChartHypothesis.h"
#include "ChartCellLabel.h"
#include "ChartTranslationOption.h"
#include "InputPath.h"
#include "StaticData.h"
#include "TranslationTask.h"
using namespace std;
namespace Moses
{
ChartTranslationOptions::ChartTranslationOptions(const TargetPhraseCollection &targetPhraseColl,
const StackVec &stackVec,
const Range &range,
float score)
: m_stackVec(stackVec)
, m_wordsRange(&range)
, m_estimateOfBestScore(score)
{
TargetPhraseCollection::const_iterator iter;
for (iter = targetPhraseColl.begin(); iter != targetPhraseColl.end(); ++iter) {
const TargetPhrase *origTP = *iter;
boost::shared_ptr<ChartTranslationOption> ptr(new ChartTranslationOption(*origTP));
m_collection.push_back(ptr);
}
}
ChartTranslationOptions::~ChartTranslationOptions()
{
}
//! functor to compare (chart) hypotheses by (descending) score
class ChartTranslationOptionScoreOrderer
{
public:
bool operator()(const boost::shared_ptr<ChartTranslationOption> &transOptA
, const boost::shared_ptr<ChartTranslationOption> &transOptB) const {
const ScoreComponentCollection &scoresA = transOptA->GetScores();
const ScoreComponentCollection &scoresB = transOptB->GetScores();
return scoresA.GetWeightedScore() > scoresB.GetWeightedScore();
}
};
void ChartTranslationOptions::EvaluateWithSourceContext(const InputType &input, const InputPath &inputPath)
{
SetInputPath(&inputPath);
// if (StaticData::Instance().GetPlaceholderFactor() != NOT_FOUND) {
if (inputPath.ttask->options()->input.placeholder_factor != NOT_FOUND) {
CreateSourceRuleFromInputPath();
}
CollType::iterator iter;
for (iter = m_collection.begin(); iter != m_collection.end(); ++iter) {
ChartTranslationOption &transOpt = **iter;
transOpt.SetInputPath(&inputPath);
transOpt.EvaluateWithSourceContext(input, inputPath, m_stackVec);
}
// get rid of -inf trans opts
size_t numDiscard = 0;
for (size_t i = 0; i < m_collection.size(); ++i) {
ChartTranslationOption *transOpt = m_collection[i].get();
if (transOpt->GetScores().GetWeightedScore() == - std::numeric_limits<float>::infinity()) {
++numDiscard;
} else if (numDiscard) {
m_collection[i - numDiscard] = m_collection[i];
}
}
size_t newSize = m_collection.size() - numDiscard;
m_collection.resize(newSize);
// sort if necessary
const StaticData &staticData = StaticData::Instance();
if (staticData.RequireSortingAfterSourceContext()) {
std::sort(m_collection.begin()
, m_collection.begin() + newSize
, ChartTranslationOptionScoreOrderer());
}
}
void ChartTranslationOptions::SetInputPath(const InputPath *inputPath)
{
CollType::iterator iter;
for (iter = m_collection.begin(); iter != m_collection.end(); ++iter) {
ChartTranslationOption &transOpt = **iter;
transOpt.SetInputPath(inputPath);
}
}
void ChartTranslationOptions::CreateSourceRuleFromInputPath()
{
if (m_collection.size() == 0) {
return;
}
const InputPath *inputPath = m_collection.front()->GetInputPath();
assert(inputPath);
std::vector<const Word*> &ruleSourceFromInputPath = inputPath->AddRuleSourceFromInputPath();
size_t chartCellIndex = 0;
const ChartCellLabel *chartCellLabel = (chartCellIndex < m_stackVec.size()) ? m_stackVec[chartCellIndex] : NULL;
size_t ind = 0;
for (size_t sourcePos = m_wordsRange->GetStartPos(); sourcePos <= m_wordsRange->GetEndPos(); ++sourcePos, ++ind) {
if (chartCellLabel) {
if (sourcePos == chartCellLabel->GetCoverage().GetEndPos()) {
// end of child range. push an empty word to denote non-term
ruleSourceFromInputPath.push_back(NULL);
++chartCellIndex;
chartCellLabel = (chartCellIndex < m_stackVec.size()) ? m_stackVec[chartCellIndex] : NULL;
} else if (sourcePos >= chartCellLabel->GetCoverage().GetStartPos()) {
// in the range of child hypo. do nothing
} else {
// not yet reached child range. add word
ruleSourceFromInputPath.push_back(&inputPath->GetPhrase().GetWord(ind));
}
} else {
// no child in sight. add word
ruleSourceFromInputPath.push_back(&inputPath->GetPhrase().GetWord(ind));
}
}
// save it to each trans opt
CollType::iterator iter;
for (iter = m_collection.begin(); iter != m_collection.end(); ++iter) {
ChartTranslationOption &transOpt = **iter;
transOpt.SetSourceRuleFromInputPath(&ruleSourceFromInputPath);
}
}
std::ostream& operator<<(std::ostream &out, const ChartTranslationOptions &obj)
{
for (size_t i = 0; i < obj.m_collection.size(); ++i) {
const ChartTranslationOption &transOpt = *obj.m_collection[i];
out << transOpt << endl;
}
return out;
}
}
|