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
|
// $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 "PhraseDictionaryNodeSCFG.h"
#include "TargetPhrase.h"
#include "PhraseDictionary.h"
namespace Moses
{
PhraseDictionaryNodeSCFG::~PhraseDictionaryNodeSCFG()
{
delete m_targetPhraseCollection;
}
void PhraseDictionaryNodeSCFG::Prune(size_t tableLimit)
{
// recusively prune
for (TerminalMap::iterator p = m_sourceTermMap.begin(); p != m_sourceTermMap.end(); ++p) {
p->second.Prune(tableLimit);
}
for (NonTerminalMap::iterator p = m_nonTermMap.begin(); p != m_nonTermMap.end(); ++p) {
p->second.Prune(tableLimit);
}
// prune TargetPhraseCollection in this node
if (m_targetPhraseCollection != NULL)
m_targetPhraseCollection->Prune(true, tableLimit);
}
void PhraseDictionaryNodeSCFG::Sort(size_t tableLimit)
{
// recusively sort
for (TerminalMap::iterator p = m_sourceTermMap.begin(); p != m_sourceTermMap.end(); ++p) {
p->second.Sort(tableLimit);
}
for (NonTerminalMap::iterator p = m_nonTermMap.begin(); p != m_nonTermMap.end(); ++p) {
p->second.Sort(tableLimit);
}
// prune TargetPhraseCollection in this node
if (m_targetPhraseCollection != NULL) {
m_targetPhraseCollection->Sort(true, tableLimit);
}
}
PhraseDictionaryNodeSCFG *PhraseDictionaryNodeSCFG::GetOrCreateChild(const Word &sourceTerm)
{
//CHECK(!sourceTerm.IsNonTerminal());
std::pair <TerminalMap::iterator,bool> insResult;
insResult = m_sourceTermMap.insert( std::make_pair(sourceTerm, PhraseDictionaryNodeSCFG()) );
const TerminalMap::iterator &iter = insResult.first;
PhraseDictionaryNodeSCFG &ret = iter->second;
return &ret;
}
PhraseDictionaryNodeSCFG *PhraseDictionaryNodeSCFG::GetOrCreateChild(const Word &sourceNonTerm, const Word &targetNonTerm)
{
CHECK(sourceNonTerm.IsNonTerminal());
CHECK(targetNonTerm.IsNonTerminal());
NonTerminalMapKey key(sourceNonTerm, targetNonTerm);
std::pair <NonTerminalMap::iterator,bool> insResult;
insResult = m_nonTermMap.insert( std::make_pair(key, PhraseDictionaryNodeSCFG()) );
const NonTerminalMap::iterator &iter = insResult.first;
PhraseDictionaryNodeSCFG &ret = iter->second;
return &ret;
}
const PhraseDictionaryNodeSCFG *PhraseDictionaryNodeSCFG::GetChild(const Word &sourceTerm) const
{
CHECK(!sourceTerm.IsNonTerminal());
TerminalMap::const_iterator p = m_sourceTermMap.find(sourceTerm);
return (p == m_sourceTermMap.end()) ? NULL : &p->second;
}
const PhraseDictionaryNodeSCFG *PhraseDictionaryNodeSCFG::GetChild(const Word &sourceNonTerm, const Word &targetNonTerm) const
{
CHECK(sourceNonTerm.IsNonTerminal());
CHECK(targetNonTerm.IsNonTerminal());
NonTerminalMapKey key(sourceNonTerm, targetNonTerm);
NonTerminalMap::const_iterator p = m_nonTermMap.find(key);
return (p == m_nonTermMap.end()) ? NULL : &p->second;
}
void PhraseDictionaryNodeSCFG::Clear()
{
m_sourceTermMap.clear();
m_nonTermMap.clear();
delete m_targetPhraseCollection;
}
std::ostream& operator<<(std::ostream &out, const PhraseDictionaryNodeSCFG &node)
{
out << node.GetTargetPhraseCollection();
return out;
}
TO_STRING_BODY(PhraseDictionaryNodeSCFG)
}
|
