2013-09-25 03:51:50 +04:00
|
|
|
#include "mmsapt.h"
|
|
|
|
#include <boost/foreach.hpp>
|
2014-07-09 05:41:28 +04:00
|
|
|
#include <boost/scoped_ptr.hpp>
|
2013-09-25 03:51:50 +04:00
|
|
|
#include <boost/tokenizer.hpp>
|
2014-03-24 17:30:22 +04:00
|
|
|
#include <algorithm>
|
2014-07-09 05:41:28 +04:00
|
|
|
#include "moses/TranslationModel/UG/mm/ug_phrasepair.h"
|
|
|
|
#include "util/exception.hh"
|
|
|
|
#include <set>
|
2013-09-25 03:51:50 +04:00
|
|
|
|
|
|
|
namespace Moses
|
|
|
|
{
|
|
|
|
using namespace bitext;
|
|
|
|
using namespace std;
|
|
|
|
using namespace boost;
|
2014-07-09 05:41:28 +04:00
|
|
|
|
2014-03-25 05:49:24 +04:00
|
|
|
void
|
|
|
|
fillIdSeq(Phrase const& mophrase, size_t const ifactor,
|
|
|
|
TokenIndex const& V, vector<id_type>& dest)
|
|
|
|
{
|
|
|
|
dest.resize(mophrase.GetSize());
|
|
|
|
for (size_t i = 0; i < mophrase.GetSize(); ++i)
|
|
|
|
{
|
|
|
|
Factor const* f = mophrase.GetFactor(i,ifactor);
|
|
|
|
dest[i] = V[f->ToString()];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
|
|
|
|
void
|
2014-07-09 05:41:28 +04:00
|
|
|
parseLine(string const& line, map<string,string> & param)
|
2013-09-25 03:51:50 +04:00
|
|
|
{
|
|
|
|
char_separator<char> sep("; ");
|
|
|
|
tokenizer<char_separator<char> > tokens(line,sep);
|
|
|
|
BOOST_FOREACH(string const& t,tokens)
|
|
|
|
{
|
|
|
|
size_t i = t.find_first_not_of(" =");
|
|
|
|
size_t j = t.find_first_of(" =",i+1);
|
|
|
|
size_t k = t.find_first_not_of(" =",j+1);
|
2014-07-09 05:41:28 +04:00
|
|
|
UTIL_THROW_IF2(i == string::npos || k == string::npos,
|
|
|
|
"[" << HERE << "] "
|
|
|
|
<< "Parameter specification error near '"
|
|
|
|
<< t << "' in moses ini line\n"
|
|
|
|
<< line);
|
2013-09-25 03:51:50 +04:00
|
|
|
assert(i != string::npos);
|
|
|
|
assert(k != string::npos);
|
2014-07-09 05:41:28 +04:00
|
|
|
param[t.substr(i,j)] = t.substr(k);
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|
|
|
|
}
|
2014-03-24 17:30:22 +04:00
|
|
|
|
2014-02-22 04:27:07 +04:00
|
|
|
#if 0
|
2013-09-25 03:51:50 +04:00
|
|
|
Mmsapt::
|
|
|
|
Mmsapt(string const& description, string const& line)
|
2014-02-08 21:56:48 +04:00
|
|
|
: PhraseDictionary(description,line), ofactor(1,0)
|
2013-09-25 03:51:50 +04:00
|
|
|
{
|
|
|
|
this->init(line);
|
|
|
|
}
|
2014-02-25 07:10:16 +04:00
|
|
|
#endif
|
2013-09-25 03:51:50 +04:00
|
|
|
|
2014-06-14 16:03:31 +04:00
|
|
|
vector<string> const&
|
|
|
|
Mmsapt::
|
|
|
|
GetFeatureNames() const
|
|
|
|
{
|
|
|
|
return m_feature_names;
|
|
|
|
}
|
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
Mmsapt::
|
|
|
|
Mmsapt(string const& line)
|
2014-06-03 18:41:59 +04:00
|
|
|
: PhraseDictionary(line)
|
|
|
|
, ofactor(1,0)
|
|
|
|
, m_tpc_ctr(0)
|
2013-09-25 03:51:50 +04:00
|
|
|
{
|
|
|
|
this->init(line);
|
|
|
|
}
|
|
|
|
|
2014-06-03 18:41:59 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
read_config_file(string fname,map<string,string>& param)
|
|
|
|
{
|
|
|
|
string line;
|
|
|
|
ifstream config(fname.c_str());
|
|
|
|
while (getline(config,line))
|
|
|
|
{
|
|
|
|
if (line[0] == '#') continue;
|
|
|
|
char_separator<char> sep(" \t");
|
|
|
|
tokenizer<char_separator<char> > tokens(line,sep);
|
|
|
|
tokenizer<char_separator<char> >::const_iterator t = tokens.begin();
|
|
|
|
if (t == tokens.end()) continue;
|
|
|
|
string& foo = param[*t++];
|
|
|
|
if (t == tokens.end() || foo.size()) continue;
|
|
|
|
// second condition: do not overwrite settings from the line in moses.ini
|
|
|
|
UTIL_THROW_IF2(*t++ != "=" || t == tokens.end(),
|
|
|
|
"Syntax error in Mmsapt config file '" << fname << "'.");
|
|
|
|
for (foo = *t++; t != tokens.end(); foo += " " + *t++);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
register_ff(sptr<pscorer> const& ff, vector<sptr<pscorer> > & registry)
|
|
|
|
{
|
|
|
|
registry.push_back(ff);
|
|
|
|
ff->setIndex(m_feature_names.size());
|
|
|
|
for (int i = 0; i < ff->fcnt(); ++i)
|
|
|
|
{
|
|
|
|
m_feature_names.push_back(ff->fname(i));
|
|
|
|
m_is_logval.push_back(ff->isLogVal(i));
|
|
|
|
m_is_integer.push_back(ff->isIntegerValued(i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
Mmsapt::
|
|
|
|
isLogVal(int i) const { return m_is_logval.at(i); }
|
|
|
|
|
|
|
|
bool
|
|
|
|
Mmsapt::
|
|
|
|
isInteger(int i) const { return m_is_integer.at(i); }
|
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
init(string const& line)
|
|
|
|
{
|
2014-06-03 18:41:59 +04:00
|
|
|
map<string,string>::const_iterator m;
|
2014-07-09 05:41:28 +04:00
|
|
|
parseLine(line,this->param);
|
|
|
|
|
|
|
|
this->m_numScoreComponents = atoi(param["num-features"].c_str());
|
2014-06-03 18:41:59 +04:00
|
|
|
|
|
|
|
m = param.find("config");
|
|
|
|
if (m != param.end())
|
|
|
|
read_config_file(m->second,param);
|
2014-07-09 05:41:28 +04:00
|
|
|
|
2014-07-29 16:57:00 +04:00
|
|
|
m = param.find("base");
|
|
|
|
if (m != param.end())
|
|
|
|
{
|
|
|
|
bname = m->second;
|
|
|
|
m = param.find("path");
|
|
|
|
UTIL_THROW_IF2((m != param.end() && m->second != bname),
|
|
|
|
"Conflicting aliases for path:\n"
|
|
|
|
<< "path=" << string(m->second) << "\n"
|
|
|
|
<< "base=" << bname.c_str() );
|
|
|
|
}
|
|
|
|
else bname = param["path"];
|
2013-09-25 03:51:50 +04:00
|
|
|
L1 = param["L1"];
|
|
|
|
L2 = param["L2"];
|
2014-07-29 16:57:00 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
UTIL_THROW_IF2(bname.size() == 0, "Missing corpus base name at " << HERE);
|
|
|
|
UTIL_THROW_IF2(L1.size() == 0, "Missing L1 tag at " << HERE);
|
|
|
|
UTIL_THROW_IF2(L2.size() == 0, "Missing L2 tag at " << HERE);
|
2014-03-24 17:30:22 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// set defaults for all parameters if not specified so far
|
|
|
|
pair<string,string> dflt("input-factor","0");
|
|
|
|
input_factor = atoi(param.insert(dflt).first->second.c_str());
|
|
|
|
// shouldn't that be a string?
|
2014-06-14 16:03:31 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
dflt = pair<string,string> ("smooth",".01");
|
|
|
|
m_lbop_conf = atof(param.insert(dflt).first->second.c_str());
|
2014-06-16 00:11:33 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
dflt = pair<string,string> ("lexalpha","0");
|
|
|
|
m_lex_alpha = atof(param.insert(dflt).first->second.c_str());
|
2014-06-16 00:11:33 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
dflt = pair<string,string> ("sample","1000");
|
|
|
|
m_default_sample_size = atoi(param.insert(dflt).first->second.c_str());
|
2014-06-14 16:03:31 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
dflt = pair<string,string>("workers","8");
|
|
|
|
m_workers = atoi(param.insert(dflt).first->second.c_str());
|
2014-03-24 17:30:22 +04:00
|
|
|
m_workers = min(m_workers,24UL);
|
|
|
|
|
2014-07-29 16:57:00 +04:00
|
|
|
|
|
|
|
dflt = pair<string,string>("table-limit","20");
|
2014-07-09 05:41:28 +04:00
|
|
|
m_tableLimit = atoi(param.insert(dflt).first->second.c_str());
|
2014-06-05 04:47:29 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
dflt = pair<string,string>("cache","10000");
|
|
|
|
size_t hsize = max(1000,atoi(param.insert(dflt).first->second.c_str()));
|
|
|
|
m_history.reserve(hsize);
|
2014-06-05 04:47:29 +04:00
|
|
|
// in plain language: cache size is at least 1000, and 10,000 by default
|
2014-06-14 16:03:31 +04:00
|
|
|
// this cache keeps track of the most frequently used target phrase collections
|
|
|
|
// even when not actively in use
|
2014-06-03 18:41:59 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// Feature functions are initialized in function Load();
|
|
|
|
param.insert(pair<string,string>("pfwd", "g"));
|
|
|
|
param.insert(pair<string,string>("pbwd", "g"));
|
|
|
|
param.insert(pair<string,string>("logcnt", "0"));
|
|
|
|
param.insert(pair<string,string>("coh", "0"));
|
|
|
|
param.insert(pair<string,string>("rare", "1"));
|
|
|
|
param.insert(pair<string,string>("prov", "1"));
|
2014-06-14 16:03:31 +04:00
|
|
|
|
2014-02-08 21:56:48 +04:00
|
|
|
poolCounts = true;
|
2014-06-14 16:03:31 +04:00
|
|
|
|
|
|
|
if ((m = param.find("extra")) != param.end())
|
|
|
|
extra_data = m->second;
|
|
|
|
|
2014-08-19 03:22:50 +04:00
|
|
|
dflt = pair<string,string>("tuneable","true");
|
|
|
|
m_tuneable = Scan<bool>(param.insert(dflt).first->second.c_str());
|
|
|
|
|
2014-09-04 09:49:26 +04:00
|
|
|
dflt = pair<string,string>("feature-sets","standard");
|
|
|
|
m_feature_set_names = Tokenize(param.insert(dflt).first->second.c_str(), ",");
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// check for unknown parameters
|
|
|
|
vector<string> known_parameters; known_parameters.reserve(50);
|
|
|
|
known_parameters.push_back("L1");
|
|
|
|
known_parameters.push_back("L2");
|
|
|
|
known_parameters.push_back("Mmsapt");
|
2014-08-05 22:47:07 +04:00
|
|
|
known_parameters.push_back("PhraseDictionaryBitextSampling"); // alias for Mmsapt
|
2014-07-29 16:57:00 +04:00
|
|
|
known_parameters.push_back("base"); // alias for path
|
2014-07-09 05:41:28 +04:00
|
|
|
known_parameters.push_back("cache");
|
|
|
|
known_parameters.push_back("coh");
|
|
|
|
known_parameters.push_back("config");
|
|
|
|
known_parameters.push_back("extra");
|
2014-09-04 09:49:26 +04:00
|
|
|
known_parameters.push_back("feature-sets");
|
2014-07-09 05:41:28 +04:00
|
|
|
known_parameters.push_back("input-factor");
|
|
|
|
known_parameters.push_back("lexalpha");
|
2014-07-29 16:57:00 +04:00
|
|
|
// known_parameters.push_back("limit"); // replaced by "table-limit"
|
2014-07-09 05:41:28 +04:00
|
|
|
known_parameters.push_back("logcnt");
|
|
|
|
known_parameters.push_back("name");
|
|
|
|
known_parameters.push_back("num-features");
|
|
|
|
known_parameters.push_back("output-factor");
|
2014-07-29 16:57:00 +04:00
|
|
|
known_parameters.push_back("path");
|
2014-07-09 05:41:28 +04:00
|
|
|
known_parameters.push_back("pbwd");
|
|
|
|
known_parameters.push_back("pfwd");
|
|
|
|
known_parameters.push_back("prov");
|
|
|
|
known_parameters.push_back("rare");
|
|
|
|
known_parameters.push_back("sample");
|
|
|
|
known_parameters.push_back("smooth");
|
2014-07-29 16:57:00 +04:00
|
|
|
known_parameters.push_back("table-limit");
|
2014-08-19 01:57:05 +04:00
|
|
|
known_parameters.push_back("tuneable");
|
2014-07-09 05:41:28 +04:00
|
|
|
known_parameters.push_back("unal");
|
|
|
|
known_parameters.push_back("workers");
|
|
|
|
for (map<string,string>::iterator m = param.begin(); m != param.end(); ++m)
|
|
|
|
{
|
|
|
|
UTIL_THROW_IF2(!binary_search(known_parameters.begin(),
|
|
|
|
known_parameters.end(), m->first),
|
|
|
|
HERE << ": Unknown parameter specification for Mmsapt: "
|
|
|
|
<< m->first);
|
|
|
|
}
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|
|
|
|
|
2014-03-13 03:13:44 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
2014-07-09 05:41:28 +04:00
|
|
|
load_extra_data(string bname, bool locking = true)
|
2014-03-13 03:13:44 +04:00
|
|
|
{
|
2014-03-13 17:41:32 +04:00
|
|
|
// TO DO: ADD CHECKS FOR ROBUSTNESS
|
|
|
|
// - file existence?
|
|
|
|
// - same number of lines?
|
|
|
|
// - sane word alignment?
|
2014-03-13 03:13:44 +04:00
|
|
|
vector<string> text1,text2,symal;
|
|
|
|
string line;
|
|
|
|
filtering_istream in1,in2,ina;
|
2014-03-13 17:41:32 +04:00
|
|
|
|
2014-03-13 03:13:44 +04:00
|
|
|
open_input_stream(bname+L1+".txt.gz",in1);
|
|
|
|
open_input_stream(bname+L2+".txt.gz",in2);
|
|
|
|
open_input_stream(bname+L1+"-"+L2+".symal.gz",ina);
|
2014-03-13 17:41:32 +04:00
|
|
|
|
|
|
|
while(getline(in1,line)) text1.push_back(line);
|
|
|
|
while(getline(in2,line)) text2.push_back(line);
|
|
|
|
while(getline(ina,line)) symal.push_back(line);
|
|
|
|
|
2014-08-04 21:50:10 +04:00
|
|
|
boost::scoped_ptr<boost::lock_guard<boost::mutex> > guard;
|
|
|
|
if (locking) guard.reset(new boost::lock_guard<boost::mutex>(this->lock));
|
2014-03-13 03:13:44 +04:00
|
|
|
btdyn = btdyn->add(text1,text2,symal);
|
2014-03-13 17:41:32 +04:00
|
|
|
assert(btdyn);
|
2014-03-25 05:49:24 +04:00
|
|
|
// cerr << "Loaded " << btdyn->T1->size() << " sentence pairs" << endl;
|
2014-03-13 03:13:44 +04:00
|
|
|
}
|
2014-06-03 18:41:59 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
template<typename fftype>
|
|
|
|
void
|
2014-06-14 16:03:31 +04:00
|
|
|
Mmsapt::
|
2014-07-09 05:41:28 +04:00
|
|
|
check_ff(string const ffname, vector<sptr<pscorer> >* registry)
|
2014-06-14 16:03:31 +04:00
|
|
|
{
|
2014-07-09 05:41:28 +04:00
|
|
|
string const& spec = param[ffname];
|
|
|
|
if (spec == "" || spec == "0") return;
|
|
|
|
if (registry)
|
|
|
|
{
|
|
|
|
sptr<fftype> ff(new fftype(spec));
|
|
|
|
register_ff(ff, *registry);
|
2014-06-14 16:03:31 +04:00
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
else if (spec[spec.size()-1] == '+') // corpus specific
|
|
|
|
{
|
|
|
|
sptr<fftype> ff(new fftype(spec));
|
|
|
|
register_ff(ff, m_active_ff_fix);
|
|
|
|
ff.reset(new fftype(spec));
|
|
|
|
register_ff(ff, m_active_ff_dyn);
|
2014-06-14 16:03:31 +04:00
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
else
|
2014-06-14 16:03:31 +04:00
|
|
|
{
|
2014-07-09 05:41:28 +04:00
|
|
|
sptr<fftype> ff(new fftype(spec));
|
|
|
|
register_ff(ff, m_active_ff_common);
|
2014-06-14 16:03:31 +04:00
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
}
|
2014-06-14 16:03:31 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
template<typename fftype>
|
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
check_ff(string const ffname, float const xtra, vector<sptr<pscorer> >* registry)
|
|
|
|
{
|
|
|
|
string const& spec = param[ffname];
|
|
|
|
if (spec == "" || spec == "0") return;
|
|
|
|
if (registry)
|
|
|
|
{
|
|
|
|
sptr<fftype> ff(new fftype(xtra,spec));
|
|
|
|
register_ff(ff, *registry);
|
|
|
|
}
|
|
|
|
else if (spec[spec.size()-1] == '+') // corpus specific
|
|
|
|
{
|
|
|
|
sptr<fftype> ff(new fftype(xtra,spec));
|
|
|
|
register_ff(ff, m_active_ff_fix);
|
|
|
|
ff.reset(new fftype(xtra,spec));
|
|
|
|
register_ff(ff, m_active_ff_dyn);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
sptr<fftype> ff(new fftype(xtra,spec));
|
|
|
|
register_ff(ff, m_active_ff_common);
|
|
|
|
}
|
2014-06-14 16:03:31 +04:00
|
|
|
}
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// void
|
|
|
|
// Mmsapt::
|
|
|
|
// add_corpus_specific_features(vector<sptr<pscorer > >& registry)
|
|
|
|
// {
|
|
|
|
// check_ff<PScorePbwd<Token> >("pbwd",m_lbop_conf,registry);
|
|
|
|
// check_ff<PScoreLogCnt<Token> >("logcnt",registry);
|
|
|
|
// }
|
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
2014-09-08 19:56:45 +04:00
|
|
|
Load(bool with_checks)
|
2013-09-25 03:51:50 +04:00
|
|
|
{
|
2014-08-04 21:50:10 +04:00
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
2014-07-09 05:41:28 +04:00
|
|
|
|
|
|
|
// can load only once
|
|
|
|
// UTIL_THROW_IF2(shards.size(),"Mmsapt is already loaded at " << HERE);
|
2014-09-08 19:56:45 +04:00
|
|
|
|
2014-09-04 09:49:26 +04:00
|
|
|
// load feature sets
|
|
|
|
BOOST_FOREACH(string const& fsname, m_feature_set_names)
|
|
|
|
{
|
2014-09-08 19:56:45 +04:00
|
|
|
// standard (default) feature set
|
|
|
|
if (fsname == "standard")
|
|
|
|
{
|
|
|
|
// lexical scores
|
|
|
|
string lexfile = bname + L1 + "-" + L2 + ".lex";
|
|
|
|
sptr<PScoreLex1<Token> > ff(new PScoreLex1<Token>(param["lex_alpha"],lexfile));
|
|
|
|
register_ff(ff,m_active_ff_common);
|
|
|
|
|
|
|
|
// these are always computed on pooled data
|
|
|
|
check_ff<PScoreRareness<Token> > ("rare", &m_active_ff_common);
|
|
|
|
check_ff<PScoreUnaligned<Token> >("unal", &m_active_ff_common);
|
|
|
|
check_ff<PScoreCoherence<Token> >("coh", &m_active_ff_common);
|
|
|
|
|
|
|
|
// for these ones either way is possible (specification ends with '+'
|
|
|
|
// if corpus-specific
|
|
|
|
check_ff<PScorePfwd<Token> >("pfwd", m_lbop_conf);
|
|
|
|
check_ff<PScorePbwd<Token> >("pbwd", m_lbop_conf);
|
|
|
|
check_ff<PScoreLogCnt<Token> >("logcnt");
|
|
|
|
|
|
|
|
// These are always corpus-specific
|
|
|
|
check_ff<PScoreProvenance<Token> >("prov", &m_active_ff_fix);
|
|
|
|
check_ff<PScoreProvenance<Token> >("prov", &m_active_ff_dyn);
|
|
|
|
}
|
|
|
|
|
|
|
|
// data source features (copies of phrase and word count specific to
|
|
|
|
// this translation model)
|
|
|
|
else if (fsname == "datasource")
|
|
|
|
{
|
|
|
|
sptr<PScorePC<Token> > ffpcnt(new PScorePC<Token>("pcnt"));
|
|
|
|
register_ff(ffpcnt,m_active_ff_common);
|
|
|
|
sptr<PScoreWC<Token> > ffwcnt(new PScoreWC<Token>("wcnt"));
|
|
|
|
register_ff(ffwcnt,m_active_ff_common);
|
|
|
|
}
|
2014-09-04 09:49:26 +04:00
|
|
|
}
|
2014-09-08 19:56:45 +04:00
|
|
|
// cerr << "Features: " << Join("|",m_feature_names) << endl;
|
|
|
|
|
|
|
|
if (with_checks)
|
2014-09-04 09:49:26 +04:00
|
|
|
{
|
2014-09-08 19:56:45 +04:00
|
|
|
UTIL_THROW_IF2(this->m_feature_names.size() != this->m_numScoreComponents,
|
|
|
|
"At " << HERE << ": number of feature values provided by "
|
|
|
|
<< "Phrase table (" << this->m_feature_names.size()
|
|
|
|
<< ") does not match number specified in Moses config file ("
|
|
|
|
<< this->m_numScoreComponents << ")!\n";);
|
2014-09-04 09:49:26 +04:00
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
// Load corpora. For the time being, we can have one memory-mapped static
|
|
|
|
// corpus and one in-memory dynamic corpus
|
|
|
|
// sptr<mmbitext> btfix(new mmbitext());
|
2014-03-24 17:30:22 +04:00
|
|
|
btfix.num_workers = this->m_workers;
|
2014-02-08 21:56:48 +04:00
|
|
|
btfix.open(bname, L1, L2);
|
2014-03-24 17:30:22 +04:00
|
|
|
btfix.setDefaultSampleSize(m_default_sample_size);
|
2014-07-09 05:41:28 +04:00
|
|
|
// shards.push_back(btfix);
|
2014-03-24 17:30:22 +04:00
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
btdyn.reset(new imbitext(btfix.V1, btfix.V2, m_default_sample_size));
|
2014-03-24 17:30:22 +04:00
|
|
|
btdyn->num_workers = this->m_workers;
|
2014-06-14 16:03:31 +04:00
|
|
|
if (extra_data.size())
|
2014-07-09 05:41:28 +04:00
|
|
|
load_extra_data(extra_data,false);
|
2014-06-14 16:03:31 +04:00
|
|
|
|
|
|
|
#if 0
|
2014-03-24 17:30:22 +04:00
|
|
|
// currently not used
|
2014-03-10 15:59:58 +04:00
|
|
|
LexicalPhraseScorer2<Token>::table_t & COOC = calc_lex.scorer.COOC;
|
|
|
|
typedef LexicalPhraseScorer2<Token>::table_t::Cell cell_t;
|
|
|
|
wlex21.resize(COOC.numCols);
|
|
|
|
for (size_t r = 0; r < COOC.numRows; ++r)
|
|
|
|
for (cell_t const* c = COOC[r].start; c < COOC[r].stop; ++c)
|
|
|
|
wlex21[c->id].push_back(r);
|
|
|
|
COOCraw.open(bname + L1 + "-" + L2 + ".coc");
|
2014-06-14 16:03:31 +04:00
|
|
|
#endif
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|
|
|
|
|
2014-02-08 21:56:48 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
add(string const& s1, string const& s2, string const& a)
|
|
|
|
{
|
|
|
|
vector<string> S1(1,s1);
|
|
|
|
vector<string> S2(1,s2);
|
|
|
|
vector<string> ALN(1,a);
|
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
btdyn = btdyn->add(S1,S2,ALN);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
TargetPhrase*
|
|
|
|
Mmsapt::
|
2014-07-09 05:41:28 +04:00
|
|
|
mkTPhrase(Phrase const& src,
|
|
|
|
PhrasePair<Token>* fix,
|
|
|
|
PhrasePair<Token>* dyn,
|
|
|
|
sptr<Bitext<Token> > const& dynbt) const
|
2014-02-08 21:56:48 +04:00
|
|
|
{
|
2014-07-09 05:41:28 +04:00
|
|
|
UTIL_THROW_IF2(!fix && !dyn, HERE <<
|
|
|
|
": Can't create target phrase from nothing.");
|
|
|
|
vector<float> fvals(this->m_numScoreComponents);
|
|
|
|
PhrasePair<Token> pool = fix ? *fix : *dyn;
|
|
|
|
if (fix)
|
|
|
|
{
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_fix)
|
|
|
|
(*ff)(btfix, *fix, &fvals);
|
|
|
|
}
|
|
|
|
if (dyn)
|
|
|
|
{
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_dyn)
|
|
|
|
(*ff)(*dynbt, *dyn, &fvals);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (fix && dyn) { pool += *dyn; }
|
|
|
|
else if (fix)
|
|
|
|
{
|
|
|
|
PhrasePair<Token> zilch; zilch.init();
|
|
|
|
TSA<Token>::tree_iterator m(dynbt->I2.get(), fix->start2, fix->len2);
|
|
|
|
if (m.size() == fix->len2)
|
|
|
|
zilch.raw2 = m.approxOccurrenceCount();
|
|
|
|
pool += zilch;
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_dyn)
|
|
|
|
(*ff)(*dynbt, ff->allowPooling() ? pool : zilch, &fvals);
|
|
|
|
}
|
|
|
|
else if (dyn)
|
|
|
|
{
|
|
|
|
PhrasePair<Token> zilch; zilch.init();
|
|
|
|
TSA<Token>::tree_iterator m(btfix.I2.get(), dyn->start2, dyn->len2);
|
|
|
|
if (m.size() == dyn->len2)
|
|
|
|
zilch.raw2 = m.approxOccurrenceCount();
|
|
|
|
pool += zilch;
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_fix)
|
|
|
|
(*ff)(*dynbt, ff->allowPooling() ? pool : zilch, &fvals);
|
|
|
|
}
|
|
|
|
if (fix)
|
|
|
|
{
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_common)
|
|
|
|
(*ff)(btfix, pool, &fvals);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
BOOST_FOREACH(sptr<pscorer> const& ff, m_active_ff_common)
|
|
|
|
(*ff)(*dynbt, pool, &fvals);
|
|
|
|
}
|
2014-08-04 22:28:04 +04:00
|
|
|
TargetPhrase* tp = new TargetPhrase(this);
|
2014-07-09 05:41:28 +04:00
|
|
|
Token const* x = fix ? fix->start2 : dyn->start2;
|
|
|
|
uint32_t len = fix ? fix->len2 : dyn->len2;
|
|
|
|
for (uint32_t k = 0; k < len; ++k, x = x->next())
|
2014-02-08 21:56:48 +04:00
|
|
|
{
|
2014-07-09 05:41:28 +04:00
|
|
|
StringPiece wrd = (*(btfix.V2))[x->id()];
|
|
|
|
Word w; w.CreateFromString(Output,ofactor,wrd,false);
|
2014-02-08 21:56:48 +04:00
|
|
|
tp->AddWord(w);
|
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
tp->GetScoreBreakdown().Assign(this, fvals);
|
2014-08-08 18:59:34 +04:00
|
|
|
tp->EvaluateInIsolation(src);
|
2014-02-08 21:56:48 +04:00
|
|
|
return tp;
|
|
|
|
}
|
|
|
|
|
2014-03-24 17:30:22 +04:00
|
|
|
Mmsapt::
|
|
|
|
TargetPhraseCollectionWrapper::
|
|
|
|
TargetPhraseCollectionWrapper(size_t r, uint64_t k)
|
|
|
|
: revision(r), key(k), refCount(0), idx(-1)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
Mmsapt::
|
|
|
|
TargetPhraseCollectionWrapper::
|
|
|
|
~TargetPhraseCollectionWrapper()
|
|
|
|
{
|
|
|
|
assert(this->refCount == 0);
|
|
|
|
}
|
2014-03-25 05:49:24 +04:00
|
|
|
|
2014-02-08 21:56:48 +04:00
|
|
|
// This is not the most efficient way of phrase lookup!
|
|
|
|
TargetPhraseCollection const*
|
|
|
|
Mmsapt::
|
|
|
|
GetTargetPhraseCollectionLEGACY(const Phrase& src) const
|
|
|
|
{
|
2014-03-24 17:30:22 +04:00
|
|
|
// map from Moses Phrase to internal id sequence
|
2014-03-25 05:49:24 +04:00
|
|
|
vector<id_type> sphrase;
|
2014-07-09 05:41:28 +04:00
|
|
|
fillIdSeq(src,input_factor,*(btfix.V1),sphrase);
|
2014-03-25 05:49:24 +04:00
|
|
|
if (sphrase.size() == 0) return NULL;
|
|
|
|
|
2014-03-24 17:30:22 +04:00
|
|
|
// Reserve a local copy of the dynamic bitext in its current form. /btdyn/
|
|
|
|
// is set to a new copy of the dynamic bitext every time a sentence pair
|
|
|
|
// is added. /dyn/ keeps the old bitext around as long as we need it.
|
|
|
|
sptr<imBitext<Token> > dyn;
|
|
|
|
{ // braces are needed for scoping mutex lock guard!
|
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
dyn = btdyn;
|
|
|
|
}
|
|
|
|
assert(dyn);
|
2014-07-09 05:41:28 +04:00
|
|
|
|
|
|
|
// lookup phrases in both bitexts
|
|
|
|
TSA<Token>::tree_iterator mfix(btfix.I1.get(), &sphrase[0], sphrase.size());
|
2014-03-24 17:30:22 +04:00
|
|
|
TSA<Token>::tree_iterator mdyn(dyn->I1.get());
|
2014-02-08 21:56:48 +04:00
|
|
|
if (dyn->I1.get())
|
2014-07-09 05:41:28 +04:00
|
|
|
for (size_t i = 0; mdyn.size() == i && i < sphrase.size(); ++i)
|
|
|
|
mdyn.extend(sphrase[i]);
|
2014-05-20 00:34:58 +04:00
|
|
|
|
|
|
|
#if 0
|
|
|
|
cerr << src << endl;
|
|
|
|
cerr << mfix.size() << ":" << mfix.getPid() << " "
|
|
|
|
<< mdyn.size() << " " << mdyn.getPid() << endl;
|
|
|
|
#endif
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
if (mdyn.size() != sphrase.size() && mfix.size() != sphrase.size())
|
|
|
|
return NULL; // phrase not found in either bitext
|
2013-09-25 03:51:50 +04:00
|
|
|
|
2014-03-24 17:30:22 +04:00
|
|
|
// cache lookup:
|
2014-07-09 05:41:28 +04:00
|
|
|
uint64_t phrasekey = (mfix.size() == sphrase.size() ? (mfix.getPid()<<1)
|
|
|
|
: (mdyn.getPid()<<1)+1);
|
2014-03-24 17:30:22 +04:00
|
|
|
size_t revision = dyn->revision();
|
|
|
|
{
|
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
tpc_cache_t::iterator c = m_cache.find(phrasekey);
|
2014-07-09 05:41:28 +04:00
|
|
|
// TO DO: we should revise the revision mechanism: we take the length
|
|
|
|
// of the dynamic bitext (in sentences) at the time the PT entry
|
|
|
|
// was stored as the time stamp. For each word in the
|
|
|
|
// vocabulary, we also store its most recent occurrence in the
|
|
|
|
// bitext. Only if the timestamp of each word in the phrase is
|
|
|
|
// newer than the timestamp of the phrase itself we must update
|
|
|
|
// the entry.
|
2014-03-24 17:30:22 +04:00
|
|
|
if (c != m_cache.end() && c->second->revision == revision)
|
|
|
|
return encache(c->second);
|
|
|
|
}
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// OK: pt entry not found or not up to date
|
|
|
|
// lookup and expansion could be done in parallel threds,
|
|
|
|
// but ppdyn is probably small anyway
|
|
|
|
// TO DO: have Bitexts return lists of PhrasePairs instead of pstats
|
|
|
|
// no need to expand pstats at every single lookup again, especially
|
|
|
|
// for btfix.
|
2014-03-24 17:30:22 +04:00
|
|
|
sptr<pstats> sfix,sdyn;
|
2014-07-09 05:41:28 +04:00
|
|
|
if (mfix.size() == sphrase.size()) sfix = btfix.lookup(mfix);
|
|
|
|
if (mdyn.size() == sphrase.size()) sdyn = dyn->lookup(mdyn);
|
|
|
|
|
|
|
|
vector<PhrasePair<Token> > ppfix,ppdyn;
|
2014-08-30 10:28:47 +04:00
|
|
|
PhrasePair<Token>::SortByTargetIdSeq sort_by_tgt_id;
|
|
|
|
if (sfix)
|
|
|
|
{
|
|
|
|
expand(mfix, btfix, *sfix, ppfix);
|
|
|
|
sort(ppfix.begin(), ppfix.end(),sort_by_tgt_id);
|
|
|
|
}
|
|
|
|
if (sdyn)
|
|
|
|
{
|
|
|
|
expand(mdyn, *dyn, *sdyn, ppdyn);
|
|
|
|
sort(ppdyn.begin(), ppdyn.end(),sort_by_tgt_id);
|
|
|
|
}
|
|
|
|
|
2014-07-09 05:41:28 +04:00
|
|
|
// now we have two lists of Phrase Pairs, let's merge them
|
|
|
|
TargetPhraseCollectionWrapper* ret;
|
|
|
|
ret = new TargetPhraseCollectionWrapper(revision,phrasekey);
|
|
|
|
PhrasePair<Token>::SortByTargetIdSeq sorter;
|
|
|
|
size_t i = 0; size_t k = 0;
|
|
|
|
while (i < ppfix.size() && k < ppdyn.size())
|
|
|
|
{
|
|
|
|
int cmp = sorter.cmp(ppfix[i], ppdyn[k]);
|
|
|
|
if (cmp < 0) ret->Add(mkTPhrase(src,&ppfix[i++],NULL,dyn));
|
|
|
|
else if (cmp == 0) ret->Add(mkTPhrase(src,&ppfix[i++],&ppdyn[k++],dyn));
|
|
|
|
else ret->Add(mkTPhrase(src,NULL,&ppdyn[k++],dyn));
|
|
|
|
}
|
|
|
|
while (i < ppfix.size()) ret->Add(mkTPhrase(src,&ppfix[i++],NULL,dyn));
|
|
|
|
while (k < ppdyn.size()) ret->Add(mkTPhrase(src,NULL,&ppdyn[k++],dyn));
|
|
|
|
if (m_tableLimit) ret->Prune(true, m_tableLimit);
|
|
|
|
else ret->Prune(true,ret->GetSize());
|
|
|
|
#if 0
|
|
|
|
if (combine_pstats(src,
|
|
|
|
mfix.getPid(), sfix.get(), btfix,
|
|
|
|
mdyn.getPid(), sdyn.get(), *dyn, ret))
|
2014-02-08 21:56:48 +04:00
|
|
|
{
|
2013-09-25 03:51:50 +04:00
|
|
|
#if 0
|
2014-03-24 17:30:22 +04:00
|
|
|
sort(ret->begin(), ret->end(), CompareTargetPhrase());
|
|
|
|
cout << "SOURCE PHRASE: " << src << endl;
|
|
|
|
size_t i = 0;
|
|
|
|
for (TargetPhraseCollection::iterator r = ret->begin(); r != ret->end(); ++r)
|
|
|
|
{
|
|
|
|
cout << ++i << " " << **r << endl;
|
|
|
|
FVector fv = (*r)->GetScoreBreakdown().CreateFVector();
|
|
|
|
typedef pair<Moses::FName,float> item_t;
|
|
|
|
BOOST_FOREACH(item_t f, fv)
|
|
|
|
cout << f.first << ":" << f.second << " ";
|
|
|
|
cout << endl;
|
|
|
|
}
|
2013-09-25 03:51:50 +04:00
|
|
|
#endif
|
2014-03-24 17:30:22 +04:00
|
|
|
}
|
2014-07-09 05:41:28 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
// put the result in the cache and return
|
2014-03-24 17:30:22 +04:00
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
m_cache[phrasekey] = ret;
|
|
|
|
return encache(ret);
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|
|
|
|
|
2014-06-05 04:47:29 +04:00
|
|
|
size_t
|
|
|
|
Mmsapt::
|
|
|
|
SetTableLimit(size_t limit)
|
|
|
|
{
|
|
|
|
std::swap(m_tableLimit,limit);
|
|
|
|
return limit;
|
|
|
|
}
|
|
|
|
|
2014-03-24 17:30:22 +04:00
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
CleanUpAfterSentenceProcessing(const InputType& source)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
ChartRuleLookupManager*
|
|
|
|
Mmsapt::
|
|
|
|
CreateRuleLookupManager(const ChartParser &, const ChartCellCollectionBase &)
|
|
|
|
{
|
2014-02-08 21:56:48 +04:00
|
|
|
throw "CreateRuleLookupManager is currently not supported in Mmsapt!";
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|
|
|
|
|
2014-03-20 00:43:47 +04:00
|
|
|
ChartRuleLookupManager*
|
|
|
|
Mmsapt::
|
|
|
|
CreateRuleLookupManager(const ChartParser &, const ChartCellCollectionBase &,
|
|
|
|
size_t UnclearWhatThisVariableIsSupposedToAccomplishBecauseNobodyBotheredToDocumentItInPhraseTableDotHButIllTakeThisAsAnOpportunityToComplyWithTheMosesConventionOfRidiculouslyLongVariableAndClassNames)
|
|
|
|
{
|
|
|
|
throw "CreateRuleLookupManager is currently not supported in Mmsapt!";
|
|
|
|
}
|
2014-03-24 17:30:22 +04:00
|
|
|
|
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
InitializeForInput(InputType const& source)
|
|
|
|
{
|
|
|
|
// assert(0);
|
|
|
|
}
|
|
|
|
|
2014-08-05 05:22:20 +04:00
|
|
|
#if defined(timespec)
|
2014-03-24 17:30:22 +04:00
|
|
|
bool operator<(timespec const& a, timespec const& b)
|
|
|
|
{
|
|
|
|
if (a.tv_sec != b.tv_sec) return a.tv_sec < b.tv_sec;
|
|
|
|
return (a.tv_nsec < b.tv_nsec);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator>=(timespec const& a, timespec const& b)
|
|
|
|
{
|
|
|
|
if (a.tv_sec != b.tv_sec) return a.tv_sec > b.tv_sec;
|
|
|
|
return (a.tv_nsec >= b.tv_nsec);
|
|
|
|
}
|
2014-08-05 05:22:20 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
bool operator<(timeval const& a, timeval const& b)
|
|
|
|
{
|
|
|
|
if (a.tv_sec != b.tv_sec) return a.tv_sec < b.tv_sec;
|
|
|
|
return (a.tv_usec < b.tv_usec);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator>=(timeval const& a, timeval const& b)
|
|
|
|
{
|
|
|
|
if (a.tv_sec != b.tv_sec) return a.tv_sec > b.tv_sec;
|
|
|
|
return (a.tv_usec >= b.tv_usec);
|
|
|
|
}
|
2014-03-24 17:30:22 +04:00
|
|
|
|
|
|
|
void
|
|
|
|
bubble_up(vector<Mmsapt::TargetPhraseCollectionWrapper*>& v, size_t k)
|
|
|
|
{
|
|
|
|
if (k >= v.size()) return;
|
|
|
|
for (;k && (v[k]->tstamp < v[k/2]->tstamp); k /=2)
|
|
|
|
{
|
|
|
|
std::swap(v[k],v[k/2]);
|
|
|
|
std::swap(v[k]->idx,v[k/2]->idx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
bubble_down(vector<Mmsapt::TargetPhraseCollectionWrapper*>& v, size_t k)
|
|
|
|
{
|
|
|
|
for (size_t j = 2*(k+1); j <= v.size(); j = 2*((k=j)+1))
|
|
|
|
{
|
|
|
|
if (j == v.size() || (v[j-1]->tstamp < v[j]->tstamp)) --j;
|
|
|
|
if (v[j]->tstamp >= v[k]->tstamp) break;
|
|
|
|
std::swap(v[k],v[j]);
|
|
|
|
v[k]->idx = k;
|
|
|
|
v[j]->idx = j;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
Mmsapt::
|
|
|
|
decache(TargetPhraseCollectionWrapper* ptr) const
|
|
|
|
{
|
|
|
|
if (ptr->refCount || ptr->idx >= 0) return;
|
|
|
|
// if (t.tv_nsec < v[0]->tstamp.tv_nsec)
|
|
|
|
#if 0
|
2014-08-05 05:22:20 +04:00
|
|
|
timespec t; clock_gettime(CLOCK_MONOTONIC,&t);
|
|
|
|
timespec r; clock_getres(CLOCK_MONOTONIC,&r);
|
2014-03-24 17:30:22 +04:00
|
|
|
float delta = t.tv_sec - ptr->tstamp.tv_sec;
|
|
|
|
cerr << "deleting old cache entry after "
|
|
|
|
<< delta << " seconds."
|
|
|
|
<< " clock resolution is " << r.tv_sec << ":" << r.tv_nsec
|
|
|
|
<< " at " << __FILE__ << ":" << __LINE__ << endl;
|
|
|
|
#endif
|
|
|
|
tpc_cache_t::iterator m = m_cache.find(ptr->key);
|
|
|
|
if (m != m_cache.end())
|
|
|
|
if (m->second == ptr)
|
|
|
|
m_cache.erase(m);
|
|
|
|
delete ptr;
|
|
|
|
--m_tpc_ctr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Mmsapt::
|
|
|
|
TargetPhraseCollectionWrapper*
|
|
|
|
Mmsapt::
|
|
|
|
encache(TargetPhraseCollectionWrapper* ptr) const
|
|
|
|
{
|
|
|
|
// Calling process must lock for thread safety!!
|
|
|
|
if (!ptr) return NULL;
|
|
|
|
++ptr->refCount;
|
|
|
|
++m_tpc_ctr;
|
2014-08-05 05:22:20 +04:00
|
|
|
#if defined(timespec)
|
2014-03-24 17:30:22 +04:00
|
|
|
clock_gettime(CLOCK_MONOTONIC, &ptr->tstamp);
|
2014-08-05 05:22:20 +04:00
|
|
|
#else
|
|
|
|
gettimeofday(&ptr->tstamp, NULL);
|
|
|
|
#endif
|
2014-03-24 17:30:22 +04:00
|
|
|
// update history
|
2014-03-25 05:49:24 +04:00
|
|
|
if (m_history.capacity() > 1)
|
|
|
|
{
|
|
|
|
vector<TargetPhraseCollectionWrapper*>& v = m_history;
|
|
|
|
if (ptr->idx >= 0) // ptr is already in history
|
|
|
|
{
|
|
|
|
assert(ptr == v[ptr->idx]);
|
|
|
|
size_t k = 2 * (ptr->idx + 1);
|
|
|
|
if (k < v.size()) bubble_up(v,k--);
|
|
|
|
if (k < v.size()) bubble_up(v,k);
|
|
|
|
}
|
|
|
|
else if (v.size() < v.capacity())
|
|
|
|
{
|
|
|
|
size_t k = ptr->idx = v.size();
|
|
|
|
v.push_back(ptr);
|
|
|
|
bubble_up(v,k);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
v[0]->idx = -1;
|
|
|
|
decache(v[0]);
|
|
|
|
v[0] = ptr;
|
|
|
|
bubble_down(v,0);
|
|
|
|
}
|
2014-03-24 17:30:22 +04:00
|
|
|
}
|
2014-03-25 05:49:24 +04:00
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
Mmsapt::
|
|
|
|
PrefixExists(Moses::Phrase const& phrase) const
|
2014-09-06 06:39:23 +04:00
|
|
|
{
|
|
|
|
return PrefixExists(phrase,NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
Mmsapt::
|
|
|
|
PrefixExists(Moses::Phrase const& phrase, vector<float> const* const bias) const
|
2014-03-25 05:49:24 +04:00
|
|
|
{
|
|
|
|
if (phrase.GetSize() == 0) return false;
|
|
|
|
vector<id_type> myphrase;
|
|
|
|
fillIdSeq(phrase,input_factor,*btfix.V1,myphrase);
|
|
|
|
|
|
|
|
TSA<Token>::tree_iterator mfix(btfix.I1.get(),&myphrase[0],myphrase.size());
|
|
|
|
if (mfix.size() == myphrase.size())
|
2014-03-24 17:30:22 +04:00
|
|
|
{
|
2014-09-06 06:39:23 +04:00
|
|
|
btfix.prep(mfix,bias);
|
2014-03-25 05:49:24 +04:00
|
|
|
// cerr << phrase << " " << mfix.approxOccurrenceCount() << endl;
|
|
|
|
return true;
|
2014-03-24 17:30:22 +04:00
|
|
|
}
|
2014-03-25 05:49:24 +04:00
|
|
|
|
|
|
|
sptr<imBitext<Token> > dyn;
|
|
|
|
{ // braces are needed for scoping mutex lock guard!
|
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
dyn = btdyn;
|
|
|
|
}
|
|
|
|
assert(dyn);
|
|
|
|
TSA<Token>::tree_iterator mdyn(dyn->I1.get());
|
|
|
|
if (dyn->I1.get())
|
2014-03-24 17:30:22 +04:00
|
|
|
{
|
2014-03-25 05:49:24 +04:00
|
|
|
for (size_t i = 0; mdyn.size() == i && i < myphrase.size(); ++i)
|
|
|
|
mdyn.extend(myphrase[i]);
|
2014-09-06 06:39:23 +04:00
|
|
|
// let's assume a uniform bias over the foreground corpus
|
|
|
|
if (mdyn.size() == myphrase.size()) dyn->prep(mdyn,NULL);
|
2014-03-24 17:30:22 +04:00
|
|
|
}
|
2014-03-25 05:49:24 +04:00
|
|
|
return mdyn.size() == myphrase.size();
|
2014-03-24 17:30:22 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
Mmsapt::
|
2014-03-25 05:49:24 +04:00
|
|
|
Release(TargetPhraseCollection const* tpc) const
|
2014-03-24 17:30:22 +04:00
|
|
|
{
|
|
|
|
if (!tpc) return;
|
|
|
|
boost::lock_guard<boost::mutex> guard(this->lock);
|
|
|
|
TargetPhraseCollectionWrapper* ptr
|
|
|
|
= (reinterpret_cast<TargetPhraseCollectionWrapper*>
|
|
|
|
(const_cast<TargetPhraseCollection*>(tpc)));
|
|
|
|
if (--ptr->refCount == 0 && ptr->idx < 0)
|
|
|
|
decache(ptr);
|
|
|
|
#if 0
|
|
|
|
cerr << ptr->refCount << " references at "
|
|
|
|
<< __FILE__ << ":" << __LINE__
|
|
|
|
<< "; " << m_tpc_ctr << " TPC references still in circulation; "
|
|
|
|
<< m_history.size() << " instances in history."
|
|
|
|
<< endl;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2014-03-25 05:49:24 +04:00
|
|
|
bool
|
|
|
|
Mmsapt::
|
|
|
|
ProvidesPrefixCheck() const
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
2014-03-24 17:30:22 +04:00
|
|
|
|
2013-09-25 03:51:50 +04:00
|
|
|
}
|