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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 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 <iostream>
#include "Node.h"
#include "Subgraph.h"
namespace MosesTraining
{
namespace Syntax
{
namespace GHKM
{
void Subgraph::GetTargetLeaves(std::vector<const Node *> &result) const
{
result.clear();
GetTargetLeaves(m_root, result);
}
void Subgraph::GetTargetLeaves(const Node *root,
std::vector<const Node *> &result) const
{
if (root->GetType() == TARGET || m_leaves.find(root) != m_leaves.end()) {
result.push_back(root);
} else {
const std::vector<Node*> &children = root->GetChildren();
for (std::vector<Node *>::const_iterator p(children.begin());
p != children.end(); ++p) {
GetTargetLeaves(*p, result);
}
}
}
int Subgraph::CountNodes(const Node *n) const
{
if (n->GetType() != TREE) {
return 0;
}
if (IsTrivial()) {
return 1;
}
int count = 1;
const std::vector<Node*> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p = children.begin();
p != children.end(); ++p) {
const Node *child = *p;
if (m_leaves.find(child) == m_leaves.end()) {
count += CountNodes(child);
} else if (child->GetType() == TREE) {
++count;
}
}
return count;
}
int Subgraph::CalcSize(const Node *n) const
{
if (n->GetType() != TREE || n->IsPreterminal()) {
return 0;
}
if (IsTrivial()) {
return 1;
}
int count = 1;
const std::vector<Node*> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p = children.begin();
p != children.end(); ++p) {
if (m_leaves.find(*p) == m_leaves.end()) {
count += CalcSize(*p);
}
}
return count;
}
int Subgraph::CalcDepth(const Node *n) const
{
if (n->GetType() != TREE || n->IsPreterminal() || m_leaves.empty()) {
return 0;
}
int maxChildDepth = 0;
const std::vector<Node*> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p = children.begin();
p != children.end(); ++p) {
if (m_leaves.find(*p) == m_leaves.end()) {
maxChildDepth = std::max(maxChildDepth, CalcDepth(*p));
}
}
return maxChildDepth + 1;
}
float Subgraph::CalcPcfgScore() const
{
if (m_root->GetType() != TREE || m_leaves.empty()) {
return 0.0f;
}
float score = m_root->GetPcfgScore();
for (std::set<const Node *>::const_iterator p = m_leaves.begin();
p != m_leaves.end(); ++p) {
const Node *leaf = *p;
if (leaf->GetType() == TREE) {
score -= leaf->GetPcfgScore();
}
}
return score;
}
void Subgraph::PrintTree(std::ostream &out) const
{
RecursivelyPrintTree(m_root,out);
}
void Subgraph::RecursivelyPrintTree(const Node *n, std::ostream &out) const
{
NodeType nodeType = n->GetType();
if (nodeType == TREE) {
out << "[" << n->GetLabel();
if (m_leaves.find(n) == m_leaves.end()) {
const std::vector<Node *> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p(children.begin());
p != children.end(); ++p) {
Node *child = *p;
out << " ";
RecursivelyPrintTree(child,out);
}
}
out << "]";
} else if (nodeType == TARGET) {
out << n->GetLabel();
}
}
void Subgraph::PrintPartsOfSpeech(std::ostream &out) const
{
RecursivelyPrintPartsOfSpeech(m_root,out);
}
void Subgraph::RecursivelyPrintPartsOfSpeech(const Node *n, std::ostream &out) const
{
NodeType nodeType = n->GetType();
if (nodeType == TREE) {
if (m_leaves.find(n) == m_leaves.end()) {
const std::vector<Node *> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p(children.begin());
p != children.end(); ++p) {
Node *child = *p;
if (child->GetType() == TARGET) {
out << " " << n->GetLabel();
} else {
RecursivelyPrintPartsOfSpeech(child,out);
}
}
}
}
}
void Subgraph::GetPartsOfSpeech(std::vector<std::string> &out) const
{
out.clear();
RecursivelyGetPartsOfSpeech(m_root,out);
}
void Subgraph::RecursivelyGetPartsOfSpeech(const Node *n, std::vector<std::string> &out) const
{
NodeType nodeType = n->GetType();
if (nodeType == TREE) {
if (m_leaves.find(n) == m_leaves.end()) {
const std::vector<Node *> &children = n->GetChildren();
for (std::vector<Node *>::const_iterator p(children.begin());
p != children.end(); ++p) {
Node *child = *p;
if (child->GetType() == TARGET) {
out.push_back(n->GetLabel());
} else {
RecursivelyGetPartsOfSpeech(child,out);
}
}
}
}
}
} // namespace MosesTraining
} // namespace Syntax
} // namespace GHKM
|
