mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-10-27 20:12:02 +03:00
e4f5c69109
Some FF (Mmsapt, LexicalReordering, Many single-value FF) provide this number during "registration"; when missing, a default weight vector of uniform 1.0 is automatically generated. This eliminates the need for the user to figure out what the exact number of features is for each FF, which can get complicated, e.g. in the case of Mmsapt/PhraseDictionaryBitextSampling.
112 lines
3.0 KiB
C++
112 lines
3.0 KiB
C++
#include <vector>
|
|
#include <set>
|
|
#include "NieceTerminal.h"
|
|
#include "moses/ScoreComponentCollection.h"
|
|
#include "moses/TargetPhrase.h"
|
|
#include "moses/ChartCellLabel.h"
|
|
#include "moses/InputType.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace Moses
|
|
{
|
|
NieceTerminal::NieceTerminal(const std::string &line)
|
|
:StatelessFeatureFunction(line,true)
|
|
,m_hardConstraint(false)
|
|
{
|
|
ReadParameters();
|
|
}
|
|
|
|
std::vector<float> NieceTerminal::DefaultWeights() const
|
|
{
|
|
UTIL_THROW_IF2(m_numScoreComponents != 1,
|
|
"NieceTerminal must only have 1 score");
|
|
vector<float> ret(1, 1);
|
|
return ret;
|
|
}
|
|
|
|
void NieceTerminal::EvaluateInIsolation(const Phrase &source
|
|
, const TargetPhrase &targetPhrase
|
|
, ScoreComponentCollection &scoreBreakdown
|
|
, ScoreComponentCollection &estimatedFutureScore) const
|
|
{
|
|
targetPhrase.SetRuleSource(source);
|
|
}
|
|
|
|
void NieceTerminal::EvaluateWithSourceContext(const InputType &input
|
|
, const InputPath &inputPath
|
|
, const TargetPhrase &targetPhrase
|
|
, const StackVec *stackVec
|
|
, ScoreComponentCollection &scoreBreakdown
|
|
, ScoreComponentCollection *estimatedFutureScore) const
|
|
{
|
|
assert(stackVec);
|
|
|
|
const Phrase *ruleSource = targetPhrase.GetRuleSource();
|
|
assert(ruleSource);
|
|
|
|
std::set<Word> terms;
|
|
for (size_t i = 0; i < ruleSource->GetSize(); ++i) {
|
|
const Word &word = ruleSource->GetWord(i);
|
|
if (!word.IsNonTerminal()) {
|
|
terms.insert(word);
|
|
}
|
|
}
|
|
|
|
for (size_t i = 0; i < stackVec->size(); ++i) {
|
|
const ChartCellLabel &cell = *stackVec->at(i);
|
|
const WordsRange &ntRange = cell.GetCoverage();
|
|
bool containTerm = ContainTerm(input, ntRange, terms);
|
|
|
|
if (containTerm) {
|
|
//cerr << "ruleSource=" << *ruleSource << " ";
|
|
//cerr << "ntRange=" << ntRange << endl;
|
|
|
|
// non-term contains 1 of the terms in the rule.
|
|
float score = m_hardConstraint ? - std::numeric_limits<float>::infinity() : 1;
|
|
scoreBreakdown.PlusEquals(this, score);
|
|
return;
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
void NieceTerminal::EvaluateWhenApplied(const Hypothesis& hypo,
|
|
ScoreComponentCollection* accumulator) const
|
|
{}
|
|
|
|
void NieceTerminal::EvaluateWhenApplied(const ChartHypothesis &hypo,
|
|
ScoreComponentCollection* accumulator) const
|
|
{}
|
|
|
|
bool NieceTerminal::ContainTerm(const InputType &input,
|
|
const WordsRange &ntRange,
|
|
const std::set<Word> &terms) const
|
|
{
|
|
std::set<Word>::const_iterator iter;
|
|
|
|
for (size_t pos = ntRange.GetStartPos(); pos <= ntRange.GetEndPos(); ++pos) {
|
|
const Word &word = input.GetWord(pos);
|
|
iter = terms.find(word);
|
|
|
|
if (iter != terms.end()) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void NieceTerminal::SetParameter(const std::string& key, const std::string& value)
|
|
{
|
|
if (key == "hard-constraint") {
|
|
m_hardConstraint = Scan<bool>(value);
|
|
} else {
|
|
StatelessFeatureFunction::SetParameter(key, value);
|
|
}
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|