mosesdecoder/moses/src/RuleTable/PhraseDictionaryTMExtract.cpp

326 lines
11 KiB
C++
Raw Normal View History

// vim:tabstop=2
/***********************************************************************
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 <fstream>
#include <string>
#include <iterator>
#include <algorithm>
#include "RuleTable/Loader.h"
#include "RuleTable/LoaderFactory.h"
#include "PhraseDictionaryTMExtract.h"
#include "FactorCollection.h"
#include "Word.h"
#include "Util.h"
#include "InputFileStream.h"
#include "StaticData.h"
#include "WordsRange.h"
#include "UserMessage.h"
#include "CYKPlusParser/ChartRuleLookupManagerMemoryPerSentence.h"
using namespace std;
namespace Moses
{
PhraseDictionaryTMExtract::PhraseDictionaryTMExtract(size_t numScoreComponents,
PhraseDictionaryFeature* feature)
: PhraseDictionary(numScoreComponents, feature)
{
const StaticData &staticData = StaticData::Instance();
CHECK(staticData.ThreadCount() == 1);
}
bool PhraseDictionaryTMExtract::Load(const std::vector<FactorType> &input
, const std::vector<FactorType> &output
, const std::string &filePath
, const std::vector<float> &weight
, size_t tableLimit,
const LMList& languageModels,
const WordPenaltyProducer* wpProducer)
{
m_languageModels = &(languageModels);
m_wpProducer = wpProducer;
m_tableLimit = tableLimit;
m_input = &input;
m_output = &output;
m_weight = &weight;
return true;
}
void PhraseDictionaryTMExtract::Initialize(const string &initStr)
{
cerr << "initStr=" << initStr << endl;
m_config = Tokenize(initStr, ";");
assert(m_config.size() == 4);
}
ChartRuleLookupManager *PhraseDictionaryTMExtract::CreateRuleLookupManager(
const InputType &sentence,
const ChartCellCollection &cellCollection)
{
return new ChartRuleLookupManagerMemoryPerSentence(sentence, cellCollection, *this);
}
void PhraseDictionaryTMExtract::InitializeForInput(InputType const& inputSentence)
{
/*
string data_root = "/tmp";
string in_file = data_root + "/in";
string pt_file = data_root + "/pt.out";
ofstream inFile(in_file.c_str());
for (size_t i = 1; i < source.GetSize() - 1; ++i)
{
inFile << source.GetWord(i);
}
inFile << endl;
inFile.close();
string cmd = "perl ~/workspace/github/hieuhoang/contrib/tm-mt-integration/make-pt-from-tm.perl "
+ in_file + " "
+ m_config[0] + " "
+ m_config[1] + " "
+ m_config[2] + " "
+ m_config[3] + " "
+ pt_file;
cerr << cmd << endl;
system(cmd.c_str());
cerr << "done\n";
*/
// populate with rules for this sentence
long translationId = inputSentence.GetTranslationId();
PhraseDictionaryNodeSCFG &rootNode = m_collection[translationId];
FormatType format = MosesFormat;
string grammarFile = "/tmp/pt.out.gz";
// data from file
InputFileStream inStream(grammarFile);
// copied from class LoaderStandard
PrintUserTime("Start loading new format pt model");
const StaticData &staticData = StaticData::Instance();
const std::string& factorDelimiter = staticData.GetFactorDelimiter();
string lineOrig;
size_t count = 0;
while(getline(inStream, lineOrig)) {
const string *line;
if (format == HieroFormat) { // reformat line
assert(false);
//line = ReformatHieroRule(lineOrig);
}
else
{ // do nothing to format of line
line = &lineOrig;
}
vector<string> tokens;
vector<float> scoreVector;
TokenizeMultiCharSeparator(tokens, *line , "|||" );
if (tokens.size() != 4 && tokens.size() != 5) {
stringstream strme;
strme << "Syntax error at " << grammarFile << ":" << count;
UserMessage::Add(strme.str());
abort();
}
const string &sourcePhraseString = tokens[0]
, &targetPhraseString = tokens[1]
, &scoreString = tokens[2]
, &alignString = tokens[3];
bool isLHSEmpty = (sourcePhraseString.find_first_not_of(" \t", 0) == string::npos);
if (isLHSEmpty && !staticData.IsWordDeletionEnabled()) {
TRACE_ERR( grammarFile << ":" << count << ": pt entry contains empty target, skipping\n");
continue;
}
Tokenize<float>(scoreVector, scoreString);
const size_t numScoreComponents = GetFeature()->GetNumScoreComponents();
if (scoreVector.size() != numScoreComponents) {
stringstream strme;
strme << "Size of scoreVector != number (" << scoreVector.size() << "!="
<< numScoreComponents << ") of score components on line " << count;
UserMessage::Add(strme.str());
abort();
}
CHECK(scoreVector.size() == numScoreComponents);
// parse source & find pt node
// constituent labels
Word sourceLHS, targetLHS;
// source
Phrase sourcePhrase( 0);
sourcePhrase.CreateFromStringNewFormat(Input, *m_input, sourcePhraseString, factorDelimiter, sourceLHS);
// create target phrase obj
TargetPhrase *targetPhrase = new TargetPhrase(Output);
targetPhrase->CreateFromStringNewFormat(Output, *m_output, targetPhraseString, factorDelimiter, targetLHS);
// rest of target phrase
targetPhrase->SetAlignmentInfo(alignString);
targetPhrase->SetTargetLHS(targetLHS);
//targetPhrase->SetDebugOutput(string("New Format pt ") + line);
// component score, for n-best output
std::transform(scoreVector.begin(),scoreVector.end(),scoreVector.begin(),TransformScore);
std::transform(scoreVector.begin(),scoreVector.end(),scoreVector.begin(),FloorScore);
targetPhrase->SetScoreChart(GetFeature(), scoreVector, *m_weight, *m_languageModels, m_wpProducer);
TargetPhraseCollection &phraseColl = GetOrCreateTargetPhraseCollection(rootNode, sourcePhrase, *targetPhrase, sourceLHS);
phraseColl.Add(targetPhrase);
count++;
if (format == HieroFormat) { // reformat line
delete line;
}
else
{ // do nothing
}
}
// sort and prune each target phrase collection
SortAndPrune(rootNode);
}
TargetPhraseCollection &PhraseDictionaryTMExtract::GetOrCreateTargetPhraseCollection(PhraseDictionaryNodeSCFG &rootNode
, const Phrase &source
, const TargetPhrase &target
, const Word &sourceLHS)
{
PhraseDictionaryNodeSCFG &currNode = GetOrCreateNode(rootNode, source, target, sourceLHS);
return currNode.GetOrCreateTargetPhraseCollection();
}
PhraseDictionaryNodeSCFG &PhraseDictionaryTMExtract::GetOrCreateNode(PhraseDictionaryNodeSCFG &rootNode
, const Phrase &source
, const TargetPhrase &target
, const Word &sourceLHS)
{
cerr << source << endl << target << endl;
const size_t size = source.GetSize();
const AlignmentInfo &alignmentInfo = target.GetAlignmentInfo();
AlignmentInfo::const_iterator iterAlign = alignmentInfo.begin();
PhraseDictionaryNodeSCFG *currNode = &rootNode;
for (size_t pos = 0 ; pos < size ; ++pos) {
const Word& word = source.GetWord(pos);
if (word.IsNonTerminal()) {
// indexed by source label 1st
const Word &sourceNonTerm = word;
CHECK(iterAlign != target.GetAlignmentInfo().end());
CHECK(iterAlign->first == pos);
size_t targetNonTermInd = iterAlign->second;
++iterAlign;
const Word &targetNonTerm = target.GetWord(targetNonTermInd);
currNode = currNode->GetOrCreateChild(sourceNonTerm, targetNonTerm);
} else {
currNode = currNode->GetOrCreateChild(word);
}
CHECK(currNode != NULL);
}
// finally, the source LHS
//currNode = currNode->GetOrCreateChild(sourceLHS);
//CHECK(currNode != NULL);
return *currNode;
}
void PhraseDictionaryTMExtract::SortAndPrune(PhraseDictionaryNodeSCFG &rootNode)
{
if (GetTableLimit())
{
rootNode.Sort(GetTableLimit());
}
}
void PhraseDictionaryTMExtract::CleanUp(const InputType &source)
{
m_collection.erase(source.GetTranslationId());
}
const PhraseDictionaryNodeSCFG &PhraseDictionaryTMExtract::GetRootNode(const InputType &source) const
{
long transId = source.GetTranslationId();
std::map<long, PhraseDictionaryNodeSCFG>::const_iterator iter = m_collection.find(transId);
CHECK(iter != m_collection.end());
return iter->second;
}
PhraseDictionaryNodeSCFG &PhraseDictionaryTMExtract::GetRootNode(const InputType &source)
{
long transId = source.GetTranslationId();
std::map<long, PhraseDictionaryNodeSCFG>::iterator iter = m_collection.find(transId);
CHECK(iter != m_collection.end());
return iter->second;
}
TO_STRING_BODY(PhraseDictionaryTMExtract);
// friend
ostream& operator<<(ostream& out, const PhraseDictionaryTMExtract& phraseDict)
{
typedef PhraseDictionaryNodeSCFG::TerminalMap TermMap;
typedef PhraseDictionaryNodeSCFG::NonTerminalMap NonTermMap;
/*
const PhraseDictionaryNodeSCFG &coll = phraseDict.m_collection;
for (NonTermMap::const_iterator p = coll.m_nonTermMap.begin(); p != coll.m_nonTermMap.end(); ++p) {
const Word &sourceNonTerm = p->first.first;
out << sourceNonTerm;
}
for (TermMap::const_iterator p = coll.m_sourceTermMap.begin(); p != coll.m_sourceTermMap.end(); ++p) {
const Word &sourceTerm = p->first;
out << sourceTerm;
}
*/
return out;
}
}