mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-26 13:23:25 +03:00
150 lines
4.8 KiB
C++
150 lines
4.8 KiB
C++
// 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 "Loader.h"
|
|
#include "LoaderFactory.h"
|
|
#include "PhraseDictionarySCFG.h"
|
|
#include "moses/FactorCollection.h"
|
|
#include "moses/Word.h"
|
|
#include "moses/Util.h"
|
|
#include "moses/InputFileStream.h"
|
|
#include "moses/StaticData.h"
|
|
#include "moses/WordsRange.h"
|
|
#include "moses/UserMessage.h"
|
|
#include "moses/TranslationModel/CYKPlusParser/ChartRuleLookupManagerMemory.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
TargetPhraseCollection &PhraseDictionarySCFG::GetOrCreateTargetPhraseCollection(
|
|
const Phrase &source
|
|
, const TargetPhrase &target
|
|
, const Word &sourceLHS)
|
|
{
|
|
PhraseDictionaryNodeSCFG &currNode = GetOrCreateNode(source, target, sourceLHS);
|
|
return currNode.GetOrCreateTargetPhraseCollection();
|
|
}
|
|
|
|
const TargetPhraseCollection *PhraseDictionarySCFG::GetTargetPhraseCollection(const Phrase& source) const
|
|
{
|
|
// exactly like CreateTargetPhraseCollection, but don't create
|
|
const size_t size = source.GetSize();
|
|
|
|
const PhraseDictionaryNodeSCFG *currNode = &m_collection;
|
|
for (size_t pos = 0 ; pos < size ; ++pos) {
|
|
const Word& word = source.GetWord(pos);
|
|
currNode = currNode->GetChild(word);
|
|
if (currNode == NULL)
|
|
return NULL;
|
|
}
|
|
|
|
const TargetPhraseCollection *coll = currNode->GetTargetPhraseCollection();
|
|
/*
|
|
if (coll) {
|
|
cerr << "source=" << source << endl
|
|
<< *coll << endl;
|
|
}
|
|
*/
|
|
return coll;
|
|
}
|
|
|
|
PhraseDictionaryNodeSCFG &PhraseDictionarySCFG::GetOrCreateNode(const Phrase &source
|
|
, const TargetPhrase &target
|
|
, const Word &sourceLHS)
|
|
{
|
|
const size_t size = source.GetSize();
|
|
|
|
const AlignmentInfo &alignmentInfo = target.GetAlignNonTerm();
|
|
AlignmentInfo::const_iterator iterAlign = alignmentInfo.begin();
|
|
|
|
PhraseDictionaryNodeSCFG *currNode = &m_collection;
|
|
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 != alignmentInfo.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;
|
|
}
|
|
|
|
ChartRuleLookupManager *PhraseDictionarySCFG::CreateRuleLookupManager(
|
|
const InputType &sentence,
|
|
const ChartCellCollectionBase &cellCollection)
|
|
{
|
|
return new ChartRuleLookupManagerMemory(sentence, cellCollection, *this);
|
|
}
|
|
|
|
void PhraseDictionarySCFG::SortAndPrune()
|
|
{
|
|
if (GetTableLimit())
|
|
{
|
|
m_collection.Sort(GetTableLimit());
|
|
}
|
|
}
|
|
|
|
TO_STRING_BODY(PhraseDictionarySCFG);
|
|
|
|
// friend
|
|
ostream& operator<<(ostream& out, const PhraseDictionarySCFG& 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;
|
|
}
|
|
|
|
}
|