graphalignedsegment.cpp
6.75 KB
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
/*
* ASCLITE
* Author: Jerome Ajot, Jon Fiscus, Nicolas Radde, Chris Laprun
*
* This software was developed at the National Institute of Standards and Technology by
* employees of the Federal Government in the course of their official duties. Pursuant
* to title 17 Section 105 of the United States Code this software is not subject to
* copyright protection and is in the public domain. ASCLITE is an experimental system.
* NIST assumes no responsibility whatsoever for its use by other parties, and makes no
* guarantees, expressed or implied, about its quality, reliability, or any other
* characteristic. We would appreciate acknowledgement if the software is used.
*
* THIS SOFTWARE IS PROVIDED "AS IS." With regard to this software, NIST MAKES NO EXPRESS
* OR IMPLIED WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING MERCHANTABILITY,
* OR FITNESS FOR A PARTICULAR PURPOSE.
*/
/**
* The result produce by the Graph after a Levenshtein alignment
*/
#include "graphalignedsegment.h"
Logger* GraphAlignedSegment::m_pLogger = Logger::getLogger();
/** class constructor */
GraphAlignedSegment::GraphAlignedSegment(const size_t& _HypRefIndex) : m_HypRefIndex(_HypRefIndex)
{
}
/** class destructor */
GraphAlignedSegment::~GraphAlignedSegment()
{
vector<GraphAlignedToken*>::iterator i, ei;
i = m_vGraphAlignedTokens.begin();
ei = m_vGraphAlignedTokens.end();
while(i != ei)
{
GraphAlignedToken* elt_ptr = *i;
if(elt_ptr)
delete elt_ptr;
++i;
}
m_vGraphAlignedTokens.clear();
}
/** Return the indexed element of the GraphAlignedSegment */
GraphAlignedToken* GraphAlignedSegment::GetGraphAlignedToken(const size_t& index)
{
if(index < GetNbOfGraphAlignedToken())
{
return m_vGraphAlignedTokens[GetNbOfGraphAlignedToken() - index - 1];
}
else
{
return NULL;
}
}
string GraphAlignedSegment::ToStringAddnChar(const string& chara, const int& num)
{
ostringstream outstr;
for(int i=0; i<num; ++i)
outstr << chara;
return outstr.str();
}
string GraphAlignedSegment::ToStringAddText(const string& text, const int& maxc)
{
ostringstream outstr;
if (text.length() > 20)
{
outstr << "...";
outstr << ToStringAddnChar(" ", maxc-3);
}
else
{
outstr << " " << text << " ";
outstr << ToStringAddnChar(" ", maxc - text.length());
}
return outstr.str();
}
/** Returns a string representation of this GraphAlignedSegment. */
string GraphAlignedSegment::ToString()
{
ostringstream osstr;
size_t i, nbrGAT, GATdim;
Token* token = NULL;
long int refSepIndex = m_HypRefIndex - 1;
nbrGAT = GetNbOfGraphAlignedToken();
if (nbrGAT == 0)
{
osstr << "!!! No aligned tokens in this graphalignedsegment !!!" << endl;
return osstr.str();
}
GATdim = GetGraphAlignedToken(0)->GetDimension();
int k = GATdim - 1;
int* maxsize = new int[nbrGAT];
for(i = 0; i < nbrGAT; ++i)
{
int maxsizei = 0;
for(size_t j = 0; j < GATdim ; ++j)
{
token = GetGraphAlignedToken(i)->GetToken(j);
if(token != NULL)
{
maxsizei = max(maxsizei, (int) token->GetText().length());
}
else
{
maxsizei = max(maxsizei, 1);
}
}
maxsize[i] = maxsizei;
}
for(long int j = GATdim - 1; j >= 0; --j)
{
if(j == refSepIndex)
{
osstr << "|-----|";
for(i=0; i<nbrGAT; ++i)
{
osstr << ToStringAddnChar("-", maxsize[i]+2);
osstr << "|";
}
osstr << endl;
}
else if(j == k)
{
osstr << ",-----";
for(i=0; i<nbrGAT; ++i)
{
osstr << ToStringAddnChar("-", maxsize[i]+3);
}
osstr << "." << endl;
}
osstr << "| " << ((j > refSepIndex) ? "ref" : "hyp") << " |";
for(i = 0; i < nbrGAT; ++i)
{
token = GetGraphAlignedToken(i)->GetToken(j);
if(token != NULL)
{
osstr << ToStringAddText(token->GetText(), maxsize[i]);
}
else
{
osstr << ToStringAddText("*", maxsize[i]);
}
osstr << "|";
}
osstr << endl;
}
osstr << "`-----";
for(i=0; i<nbrGAT; ++i)
osstr << ToStringAddnChar("-", maxsize[i]+3);
osstr << "'" << endl;
return osstr.str();
}
void GraphAlignedSegment::LoggingAlignment(const ulint& seggrpid)
{
char buffer[BUFFER_SIZE];
sprintf(buffer, "%li", seggrpid);
string seggrpsid = string(buffer);
for(size_t i=0; i < GetNbOfGraphAlignedToken(); ++i)
{
GraphAlignedToken* gat = GetGraphAlignedToken(i);
string alignoutput = "";
string File = "";
string Channel = "";
for(size_t j=0; j<gat->GetDimension(); ++j)
{
Token* gat_token = gat->GetToken(j);
if(gat_token != NULL)
{
File = gat_token->GetParentSegment()->GetSource();
Channel = gat_token->GetParentSegment()->GetChannel();
alignoutput += "," + gat_token->GetCSVInformation();
}
else
{
alignoutput += ",,,,,,,,,,,";
}
}
LOG_ALIGN(m_pLogger, "YES," + seggrpsid + "," + File + "," + Channel + "," + alignoutput);
}
}
Token* GraphAlignedSegment::GetNonNullReference(const size_t& gatIndex)
{
GraphAlignedToken* aGAT = GetGraphAlignedToken(gatIndex);
if(aGAT != NULL)
{
Token* outToken;
for(size_t i=m_HypRefIndex; i<aGAT->GetDimension(); ++i)
{
outToken = aGAT->GetToken(i);
if(outToken != NULL)
return outToken;
}
}
return NULL;
}
Token* GraphAlignedSegment::GetNonNullHypothesis(const size_t& gatIndex)
{
GraphAlignedToken* aGAT = GetGraphAlignedToken(gatIndex);
if(aGAT != NULL)
{
Token* outToken;
for(size_t i=0; i<m_HypRefIndex; ++i)
{
outToken = aGAT->GetToken(i);
if(outToken != NULL)
return outToken;
}
}
return NULL;
}
Token* GraphAlignedSegment::GetPreviousNonNullReference(const size_t& gatIndex)
{
if (gatIndex == 0)
return NULL;
Token* result = NULL;
for (long int i = gatIndex - 1; i >= 0; --i)
{
result = GetNonNullReference(i);
if (result != NULL)
return result;
}
return result;
}
Token* GraphAlignedSegment::GetNextNonNullReference(const size_t& gatIndex)
{
size_t size = GetNbOfGraphAlignedToken();
if (gatIndex >= size)
return NULL;
Token* result = NULL;
for (size_t i = gatIndex + 1; i < size; ++i)
{
result = GetNonNullReference(i);
if (result != NULL)
return result;
}
return result;
}
bool GraphAlignedSegment::operator ==(const GraphAlignedSegment & gas) const
{
size_t size = m_vGraphAlignedTokens.size();
if (size != gas.m_vGraphAlignedTokens.size())
return false;
if (m_HypRefIndex != gas.m_HypRefIndex)
return false;
for (size_t i=0 ; i < size ; ++i)
if (*m_vGraphAlignedTokens[i] != *(gas.m_vGraphAlignedTokens[i]))
return false;
return true;
}
bool GraphAlignedSegment::operator !=(const GraphAlignedSegment & gas) const
{
return !(gas == *this);
}