mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-11 11:25:40 +03:00
93 lines
2.3 KiB
C++
93 lines
2.3 KiB
C++
// Query binary phrase tables.
|
|
// Christian Hardmeier, 16 May 2010
|
|
|
|
#include <cstdlib>
|
|
#include <cstring>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "moses/TranslationModel/PhraseDictionaryTree.h"
|
|
#include "moses/Util.h"
|
|
|
|
void usage();
|
|
|
|
typedef unsigned int uint;
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int nscores = 5;
|
|
std::string ttable = "";
|
|
bool needAlignments = false;
|
|
bool reportCounts = false;
|
|
|
|
for(int i = 1; i < argc; i++) {
|
|
if(!strcmp(argv[i], "-n")) {
|
|
if(i + 1 == argc)
|
|
usage();
|
|
nscores = atoi(argv[++i]);
|
|
} else if(!strcmp(argv[i], "-t")) {
|
|
if(i + 1 == argc)
|
|
usage();
|
|
ttable = argv[++i];
|
|
} else if(!strcmp(argv[i], "-a")) {
|
|
needAlignments = true;
|
|
} else if (!strcmp(argv[i], "-c")) {
|
|
reportCounts = true;
|
|
} else
|
|
usage();
|
|
}
|
|
|
|
if(ttable == "")
|
|
usage();
|
|
|
|
Moses::PhraseDictionaryTree ptree;
|
|
ptree.NeedAlignmentInfo(needAlignments);
|
|
ptree.Read(ttable);
|
|
|
|
std::string line;
|
|
while(getline(std::cin, line)) {
|
|
std::vector<std::string> srcphrase;
|
|
srcphrase = Moses::Tokenize<std::string>(line);
|
|
|
|
std::vector<Moses::StringTgtCand> tgtcands;
|
|
std::vector<std::string> wordAlignment;
|
|
|
|
if(needAlignments)
|
|
ptree.GetTargetCandidates(srcphrase, tgtcands, wordAlignment);
|
|
else
|
|
ptree.GetTargetCandidates(srcphrase, tgtcands);
|
|
|
|
if (reportCounts) {
|
|
std::cout << line << " " << tgtcands.size() << "\n";
|
|
} else {
|
|
for(uint i = 0; i < tgtcands.size(); i++) {
|
|
std::cout << line << " |||";
|
|
for(uint j = 0; j < tgtcands[i].tokens.size(); j++)
|
|
std::cout << ' ' << *tgtcands[i].tokens[j];
|
|
std::cout << " |||";
|
|
|
|
if(needAlignments) {
|
|
std::cout << " " << wordAlignment[i] << " |||";
|
|
}
|
|
|
|
for(uint j = 0; j < tgtcands[i].scores.size(); j++)
|
|
std::cout << ' ' << tgtcands[i].scores[j];
|
|
std::cout << '\n';
|
|
}
|
|
std::cout << '\n';
|
|
}
|
|
|
|
std::cout.flush();
|
|
}
|
|
}
|
|
|
|
void usage()
|
|
{
|
|
std::cerr << "Usage: queryPhraseTable [-n <nscores>] [-a] -t <ttable>\n"
|
|
"-n <nscores> number of scores in phrase table (default: 5)\n"
|
|
"-c only report counts of entries\n"
|
|
"-a binary phrase table contains alignments\n"
|
|
"-t <ttable> phrase table\n";
|
|
exit(1);
|
|
}
|