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
***********************************************************************/
#pragma once
#include "moses/NonTerminal.h"
#include "moses/TargetPhrase.h"
#include "moses/TargetPhraseCollection.h"
#include "moses/Terminal.h"
#include "moses/Util.h"
#include "moses/Word.h"
#include "Trie.h"
#include <boost/functional/hash.hpp>
#include <boost/unordered_map.hpp>
#include <boost/version.hpp>
#include <map>
#include <vector>
namespace Moses
{
class RuleTableUTrie;
//! @todo ask phil williams - whats the diff between this and phrasedictionaryNode
class UTrieNode
{
public:
typedef std::vector<std::vector<Word> > LabelTable;
#if defined(BOOST_VERSION) && (BOOST_VERSION >= 104200)
typedef boost::unordered_map<Word,
UTrieNode,
TerminalHasher,
TerminalEqualityPred> TerminalMap;
typedef boost::unordered_map<std::vector<int>,
TargetPhraseCollection::shared_ptr> LabelMap;
#else
typedef std::map<Word, UTrieNode> TerminalMap;
typedef std::map<std::vector<int>, TargetPhraseCollection::shared_ptr> LabelMap;
#endif
~UTrieNode() {
delete m_gapNode;
}
const LabelTable &GetLabelTable() const {
return m_labelTable;
}
const LabelMap &GetLabelMap() const {
return m_labelMap;
}
const TerminalMap &GetTerminalMap() const {
return m_terminalMap;
}
const UTrieNode *GetNonTerminalChild() const {
return m_gapNode;
}
UTrieNode *GetOrCreateTerminalChild(const Word &sourceTerm);
UTrieNode *GetOrCreateNonTerminalChild(const Word &targetNonTerm);
TargetPhraseCollection::shared_ptr
GetOrCreateTargetPhraseCollection(const TargetPhrase &);
bool IsLeaf() const {
return m_terminalMap.empty() && m_gapNode == NULL;
}
bool HasRules() const {
return !m_labelMap.empty();
}
void Prune(size_t tableLimit);
void Sort(size_t tableLimit);
private:
friend class RuleTableUTrie;
UTrieNode() : m_gapNode(NULL) {}
int InsertLabel(int i, const Word &w) {
std::vector<Word> &inner = m_labelTable[i];
for (size_t j = 0; j < inner.size(); ++j) {
if (inner[j] == w) {
return j;
}
}
inner.push_back(w);
return inner.size()-1;
}
LabelTable m_labelTable;
LabelMap m_labelMap;
TerminalMap m_terminalMap;
UTrieNode *m_gapNode;
};
} // namespace Moses
|
