Welcome to mirror list, hosted at ThFree Co, Russian Federation.

queryPhraseTable.cpp « misc - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 109c7e69e5b50b2c5122223389750dc6b7db8767 (plain)
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
// Query binary phrase tables.
// Christian Hardmeier, 16 May 2010

#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>

#include "PhraseDictionaryTree.h"
#include "Util.h"

void usage();

typedef unsigned int uint;

int main(int argc, char **argv)
{
  int nscores = 5;
  std::string ttable = "";
  bool useAlignments = 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"))
      useAlignments = true;
    else
      usage();
  }

  if(ttable == "")
    usage();

  Moses::PhraseDictionaryTree ptree(nscores);
  ptree.UseWordAlignment(useAlignments);
  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(useAlignments)
      ptree.GetTargetCandidates(srcphrase, tgtcands, wordAlignment);
    else
      ptree.GetTargetCandidates(srcphrase, tgtcands);

    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(useAlignments) {
        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"
            "-a                binary phrase table contains alignments\n"
            "-t <ttable>       phrase table\n";
  exit(1);
}