mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-28 14:32:38 +03:00
da6e4935fd
git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@3954 1f5c12ca-751b-0410-a591-d2e778427230
56 lines
1.3 KiB
C++
56 lines
1.3 KiB
C++
#include <iostream>
|
|
#include <string>
|
|
|
|
#include "Timer.h"
|
|
#include "InputFileStream.h"
|
|
#include "LexicalReorderingTable.h"
|
|
|
|
using namespace Moses;
|
|
|
|
Timer timer;
|
|
|
|
void printHelp()
|
|
{
|
|
std::cerr << "Usage:\n"
|
|
"options: \n"
|
|
"\t-in string -- input table file name\n"
|
|
"\t-out string -- prefix of binary table files\n"
|
|
"If -in is not specified reads from stdin\n"
|
|
"\n";
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
std::cerr << "processLexicalTable v0.1 by Konrad Rawlik\n";
|
|
std::string inFilePath;
|
|
std::string outFilePath("out");
|
|
if(1 >= argc) {
|
|
printHelp();
|
|
return 1;
|
|
}
|
|
for(int i = 1; i < argc; ++i) {
|
|
std::string arg(argv[i]);
|
|
if("-in" == arg && i+1 < argc) {
|
|
++i;
|
|
inFilePath = argv[i];
|
|
} else if("-out" == arg && i+1 < argc) {
|
|
++i;
|
|
outFilePath = argv[i];
|
|
} else {
|
|
//somethings wrong... print help
|
|
printHelp();
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
if(inFilePath.empty()) {
|
|
std::cerr << "processing stdin to " << outFilePath << ".*\n";
|
|
return LexicalReorderingTableTree::Create(std::cin, outFilePath);
|
|
} else {
|
|
std::cerr << "processing " << inFilePath<< " to " << outFilePath << ".*\n";
|
|
InputFileStream file(inFilePath);
|
|
bool success = LexicalReorderingTableTree::Create(file, outFilePath);
|
|
return (success ? 0 : 1);
|
|
}
|
|
}
|