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
|
from libc.stdlib cimport malloc, calloc, realloc, free, strtof, strtol
from libc.string cimport strsep, strcpy, strlen
cdef class Phrase:
cdef int *syms
cdef int n, *varpos, n_vars
def __cinit__(self, words):
cdef int i, j, n, n_vars
n_vars = 0
n = len(words)
self.syms = <int *>malloc(n*sizeof(int))
for i from 0 <= i < n:
self.syms[i] = words[i]
if ALPHABET.isvar(self.syms[i]):
n_vars += 1
self.n = n
self.n_vars = n_vars
self.varpos = <int *>malloc(n_vars*sizeof(int))
j = 0
for i from 0 <= i < n:
if ALPHABET.isvar(self.syms[i]):
self.varpos[j] = i
j = j + 1
def __dealloc__(self):
free(self.syms)
free(self.varpos)
def __str__(self):
strs = []
cdef int i, s
for i from 0 <= i < self.n:
s = self.syms[i]
strs.append(ALPHABET.tostring(s))
return " ".join(strs)
def handle(self):
"""return a hashable representation that normalizes the ordering
of the nonterminal indices"""
norm = []
cdef int i, j, s
i = 1
j = 0
for j from 0 <= j < self.n:
s = self.syms[j]
if ALPHABET.isvar(s):
s = ALPHABET.setindex(s,i)
i = i + 1
norm.append(s)
return tuple(norm)
def strhandle(self):
strs = []
norm = []
cdef int i, j, s
i = 1
j = 0
for j from 0 <= j < self.n:
s = self.syms[j]
if ALPHABET.isvar(s):
s = ALPHABET.setindex(s,i)
i = i + 1
norm.append(ALPHABET.tostring(s))
return " ".join(norm)
def arity(self):
return self.n_vars
def getvarpos(self, i):
if 0 <= i < self.n_vars:
return self.varpos[i]
else:
raise IndexError
def getvar(self, i):
if 0 <= i < self.n_vars:
return self.syms[self.varpos[i]]
else:
raise IndexError
cdef int chunkpos(self, int k):
if k == 0:
return 0
else:
return self.varpos[k-1]+1
cdef int chunklen(self, int k):
if self.n_vars == 0:
return self.n
elif k == 0:
return self.varpos[0]
elif k == self.n_vars:
return self.n-self.varpos[k-1]-1
else:
return self.varpos[k]-self.varpos[k-1]-1
def clen(self, k):
return self.chunklen(k)
def getchunk(self, ci):
cdef int start, stop
start = self.chunkpos(ci)
stop = start+self.chunklen(ci)
chunk = []
for i from start <= i < stop:
chunk.append(self.syms[i])
return chunk
def __cmp__(self, other):
cdef Phrase otherp
cdef int i
otherp = other
for i from 0 <= i < min(self.n, otherp.n):
if self.syms[i] < otherp.syms[i]:
return -1
elif self.syms[i] > otherp.syms[i]:
return 1
if self.n < otherp.n:
return -1
elif self.n > otherp.n:
return 1
else:
return 0
def __hash__(self):
cdef int i
cdef unsigned h
h = 0
for i from 0 <= i < self.n:
if self.syms[i] > 0:
h = (h << 1) + self.syms[i]
else:
h = (h << 1) + -self.syms[i]
return h
def __len__(self):
return self.n
def __getitem__(self, i):
return self.syms[i]
def __iter__(self):
cdef int i
l = []
for i from 0 <= i < self.n:
l.append(self.syms[i])
return iter(l)
def subst(self, start, children):
cdef int i
for i from 0 <= i < self.n:
if ALPHABET.isvar(self.syms[i]):
start = start + children[ALPHABET.getindex(self.syms[i])-1]
else:
start = start + (self.syms[i],)
return start
cdef class Rule:
cdef public int lhs
cdef readonly Phrase f, e
cdef float *cscores
cdef int n_scores
cdef public word_alignments
def __cinit__(self, int lhs, Phrase f, Phrase e,
scores=None, word_alignments=None):
cdef int i, n
cdef char *rest
if not ALPHABET.isvar(lhs):
raise Exception('Invalid LHS symbol: %d' % lhs)
self.lhs = lhs
self.f = f
self.e = e
self.word_alignments = word_alignments
if scores is None:
self.cscores = NULL
self.n_scores = 0
else:
n = len(scores)
self.cscores = <float *>malloc(n*sizeof(float))
self.n_scores = n
for i from 0 <= i < n:
self.cscores[i] = scores[i]
def __dealloc__(self):
if self.cscores != NULL:
free(self.cscores)
def __hash__(self):
return hash((self.lhs, self.f, self.e))
def __cmp__(self, Rule other):
return cmp((self.lhs, self.f, self.e, self.word_alignments), (other.lhs, other.f, other.e, self.word_alignments))
def __iadd__(self, Rule other):
if self.n_scores != other.n_scores:
raise ValueError
for i from 0 <= i < self.n_scores:
self.cscores[i] = self.cscores[i] + other.cscores[i]
return self
def fmerge(self, Phrase f):
if self.f == f:
self.f = f
def arity(self):
return self.f.arity()
def __str__(self):
scorestrs = []
for i from 0 <= i < self.n_scores:
scorestrs.append(str(self.cscores[i]))
fields = [ALPHABET.tostring(self.lhs), str(self.f), str(self.e), " ".join(scorestrs)]
if self.word_alignments is not None:
alignstr = []
for i from 0 <= i < len(self.word_alignments):
alignstr.append("%d-%d" % (self.word_alignments[i]/65536, self.word_alignments[i]%65536))
#for s,t in self.word_alignments:
#alignstr.append("%d-%d" % (s,t))
fields.append(" ".join(alignstr))
return " ||| ".join(fields)
property scores:
def __get__(self):
s = [None]*self.n_scores
for i from 0 <= i < self.n_scores:
s[i] = self.cscores[i]
return s
def __set__(self, s):
if self.cscores != NULL:
free(self.cscores)
self.cscores = <float *>malloc(len(s)*sizeof(float))
self.n_scores = len(s)
for i from 0 <= i < self.n_scores:
self.cscores[i] = s[i]
|
