mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-27 05:55:02 +03:00
146 lines
3.3 KiB
C++
146 lines
3.3 KiB
C++
/*
|
|
* FeatureData.cpp
|
|
* met - Minimum Error Training
|
|
*
|
|
* Created by Nicola Bertoldi on 13/05/08.
|
|
*
|
|
*/
|
|
|
|
#include "FeatureData.h"
|
|
|
|
#include <limits>
|
|
#include "FileStream.h"
|
|
#include "Util.h"
|
|
|
|
static const float MIN_FLOAT=-1.0*numeric_limits<float>::max();
|
|
static const float MAX_FLOAT=numeric_limits<float>::max();
|
|
|
|
FeatureData::FeatureData()
|
|
: number_of_features(0)
|
|
{}
|
|
|
|
void FeatureData::save(std::ofstream& outFile, bool bin)
|
|
{
|
|
for (featdata_t::iterator i = array_.begin(); i !=array_.end(); i++)
|
|
i->save(outFile, bin);
|
|
}
|
|
|
|
void FeatureData::save(const std::string &file, bool bin)
|
|
{
|
|
if (file.empty()) return;
|
|
|
|
TRACE_ERR("saving the array into " << file << std::endl);
|
|
|
|
std::ofstream outFile(file.c_str(), std::ios::out); // matches a stream with a file. Opens the file
|
|
|
|
save(outFile, bin);
|
|
|
|
outFile.close();
|
|
}
|
|
|
|
void FeatureData::load(ifstream& inFile, const SparseVector& sparseWeights)
|
|
{
|
|
FeatureArray entry;
|
|
|
|
while (!inFile.eof()) {
|
|
|
|
if (!inFile.good()) {
|
|
std::cerr << "ERROR FeatureData::load inFile.good()" << std::endl;
|
|
}
|
|
|
|
entry.clear();
|
|
entry.load(inFile, sparseWeights);
|
|
|
|
if (entry.size() == 0)
|
|
break;
|
|
|
|
if (size() == 0)
|
|
setFeatureMap(entry.Features());
|
|
|
|
add(entry);
|
|
}
|
|
}
|
|
|
|
|
|
void FeatureData::load(const std::string &file, const SparseVector& sparseWeights)
|
|
{
|
|
TRACE_ERR("loading feature data from " << file << std::endl);
|
|
|
|
inputfilestream inFile(file); // matches a stream with a file. Opens the file
|
|
|
|
if (!inFile) {
|
|
throw runtime_error("Unable to open feature file: " + file);
|
|
}
|
|
|
|
load((ifstream&) inFile, sparseWeights);
|
|
|
|
inFile.close();
|
|
}
|
|
|
|
void FeatureData::add(FeatureArray& e)
|
|
{
|
|
if (exists(e.getIndex())) { // array at position e.getIndex() already exists
|
|
//enlarge array at position e.getIndex()
|
|
size_t pos = getIndex(e.getIndex());
|
|
array_.at(pos).merge(e);
|
|
} else {
|
|
array_.push_back(e);
|
|
setIndex();
|
|
}
|
|
}
|
|
|
|
void FeatureData::add(FeatureStats& e, const std::string& sent_idx)
|
|
{
|
|
if (exists(sent_idx)) { // array at position e.getIndex() already exists
|
|
//enlarge array at position e.getIndex()
|
|
size_t pos = getIndex(sent_idx);
|
|
// TRACE_ERR("Inserting " << e << " in array " << sent_idx << std::endl);
|
|
array_.at(pos).add(e);
|
|
} else {
|
|
// TRACE_ERR("Creating a new entry in the array and inserting " << e << std::endl);
|
|
FeatureArray a;
|
|
a.NumberOfFeatures(number_of_features);
|
|
a.Features(features);
|
|
a.setIndex(sent_idx);
|
|
a.add(e);
|
|
add(a);
|
|
}
|
|
}
|
|
|
|
bool FeatureData::check_consistency() const
|
|
{
|
|
if (array_.size() == 0)
|
|
return true;
|
|
|
|
for (featdata_t::const_iterator i = array_.begin(); i != array_.end(); i++)
|
|
if (!i->check_consistency()) return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
void FeatureData::setIndex()
|
|
{
|
|
size_t j=0;
|
|
for (featdata_t::iterator i = array_.begin(); i !=array_.end(); i++) {
|
|
idx2arrayname_[j]=(*i).getIndex();
|
|
arrayname2idx_[(*i).getIndex()] = j;
|
|
j++;
|
|
}
|
|
}
|
|
|
|
void FeatureData::setFeatureMap(const std::string& feat)
|
|
{
|
|
number_of_features = 0;
|
|
features = feat;
|
|
|
|
std::string substring, stringBuf;
|
|
stringBuf = features;
|
|
while (!stringBuf.empty()) {
|
|
getNextPound(stringBuf, substring);
|
|
|
|
featname2idx_[substring] = idx2featname_.size();
|
|
idx2featname_[idx2featname_.size()] = substring;
|
|
number_of_features++;
|
|
}
|
|
}
|