File size: 5,743 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 |
// -*- c++ -*-
// vim:tabstop=2
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#include "LexicalReorderingTableCompact.h"
#include "../../SubPhrase.h"
#include "../../legacy/Util2.h"
namespace Moses2
{
//////////////////////////////////////////////////////////////////////////////////////////////
bool LexicalReorderingTableCompact::s_inMemoryByDefault = false;
LexicalReorderingTableCompact::LexicalReorderingTableCompact(
const std::string& filePath, const std::vector<FactorType>& f_factors,
const std::vector<FactorType>& e_factors,
const std::vector<FactorType>& c_factors) :
LexicalReorderingTable(f_factors, e_factors, c_factors), m_inMemory(
s_inMemoryByDefault), m_numScoreComponent(6), m_multipleScoreTrees(
true), m_hash(10, 16), m_scoreTrees(1)
{
Load(filePath);
}
LexicalReorderingTableCompact::LexicalReorderingTableCompact(
const std::vector<FactorType>& f_factors,
const std::vector<FactorType>& e_factors,
const std::vector<FactorType>& c_factors) :
LexicalReorderingTable(f_factors, e_factors, c_factors), m_inMemory(
s_inMemoryByDefault), m_numScoreComponent(6), m_multipleScoreTrees(
true), m_hash(10, 16), m_scoreTrees(1)
{
}
LexicalReorderingTableCompact::~LexicalReorderingTableCompact()
{
for (size_t i = 0; i < m_scoreTrees.size(); i++)
delete m_scoreTrees[i];
}
std::vector<float> LexicalReorderingTableCompact::GetScore(const Phrase<Moses2::Word>& f,
const Phrase<Moses2::Word>& e, const Phrase<Moses2::Word>& c)
{
std::string key;
std::vector<float> scores;
if (0 == c.GetSize()) key = MakeKey(f, e, c);
else {
for (size_t i = 0; i <= c.GetSize(); ++i) {
SubPhrase<Moses2::Word> sub_c = c.GetSubPhrase(i, c.GetSize() - i);
key = MakeKey(f, e, sub_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++)
scores.push_back(
m_scoreTrees[m_multipleScoreTrees ? i : 0]->Read(bitStream));
return scores;
}
return std::vector<float>();
}
std::string LexicalReorderingTableCompact::MakeKey(const Phrase<Moses2::Word>& f,
const Phrase<Moses2::Word>& e, const Phrase<Moses2::Word>& c) const
{
return MakeKey(Trim(f.GetString(m_FactorsF)), Trim(e.GetString(m_FactorsE)),
Trim(c.GetString(m_FactorsC)));
}
std::string LexicalReorderingTableCompact::MakeKey(const std::string& f,
const std::string& e, const std::string& c) const
{
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;
}
LexicalReorderingTable*
LexicalReorderingTableCompact::CheckAndLoad(const std::string& filePath,
const std::vector<FactorType>& f_factors,
const std::vector<FactorType>& e_factors,
const std::vector<FactorType>& c_factors)
{
#ifdef HAVE_CMPH
std::string minlexr = ".minlexr";
// file name is specified without suffix
if (FileExists(filePath + minlexr)) {
//there exists a compact binary version use that
std::cerr << "Using compact lexical reordering table" << std::endl;
return new LexicalReorderingTableCompact(filePath + minlexr, f_factors,
e_factors, c_factors);
}
// file name is specified with suffix
if (filePath.substr(filePath.length() - minlexr.length(), minlexr.length())
== minlexr && FileExists(filePath)) {
//there exists a compact binary version use that
std::cerr << "Using compact lexical reordering table" << std::endl;
return new LexicalReorderingTableCompact(filePath, f_factors, e_factors,
c_factors);
}
#endif
return 0;
}
void LexicalReorderingTableCompact::Load(std::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);
}
}
|