mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-11 11:25:40 +03:00
117 lines
3.0 KiB
C++
117 lines
3.0 KiB
C++
#include "SemposOverlapping.h"
|
|
#include "SemposScorer.h"
|
|
|
|
#include <algorithm>
|
|
#include <stdexcept>
|
|
|
|
using namespace std;
|
|
|
|
namespace
|
|
{
|
|
|
|
MosesTuning::SemposOverlapping* g_overlapping = NULL;
|
|
|
|
} // namespace
|
|
|
|
namespace MosesTuning
|
|
{
|
|
|
|
|
|
SemposOverlapping* SemposOverlappingFactory::GetOverlapping(const string& str, const SemposScorer* sempos)
|
|
{
|
|
if (str == "cap-micro") {
|
|
return new CapMicroOverlapping(sempos);
|
|
} else if (str == "cap-macro") {
|
|
return new CapMacroOverlapping(sempos);
|
|
} else {
|
|
throw runtime_error("Unknown overlapping: " + str);
|
|
}
|
|
}
|
|
|
|
void SemposOverlappingFactory::SetOverlapping(SemposOverlapping* ovr)
|
|
{
|
|
g_overlapping = ovr;
|
|
}
|
|
|
|
vector<ScoreStatsType> CapMicroOverlapping::prepareStats(const sentence_t& cand, const sentence_t& ref)
|
|
{
|
|
vector<ScoreStatsType> stats(2);
|
|
sentence_t intersection;
|
|
|
|
set_intersection(cand.begin(), cand.end(), ref.begin(), ref.end(),
|
|
inserter(intersection, intersection.begin()));
|
|
|
|
int multCoeff = 1000;
|
|
|
|
float interSum = 0;
|
|
for (sentence_t::iterator it = intersection.begin(); it != intersection.end(); it++) {
|
|
interSum += semposScorer->weight(it->first);
|
|
}
|
|
|
|
float refSum = 0;
|
|
for (sentence_t::iterator it = ref.begin(); it != ref.end(); it++) {
|
|
refSum += semposScorer->weight(it->first);
|
|
}
|
|
|
|
stats[0] = (ScoreStatsType)(multCoeff * interSum);
|
|
stats[1] = (ScoreStatsType)(multCoeff * refSum);
|
|
return stats;
|
|
}
|
|
|
|
float CapMicroOverlapping::calculateScore(const vector<ScoreStatsType>& stats) const
|
|
{
|
|
if (stats.size() != 2) {
|
|
throw std::runtime_error("Size of stats vector has to be 2");
|
|
}
|
|
if (stats[1] == 0) return 1.0f;
|
|
return stats[0] / static_cast<float>(stats[1]);
|
|
}
|
|
|
|
vector<ScoreStatsType> CapMacroOverlapping::prepareStats(const sentence_t& cand, const sentence_t& ref)
|
|
{
|
|
vector<ScoreStatsType> stats(2 * kMaxNOC);
|
|
sentence_t intersection;
|
|
|
|
set_intersection(cand.begin(), cand.end(), ref.begin(), ref.end(),
|
|
inserter(intersection, intersection.begin()));
|
|
|
|
int multCoeff = 1000;
|
|
|
|
for (int i = 0; i < 2 * kMaxNOC; ++i) stats[i] = 0;
|
|
for (sentence_t::const_iterator it = intersection.begin(); it != intersection.end(); ++it) {
|
|
const int sempos = it->second;
|
|
float weight = semposScorer->weight(it->first);
|
|
stats[2 * sempos] += weight * multCoeff ;
|
|
}
|
|
for (sentence_t::const_iterator it = ref.begin(); it != ref.end(); ++it) {
|
|
const int sempos = it->second;
|
|
float weight = semposScorer->weight(it->first);
|
|
stats[2 * sempos + 1] += weight * multCoeff;
|
|
}
|
|
|
|
return stats;
|
|
}
|
|
|
|
float CapMacroOverlapping::calculateScore(const vector<ScoreStatsType>& stats) const
|
|
{
|
|
if (stats.size() != 2 * kMaxNOC) {
|
|
// TODO: Add some comments. The number "38" looks like a magic number.
|
|
throw std::runtime_error("Size of stats vector has to be 38");
|
|
}
|
|
|
|
int n = 0;
|
|
float sum = 0;
|
|
for (int i = 0; i < kMaxNOC; ++i) {
|
|
int clipped = stats[2 * i];
|
|
int refsize = stats[2 * i + 1];
|
|
if (refsize > 0) {
|
|
sum += clipped / static_cast<float>(refsize);
|
|
++n;
|
|
}
|
|
}
|
|
if (n == 0) return 1;
|
|
return sum / n;
|
|
}
|
|
|
|
}
|