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
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
#include <stdlib.h>
#include "../core/char.h"
#include "../core/index.h"
#include "../core/sequence.h"
#include "../pipe/pipe.h"
#include "knowledge.h"
/* See "knowledge.h". */
int ZoO_knowledge_find_word_id
(
const struct ZoO_knowledge k [const restrict static 1],
const ZoO_char word [const restrict static 1],
const size_t word_size,
ZoO_index result [const restrict static 1]
)
{
/* This is a binary search */
int cmp;
ZoO_index i, current_min, current_max;
ZoO_index candidate_id;
/* Handles the case where the list is empty ********************************/
current_max = k->words_length;
if (current_max == 0)
{
*result = 0;
return -1;
}
/***************************************************************************/
current_min = 0;
current_max -= 1;
for (;;)
{
i = (current_min + ((current_max - current_min) / 2));
cmp = ZoO_word_cmp(word, word_size, k->words[k->words_sorted[i]].word);
if (cmp > 0)
{
current_min = (i + 1);
if (current_min > current_max)
{
*result = current_min;
return -1;
}
}
else if (cmp < 0)
{
if ((current_min > current_max) || (i == 0))
{
*result = current_min;
return -1;
}
current_max = (i - 1);
}
else
{
*result = k->words_sorted[i];
return 0;
}
}
}
int ZoO_knowledge_find_preceding_words
(
const struct ZoO_knowledge k [const static 1],
const ZoO_index sequence [const restrict],
const ZoO_index markov_order, /* Pre: (> 0) */
const ZoO_index * restrict preceding_words [const restrict static 1],
const ZoO_index * restrict preceding_words_weights [const restrict static 1],
ZoO_index preceding_words_weights_sum [const restrict static 1],
const struct ZoO_pipe io [const restrict static 1]
)
{
/* This is a binary search */
int cmp;
ZoO_index i, current_min, current_max, local_sequence;
const ZoO_index * restrict candidate;
const ZoO_index markov_sequence_length = (markov_order - 1);
const ZoO_index word = sequence[markov_sequence_length];
if (word >= k->words_length)
{
ZoO_S_ERROR
(
io,
"Attempting to find the preceding words of an unknown word."
);
*preceding_words = (const ZoO_index *) NULL;
*preceding_words_weights = (const ZoO_index *) NULL;
*preceding_words_weights_sum = 0;
return -1;
}
if (markov_order == 1)
{
/* Special case: empty sequences. */
*preceding_words = (const ZoO_index *) k->words[word].preceded.targets;
*preceding_words_weights =
(const ZoO_index *) k->words[word].preceded.targets_occurrences;
*preceding_words_weights_sum = k->words[word].occurrences;
return 0;
}
/* Handles the case where the list is empty ********************************/
current_max = k->words[word].preceded.sequences_ref_length;
if (current_max == 0)
{
*preceding_words = (const ZoO_index *) NULL;
*preceding_words_weights = (const ZoO_index *) NULL;
*preceding_words_weights_sum = 0;
ZoO_S_ERROR
(
io,
"Attempting to find the preceding words of a sequence that never had "
"any."
);
return -2;
}
/***************************************************************************/
current_min = 0;
current_max -= 1;
for (;;)
{
i = (current_min + ((current_max - current_min) / 2));
local_sequence = k->words[word].preceded.sequences_ref_sorted[i];
(void) ZoO_knowledge_get_sequence
(
k,
k->words[word].preceded.sequences_ref[local_sequence],
&candidate,
io
);
cmp =
ZoO_sequence_cmp
(
sequence,
markov_sequence_length,
candidate,
markov_sequence_length
);
if (cmp > 0)
{
current_min = (i + 1);
if (current_min > current_max)
{
*preceding_words = (const ZoO_index *) NULL;
*preceding_words_weights = (const ZoO_index *) NULL;
*preceding_words_weights_sum = 0;
return -2;
}
}
else if (cmp < 0)
{
if ((current_min > current_max) || (i == 0))
{
*preceding_words = (const ZoO_index *) NULL;
*preceding_words_weights = (const ZoO_index *) NULL;
*preceding_words_weights_sum = 0;
return -2;
}
current_max = (i - 1);
}
else
{
*preceding_words = k->words[word].preceded.targets[local_sequence];
*preceding_words_weights =
k->words[word].preceded.targets_occurrences[local_sequence];
*preceding_words_weights_sum =
k->words[word].preceded.occurrences[local_sequence];
return 0;
}
}
}
int ZoO_knowledge_find_following_words
(
const struct ZoO_knowledge k [const static 1],
const ZoO_index sequence [const restrict],
const ZoO_index sequence_length,
const ZoO_index markov_order,
const ZoO_index * restrict following_words [const restrict static 1],
const ZoO_index * restrict following_words_weights [const restrict static 1],
ZoO_index following_words_weights_sum [const restrict static 1],
const struct ZoO_pipe io [const restrict static 1]
)
{
/* This is a binary search */
int cmp;
ZoO_index i, current_min, current_max, local_sequence;
const ZoO_index * restrict candidate;
const ZoO_index markov_sequence_length = (markov_order - 1);
const ZoO_index sequence_offset =
((sequence_length - markov_sequence_length) - 1);
const ZoO_index word = sequence[sequence_offset];
if (word >= k->words_length)
{
ZoO_S_ERROR
(
"Attempting to find the following words of an unknown word."
);
*following_words = (const ZoO_index *) NULL;
*following_words_weights = (const ZoO_index *) NULL;
*following_words_weights_sum = 0;
return -1;
}
if (markov_order == 1)
{
/* Special case: empty sequences. */
*following_words = (const ZoO_index *) k->words[word].preceded.targets;
*following_words_weights =
(const ZoO_index *) k->words[word].preceded.targets_occurrences;
*following_words_weights_sum = k->words[word].occurrences;
return 0;
}
/* Handles the case where the list is empty ********************************/
current_max = k->words[word].preceded.sequences_ref_length;
if (current_max == 0)
{
*following_words = (const ZoO_index *) NULL;
*following_words_weights = (const ZoO_index *) NULL;
*following_words_weights_sum = 0;
ZoO_S_WARNING
(
io,
"Attempting to find the following words of a sequence that never had "
"any."
);
return -2;
}
/***************************************************************************/
current_min = 0;
current_max -= 1;
for (;;)
{
i = (current_min + ((current_max - current_min) / 2));
local_sequence = k->words[word].followed.sequences_ref_sorted[i];
(void) ZoO_knowledge_get_sequence
(
k,
k->words[word].followed.sequences_ref[local_sequence],
&candidate,
io
);
cmp =
ZoO_sequence_cmp
(
(sequence + sequence_offset),
markov_sequence_length,
candidate,
markov_sequence_length
);
if (cmp > 0)
{
current_min = (i + 1);
if (current_min > current_max)
{
*following_words = (const ZoO_index *) NULL;
*following_words_weights = (const ZoO_index *) NULL;
*following_words_weights_sum = 0;
return -2;
}
}
else if (cmp < 0)
{
if ((current_min > current_max) || (i == 0))
{
*following_words = (const ZoO_index *) NULL;
*following_words_weights = (const ZoO_index *) NULL;
*following_words_weights_sum = 0;
return -2;
}
current_max = (i - 1);
}
else
{
*following_words = k->words[word].followed.targets[local_sequence];
*following_words_weights =
k->words[word].followed.targets_occurrences[local_sequence];
*following_words_weights_sum =
k->words[word].followed.occurrences[local_sequence];
return 0;
}
}
}
|
