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
|
/*
* LatticeNode.cpp
* extract
*
* Created by Hieu Hoang on 18/07/2010.
* Copyright 2010 __MyCompanyName__. All rights reserved.
*
*/
#include <sstream>
#include "LatticeNode.h"
#include "SyntaxTree.h"
#include "Tunnel.h"
#include "SentenceAlignment.h"
#include "SymbolSequence.h"
size_t LatticeNode::s_count = 0;
using namespace std;
// for terms
LatticeNode::LatticeNode(const Tunnel &hole, const SentenceAlignment *sentence)
:m_hole(hole)
,m_isTerminal(true)
,m_sourceTreeNode(NULL)
,m_targetTreeNode(NULL)
,m_sentence(sentence)
{
s_count++;
}
// for non-terms
LatticeNode::LatticeNode(const Tunnel &hole, const SyntaxNode *sourceTreeNode, const SyntaxNode *targetTreeNode)
:m_hole(hole)
,m_isTerminal(false)
,m_sourceTreeNode(sourceTreeNode)
,m_targetTreeNode(targetTreeNode)
,m_sentence(NULL)
{
s_count++;
}
bool LatticeNode::IsSyntax() const
{
assert(!m_isTerminal);
bool ret = m_sourceTreeNode->IsSyntax() || m_targetTreeNode->IsSyntax();
return ret;
}
std::string LatticeNode::ToString(size_t direction) const
{
stringstream ret;
if (m_isTerminal)
{
const std::vector<std::string> &words = (direction == 0 ? m_sentence->source : m_sentence->target);
size_t startPos = m_hole.GetStart(direction)
,endPos = m_hole.GetEnd(direction);
for (size_t pos = startPos; pos <= endPos; ++pos)
ret << words[pos] << " ";
}
else
{ // output both
ret << m_sourceTreeNode->GetLabel() << m_targetTreeNode->GetLabel() << " ";
}
return ret.str();
}
size_t LatticeNode::GetNumSymbols(size_t direction) const
{
if (m_isTerminal)
{
size_t ret = (direction == 0) ? m_hole.GetSpan(0) : m_hole.GetSpan(1);
return ret;
}
else
{
return 1;
}
}
int LatticeNode::Compare(const LatticeNode &otherNode) const
{
int ret = 0;
if (m_isTerminal != otherNode.m_isTerminal)
{
ret = m_isTerminal ? -1 : 1;
}
// both term or non-term
else if (m_isTerminal)
{ // term. compare span
ret = m_hole.Compare(otherNode.m_hole);
}
else
{ // non-term. compare labels & span
assert(m_isTerminal == false);
assert(m_isTerminal == otherNode.m_isTerminal);
if (m_sourceTreeNode->IsSyntax())
{
ret = m_hole.Compare(otherNode.m_hole, 0);
if (ret == 0 && m_sourceTreeNode->GetLabel() != otherNode.m_sourceTreeNode->GetLabel())
{
ret = (m_sourceTreeNode->GetLabel() < otherNode.m_sourceTreeNode->GetLabel()) ? -1 : +1;
}
}
if (ret == 0 && m_targetTreeNode->IsSyntax())
{
ret = m_hole.Compare(otherNode.m_hole, 1);
if (ret == 0 && m_targetTreeNode->GetLabel() != otherNode.m_targetTreeNode->GetLabel())
{
ret = (m_targetTreeNode->GetLabel() < otherNode.m_targetTreeNode->GetLabel()) ? -1 : +1;
}
}
}
return ret;
}
void LatticeNode::CreateSymbols(size_t direction, SymbolSequence &symbols) const
{
if (m_isTerminal)
{
const std::vector<std::string> &words = (direction == 0 ? m_sentence->source : m_sentence->target);
size_t startPos = m_hole.GetStart(direction)
,endPos = m_hole.GetEnd(direction);
for (size_t pos = startPos; pos <= endPos; ++pos)
{
Symbol symbol(words[pos], pos);
symbols.Add(symbol);
}
}
else
{ // output both
Symbol symbol(m_sourceTreeNode->GetLabel(), m_targetTreeNode->GetLabel()
, m_hole.GetStart(0), m_hole.GetEnd(0)
, m_hole.GetStart(1), m_hole.GetEnd(1)
, m_sourceTreeNode->IsSyntax(), m_targetTreeNode->IsSyntax());
symbols.Add(symbol);
}
}
|
