File size: 4,231 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 |
#include <iostream>
#include <string>
#include "moses/Phrase.h"
#include "moses/FactorCollection.h"
#include "moses/Timer.h"
#include "moses/InputFileStream.h"
#include "moses/TranslationModel/CompactPT/BlockHashIndex.h"
#include "moses/TranslationModel/CompactPT/CanonicalHuffman.h"
#include "moses/TranslationModel/CompactPT/StringVector.h"
using namespace Moses;
using namespace std;
Timer timer;
FactorList m_factorsF, m_factorsE, m_factorsC;
BlockHashIndex m_hash(10, 16);
size_t m_numScoreComponent;
bool m_multipleScoreTrees;
bool m_inMemory = false;
typedef CanonicalHuffman<float> ScoreTree;
std::vector<ScoreTree*> m_scoreTrees;
StringVector<unsigned char, unsigned long, MmapAllocator> m_scoresMapped;
StringVector<unsigned char, unsigned long, std::allocator> m_scoresMemory;
////////////////////////////////////////////////////////////////////////////////////
void Load(const string &filePath)
{
std::FILE* pFile = std::fopen(filePath.c_str(), "r");
UTIL_THROW_IF2(pFile == NULL, "File " << filePath << " could not be opened");
//if(m_inMemory)
m_hash.Load(pFile);
//else
//m_hash.LoadIndex(pFile);
size_t read = 0;
read += std::fread(&m_numScoreComponent, sizeof(m_numScoreComponent), 1, pFile);
read += std::fread(&m_multipleScoreTrees,
sizeof(m_multipleScoreTrees), 1, pFile);
if(m_multipleScoreTrees) {
m_scoreTrees.resize(m_numScoreComponent);
for(size_t i = 0; i < m_numScoreComponent; i++)
m_scoreTrees[i] = new CanonicalHuffman<float>(pFile);
} else {
m_scoreTrees.resize(1);
m_scoreTrees[0] = new CanonicalHuffman<float>(pFile);
}
if(m_inMemory)
m_scoresMemory.load(pFile, false);
else
m_scoresMapped.load(pFile, true);
}
////////////////////////////////////////////////////////////////////////////////////
std::string
MakeKey(const std::string& f,
const std::string& e,
const std::string& c)
{
std::string key;
if(!f.empty()) key += f;
if(!m_factorsE.empty()) {
if(!key.empty()) key += " ||| ";
key += e;
}
if(!m_factorsC.empty()) {
if(!key.empty()) key += " ||| ";
key += c;
}
key += " ||| ";
return key;
}
////////////////////////////////////////////////////////////////////////////////////
std::vector<float>
GetScore(const std::string& f, const std::string& e, const std::string& c)
{
std::string key;
std::vector<float> probs;
key = MakeKey(f, e, c);
size_t index = m_hash[key];
if(m_hash.GetSize() != index) {
std::string scoresString;
if(m_inMemory)
scoresString = m_scoresMemory[index].str();
else
scoresString = m_scoresMapped[index].str();
BitWrapper<> bitStream(scoresString);
for(size_t i = 0; i < m_numScoreComponent; i++) {
float prob = m_scoreTrees[m_multipleScoreTrees ? i : 0]->Read(bitStream);
prob = exp(prob);
probs.push_back(prob);
}
return probs;
} else {
// return empty vector;
}
return probs;
}
////////////////////////////////////////////////////////////////////////////////////
int main(int argc, char** argv)
{
string ptPath(argv[1]);
string roPath(argv[2]);
// lex reordering model
m_factorsF.push_back(0);
m_factorsE.push_back(0);
Load(roPath);
// phrase table
InputFileStream ptStrm(ptPath);
string line;
while (getline(ptStrm, line)) {
//cerr << line << endl;
std::vector<std::string> columns(7);
std::vector<std::string> toks = TokenizeMultiCharSeparator(line, "|||");
assert(toks.size() >= 2);
for (size_t i = 0; i < toks.size(); ++i) {
columns[i] = Trim(toks[i]);
}
std::vector<float> scores = GetScore(columns[0], columns[1], "");
// key-value pairs
if (scores.size()) {
if (!columns[6].empty()) {
columns[6] += " ";
}
columns[6] += "{{LexRO ";
for (size_t i = 0; i < scores.size() - 1; ++i) {
columns[6] += Moses::SPrint(scores[i]);
columns[6] += " ";
}
columns[6] += Moses::SPrint(scores[scores.size() - 1]);
columns[6] += "}}";
}
// output
for (size_t i = 0; i < columns.size() - 1; ++i) {
cout << columns[i] << " ||| ";
}
cout << columns[columns.size() - 1] << endl;
}
}
|