File size: 3,608 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 |
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2012 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 "moses/NonTerminal.h"
#include "moses/TargetPhrase.h"
#include "moses/TargetPhraseCollection.h"
#include "moses/Util.h"
#include "moses/Word.h"
#include "UTrieNode.h"
#include "Trie.h"
#include "moses/TranslationModel/PhraseDictionaryNodeMemory.h" // For TerminalHasher and TerminalEqualityPred
#include <boost/functional/hash.hpp>
#include <boost/unordered_map.hpp>
#include <boost/version.hpp>
#include <map>
#include <vector>
namespace Moses
{
void UTrieNode::Prune(size_t tableLimit)
{
// Recusively prune child node values.
for (TerminalMap::iterator p = m_terminalMap.begin();
p != m_terminalMap.end(); ++p) {
p->second.Prune(tableLimit);
}
if (m_gapNode) {
m_gapNode->Prune(tableLimit);
}
// Prune TargetPhraseCollections at this node.
for (LabelMap::iterator p = m_labelMap.begin(); p != m_labelMap.end(); ++p) {
p->second->Prune(true, tableLimit);
}
}
void UTrieNode::Sort(size_t tableLimit)
{
// Recusively sort child node values.
for (TerminalMap::iterator p = m_terminalMap.begin();
p != m_terminalMap.end(); ++p) {
p->second.Sort(tableLimit);
}
if (m_gapNode) {
m_gapNode->Sort(tableLimit);
}
// Sort TargetPhraseCollections at this node.
for (LabelMap::iterator p = m_labelMap.begin(); p != m_labelMap.end(); ++p) {
p->second->Sort(true, tableLimit);
}
}
UTrieNode *UTrieNode::GetOrCreateTerminalChild(const Word &sourceTerm)
{
assert(!sourceTerm.IsNonTerminal());
std::pair<TerminalMap::iterator, bool> result;
result = m_terminalMap.insert(std::make_pair(sourceTerm, UTrieNode()));
const TerminalMap::iterator &iter = result.first;
UTrieNode &child = iter->second;
return &child;
}
UTrieNode *UTrieNode::GetOrCreateNonTerminalChild(const Word &targetNonTerm)
{
assert(targetNonTerm.IsNonTerminal());
if (m_gapNode == NULL) {
m_gapNode = new UTrieNode();
}
return m_gapNode;
}
TargetPhraseCollection::shared_ptr
UTrieNode::
GetOrCreateTargetPhraseCollection(const TargetPhrase &target)
{
const AlignmentInfo &alignmentInfo = target.GetAlignNonTerm();
const size_t rank = alignmentInfo.GetSize();
std::vector<int> vec;
vec.reserve(rank);
m_labelTable.resize(rank);
int i = 0;
for (AlignmentInfo::const_iterator p = alignmentInfo.begin();
p != alignmentInfo.end(); ++p) {
size_t targetNonTermIndex = p->second;
const Word &targetNonTerm = target.GetWord(targetNonTermIndex);
vec.push_back(InsertLabel(i++, targetNonTerm));
}
TargetPhraseCollection::shared_ptr& ret = m_labelMap[vec];
if (ret == NULL) ret.reset(new TargetPhraseCollection);
return ret;
}
} // namespace Moses
|