mosesdecoder/mert/BleuScorer.h

105 lines
2.4 KiB
C++

#ifndef __BLEUSCORER_H__
#define __BLEUSCORER_H__
#include <cctype>
#include <cmath>
#include <ctime>
#include <stdexcept>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#include "Util.h"
#include "Scorer.h"
#include "ScoreData.h"
using namespace std;
enum BleuReferenceLengthStrategy { AVERAGE, SHORTEST, CLOSEST };
/**
* Bleu scoring
**/
class BleuScorer: public Scorer {
public:
BleuScorer() : Scorer("BLEU"),_refLengthStrategy(SHORTEST) {}
virtual void setReferenceFiles(const vector<string>& referenceFiles);
virtual void prepareStats(int sid, const string& text, ScoreStats& entry);
virtual void score(const candidates_t& candidates, const diffs_t& diffs,
scores_t& scores);
static const int LENGTH;
private:
//no copy
BleuScorer(const BleuScorer&);
BleuScorer& operator=(const BleuScorer&);
//Used to construct the ngram map
struct CompareNgrams {
int operator() (const vector<int>& a, const vector<int>& b) {
/*
cerr << "compare:";
copy(a.begin(), a.end(), ostream_iterator<int>(cerr," "));
cerr << " with ";
copy(b.begin(), b.end(), ostream_iterator<int>(cerr," "));
cerr << endl;
*/
size_t i;
size_t as = a.size();
size_t bs = b.size();
for (i = 0; i < as && i < bs; ++i) {
if (a[i] < b[i]) {
//cerr << "true" << endl;
return true;
}
if (a[i] > b[i]) {
//cerr << "false" << endl;
return false;
}
}
//entries are equal, shortest wins
/*if (as < bs) {
cerr << "true" << endl;
} else {
cerr << "false" << endl;
}*/
return as < bs;;
}
};
typedef map<vector<int>,int,CompareNgrams> counts_t;
typedef map<vector<int>,int,CompareNgrams>::iterator counts_it;
typedef vector<counts_t*> refcounts_t;
size_t countNgrams(const string& line, counts_t& counts, unsigned int n);
float bleu(const vector<int>& comps);
void dump_counts(counts_t& counts) {
for (counts_it i = counts.begin(); i != counts.end(); ++i) {
cerr << "(";
copy(i->first.begin(), i->first.end(), ostream_iterator<int>(cerr," "));
cerr << ") " << i->second << ", ";
}
cerr << endl;
}
BleuReferenceLengthStrategy _refLengthStrategy;
// data extracted from reference files
refcounts_t _refcounts;
vector<vector<size_t> > _reflengths;
};
#endif //__BLEUSCORER_H