File size: 6,277 Bytes
158b61b |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 |
#include <iostream>
//#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <iterator>
#include <functional>
#include <sys/stat.h>
#include "moses/TypeDef.h"
#include "moses/ConfusionNet.h"
#include "moses/FactorCollection.h"
#include "moses/Phrase.h"
#include "moses/InputFileStream.h"
#include "moses/Timer.h"
#include "moses/TranslationModel/PhraseDictionaryTree.h"
using namespace std;
using namespace Moses;
Timer timer;
template<typename T>
std::ostream& operator<<(std::ostream& out,const std::vector<T>& x)
{
out<<x.size()<<" ";
typename std::vector<T>::const_iterator iend=x.end();
for(typename std::vector<T>::const_iterator i=x.begin(); i!=iend; ++i)
out<<*i<<' ';
return out;
}
inline bool existsFile(const char* filename)
{
struct stat mystat;
return (stat(filename,&mystat)==0);
}
inline bool existsFile(const std::string& filename)
{
return existsFile(filename.c_str());
}
int main(int argc,char **argv)
{
std::string fto;
size_t noScoreComponent=5;
int cn=0;
bool aligninfo=true;
std::vector<std::pair<std::string,std::pair<char*,char*> > > ftts;
int verb=0;
for(int i=1; i<argc; ++i) {
std::string s(argv[i]);
if(s=="-ttable") {
std::pair<char*,char*> p;
p.first=argv[++i];
p.second=argv[++i];
ftts.push_back(std::make_pair(std::string(argv[++i]),p));
} else if(s=="-nscores") noScoreComponent=atoi(argv[++i]);
else if(s=="-out") fto=std::string(argv[++i]);
else if(s=="-cn") cn=1;
else if(s=="-irst") cn=2;
else if(s=="-no-alignment-info") aligninfo=false;
else if(s=="-v") verb=atoi(argv[++i]);
else if(s=="-h") {
std::cerr<<"usage "<<argv[0]<<" :\n\n"
"options:\n"
"\t-ttable int int string -- translation table file, use '-' for stdin\n"
"\t-out string -- output file name prefix for binary ttable\n"
"\t-nscores int -- number of scores in ttable\n"
"\t-no-alignment-info -- omit alignment info from the binary ttable \n"
"\nfunctions:\n"
"\t - convert ascii ttable in binary format\n"
"\t - if ttable is not read from stdin:\n"
"\t treat each line as source phrase an print tgt candidates\n"
"\n";
return 1;
} else {
std::cerr<<"ERROR: unknown option '"<<s<<"'\n";
return 1;
}
}
if(ftts.size()) {
if(ftts.size()==1) {
std::cerr<<"processing ptree for ";
PhraseDictionaryTree pdt;
pdt.PrintWordAlignment(aligninfo);
if (ftts[0].first=="-") {
std::cerr<< "stdin\n";
pdt.Create(std::cin,fto);
} else {
std::cerr<< ftts[0].first << "\n";
InputFileStream in(ftts[0].first);
pdt.Create(in,fto);
}
} else {
#if 0
std::vector<PhraseDictionaryTree const*> pdicts;
std::vector<FactorType> factorOrder;
for(size_t i=0; i<ftts.size(); ++i) {
PhraseDictionaryTree *pdtptr=new PhraseDictionaryTree(noScoreComponent,
&factorCollection,
getFactorType(atoi(ftts[i].second.first)),
getFactorType(atoi(ftts[i].second.second))
);
factorOrder.push_back(pdtptr->GetInputFactorType());
PhraseDictionaryTree &pdt=*pdtptr;
pdicts.push_back(pdtptr);
std::string facStr="."+std::string(ftts[i].second.first)+"-"+std::string(ftts[i].second.second);
std::string prefix=ftts[i].first+facStr;
if(!existsFile(prefix+".binphr.idx")) {
std::cerr<<"bin ttable does not exist -> create it\n";
InputFileStream in(prefix);
pdt.Create(in,prefix);
}
std::cerr<<"reading bin ttable\n";
pdt.Read(prefix);
}
std::cerr<<"processing stdin\n";
if(!cn) {
std::string line;
while(getline(std::cin,line)) {
std::istringstream is(line);
#if 0
std::vector<std::string> f;
std::copy(std::istream_iterator<std::string>(is),
std::istream_iterator<std::string>(),
std::back_inserter(f));
#endif
std::cerr<<"got source phrase '"<<line<<"'\n";
Phrase F(Input);
F.CreateFromString(factorOrder,line,factorCollection);
for(size_t k=0; k<pdicts.size(); ++k) {
PhraseDictionaryTree const& pdt=*pdicts[k];
std::vector<std::string> f(F.GetSize());
for(size_t i=0; i<F.GetSize(); ++i)
f[i]=F.GetFactor(i,pdt.GetInputFactorType())->ToString();
std::stringstream iostA,iostB;
std::cerr<<"full phrase processing "<<f<<"\n";
pdt.PrintTargetCandidates(f,iostA);
std::cerr<<"processing with prefix ptr\n";
PhraseDictionaryTree::PrefixPtr p(pdt.GetRoot());
for(size_t i=0; i<f.size() && p; ++i) {
std::cerr<<"pre "<<i<<" "<<(p?"1":"0")<<"\n";
p=pdt.Extend(p,f[i]);
std::cerr<<"post "<<i<<" "<<(p?"1":"0")<<"\n";
}
if(p) {
std::cerr<<"retrieving candidates from prefix ptr\n";
pdt.PrintTargetCandidates(p,iostB);
} else {
std::cerr<<"final ptr is invalid\n";
iostB<<"there are 0 target candidates\n";
}
if(iostA.str() != iostB.str())
std::cerr<<"ERROR: translation candidates mismatch '"<<iostA.str()<<"' and for prefix pointer: '"<<iostB.str()<<"'\n";
std::cerr<<"translation candidates:\n"<<iostA.str()<<"\n";
pdt.FreeMemory();
}
}
} else {
// process confusion net input
ConfusionNet net(&factorCollection);
std::vector<std::vector<float> > weights;
for(size_t i=0; i<pdicts.size(); ++i)
weights.push_back(std::vector<float>(noScoreComponent,1/(1.0*noScoreComponent)));
while(net.ReadF(std::cin,factorOrder,cn-1)) {
net.Print(std::cerr);
GenerateCandidates(net,pdicts,weights,verb);
}
}
#else
std::cerr<<"ERROR: these functions are currently broken...\n";
exit(1);
#endif
}
}
}
|