mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-11 19:27:11 +03:00
e7a2483b22
Squashed commit of the following: - Clean up PRO. - Clean up ScoreStats. - Clean up ScoreData. - Clean up ScoreArray. - Remove unnecessary headers. - Clean up ScopedVector. - Clean up Point. - Clean up PerScorer. - Clean up Optimizer. - Clean up MergeScorer. - Clean up InterpolatedScorer. - Clean up FileStream. - Clean up FeatureStats. - Remove inefficient string concatenation. - Clean up FeatureData. - Clean up FeatureArray. - Clean up Data.
129 lines
3.0 KiB
C++
129 lines
3.0 KiB
C++
/*
|
|
* Data.h
|
|
* mert - Minimum Error Rate Training
|
|
*
|
|
* Created by Nicola Bertoldi on 13/05/08.
|
|
*
|
|
*/
|
|
|
|
#ifndef MERT_DATA_H_
|
|
#define MERT_DATA_H_
|
|
|
|
using namespace std;
|
|
|
|
#include <limits>
|
|
#include <vector>
|
|
#include <iostream>
|
|
|
|
#include<boost/shared_ptr.hpp>
|
|
|
|
#include "Util.h"
|
|
#include "FeatureData.h"
|
|
#include "ScoreData.h"
|
|
|
|
class Scorer;
|
|
|
|
typedef boost::shared_ptr<ScoreData> ScoreDataHandle;
|
|
typedef boost::shared_ptr<FeatureData> FeatureDataHandle;
|
|
|
|
class Data
|
|
{
|
|
private:
|
|
Scorer* m_scorer;
|
|
std::string m_score_type;
|
|
size_t m_num_scores;
|
|
bool m_sparse_flag;
|
|
ScoreDataHandle m_score_data;
|
|
FeatureDataHandle m_feature_data;
|
|
|
|
// Helper functions for loadnbest();
|
|
void InitFeatureMap(const std::string& str);
|
|
void AddFeatures(const std::string& str,
|
|
const std::string& sentence_index);
|
|
|
|
public:
|
|
explicit Data(Scorer& sc);
|
|
Data();
|
|
|
|
//Note that there is no copy constructor implemented, so only the
|
|
//compiler synthesised shallow copy is available
|
|
|
|
inline void clear() {
|
|
m_score_data->clear();
|
|
m_feature_data->clear();
|
|
}
|
|
|
|
ScoreDataHandle getScoreData() {
|
|
return m_score_data;
|
|
}
|
|
|
|
FeatureDataHandle getFeatureData() {
|
|
return m_feature_data;
|
|
}
|
|
|
|
Scorer* getScorer() {
|
|
return m_scorer;
|
|
}
|
|
|
|
inline size_t NumberOfFeatures() const {
|
|
return m_feature_data->NumberOfFeatures();
|
|
}
|
|
inline void NumberOfFeatures(size_t v) {
|
|
m_feature_data->NumberOfFeatures(v);
|
|
}
|
|
inline std::string Features() const {
|
|
return m_feature_data->Features();
|
|
}
|
|
inline void Features(const std::string &f) {
|
|
m_feature_data->Features(f);
|
|
}
|
|
|
|
inline bool hasSparseFeatures() const { return m_sparse_flag; }
|
|
void mergeSparseFeatures();
|
|
|
|
void loadnbest(const std::string &file);
|
|
|
|
void load(const std::string &featfile,const std::string &scorefile) {
|
|
m_feature_data->load(featfile);
|
|
m_score_data->load(scorefile);
|
|
if (m_feature_data->hasSparseFeatures())
|
|
m_sparse_flag = true;
|
|
}
|
|
|
|
//ADDED BY TS
|
|
void remove_duplicates();
|
|
//END_ADDED
|
|
|
|
void save(const std::string &featfile,const std::string &scorefile, bool bin=false) {
|
|
|
|
if (bin) cerr << "Binary write mode is selected" << endl;
|
|
else cerr << "Binary write mode is NOT selected" << endl;
|
|
|
|
m_feature_data->save(featfile, bin);
|
|
m_score_data->save(scorefile, bin);
|
|
}
|
|
|
|
inline bool existsFeatureNames() const {
|
|
return m_feature_data->existsFeatureNames();
|
|
}
|
|
|
|
inline std::string getFeatureName(size_t idx) const {
|
|
return m_feature_data->getFeatureName(idx);
|
|
}
|
|
|
|
inline size_t getFeatureIndex(const std::string& name) const {
|
|
return m_feature_data->getFeatureIndex(name);
|
|
}
|
|
|
|
/**
|
|
* Create shard_count shards. If shard_size == 0, then the shards are non-overlapping
|
|
* and exhaust the data. If 0 < shard_size <= 1, then shards are chosen by sampling
|
|
* the data (with replacement) and shard_size is interpreted as the proportion
|
|
* of the total size.
|
|
*/
|
|
void createShards(size_t shard_count, float shard_size, const std::string& scorerconfig,
|
|
std::vector<Data>& shards);
|
|
};
|
|
|
|
#endif // MERT_DATA_H_
|