-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathtokenizer.py
More file actions
executable file
·371 lines (327 loc) · 13.5 KB
/
tokenizer.py
File metadata and controls
executable file
·371 lines (327 loc) · 13.5 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
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
from collections import Counter
import os, re
import datetime
import torch
from multiprocessing import Pool
from nltk import Tree
from torch.utils import data
from fairseq.data import Dictionary
from dptree import tree_process, tree_builder
from dptree import nstack_process
SPACE_NORMALIZER = re.compile(r"\s+")
PRINT_INTERVAL = int(os.environ.get('PRINT_INTERVAL', 10000))
PLACE_HOLDER = '<placeholder>'
NSTACK_KEYS = ['leaves', 'nodes', 'pos_tags', 'spans']
# "leaves": leave_indices,
# "nodes": node_indices,
# "pos_tags": pos_tag_indices,
# "spans": span_indices
def tokenize_line(line):
line = SPACE_NORMALIZER.sub(" ", line)
line = line.strip()
return line.split()
def safe_readline(f):
pos = f.tell()
while True:
try:
return f.readline()
except UnicodeDecodeError:
pos -= 1
f.seek(pos) # search where this character begins
"""this seems like the main class that tokenizer/INTERPOLATES"""
class NstackTreeTokenizer(object):
@staticmethod
def tokenize(words, vocab, tokenize=tokenize_line, add_if_not_exist=True,
consumer=None, append_eos=True, reverse_order=False):
# words = tokenize(line)
if reverse_order:
words = list(reversed(words))
nwords = len(words)
ids = torch.IntTensor(nwords + 1 if append_eos else nwords)
for i, word in enumerate(words):
if add_if_not_exist:
idx = vocab.add_symbol(word)
else:
idx = vocab.index(word)
if consumer is not None:
consumer(word, idx)
ids[i] = idx
if append_eos:
ids[nwords] = vocab.eos_index
return ids
@staticmethod
def line2example(
s, vocab, consumer, tokenize=tokenize_line,
append_eos=False, reverse_order=False,
add_if_not_exist=False,
offset=0, end=-1,
remove_root=True, take_pos_tag=True, take_nodes=True,
no_collapse=False,
label_only=False, tolower=False):
leaves, pos_tags, nodes, spans = nstack_process.tree_string_to_leave_pos_node_span(
s, remove_root=remove_root, no_collapse=no_collapse)
print("the leaves are ",leaves)
print("the pos_tags are ",pos_tags)
print("the nodes are ",nodes)
print("the spans are ", spans)
if tolower:
leaves = ' '.join(leaves).lower().split()
pos_tags = ' '.join(pos_tags).lower().split()
nodes = ' '.join(nodes).lower().split()
leave_indices = NstackTreeTokenizer.tokenize(
words=leaves,
vocab=vocab,
tokenize=tokenize,
add_if_not_exist=add_if_not_exist,
consumer=consumer,
append_eos=append_eos,
reverse_order=reverse_order,
)
if label_only:
pos_tag_indices = torch.tensor([int(x) for x in pos_tags]).int()
node_indices = torch.tensor([int(x) for x in nodes]).int()
else:
pos_tag_indices = NstackTreeTokenizer.tokenize(
words=pos_tags,
vocab=vocab,
tokenize=tokenize,
add_if_not_exist=add_if_not_exist,
consumer=consumer,
append_eos=append_eos,
reverse_order=reverse_order,
)
node_indices = NstackTreeTokenizer.tokenize(
words=nodes,
vocab=vocab,
tokenize=tokenize,
add_if_not_exist=add_if_not_exist,
consumer=consumer,
append_eos=append_eos,
reverse_order=reverse_order,
)
span_indices = torch.tensor(spans).int()
assert span_indices.dim() == 2, f'{s}: {leaves}, {pos_tags}, {nodes}, {spans}'
assert span_indices.size(0) == node_indices.size(0)
example = {
"leaves": leave_indices,
"nodes": node_indices,
"pos_tags": pos_tag_indices,
"spans": span_indices
# "length": line_len
}
return example
@staticmethod
def line2multi_example(
s, vocab, consumer, tokenize=tokenize_line,
append_eos=False, reverse_order=False,
add_if_not_exist=False,
offset=0, end=-1,
line2example=None,
# noat=False,
# cnf=True,
remove_root=True, take_pos_tag=True, take_nodes=True
):
tree_strings = s.split(nstack_process.NstackTreeBuilder.SENT_SPLITTER)
try:
if line2example is None:
line2example = NstackTreeTokenizer.line2example
examples = [line2example(
x, vocab, consumer, tokenize, append_eos, reverse_order, add_if_not_exist,
offset, end, remove_root=remove_root, take_pos_tag=take_pos_tag, take_nodes=take_nodes
) for x in tree_strings]
except ValueError as ve:
print(f'Error in this example')
print(s)
raise ve
keys = list(examples[0].keys())
def merge_trees(tensors, pad_idx=1):
"""
[(n1, d...), (n2, d...), (nm]
:param tensors:
:return: [m, max(n1...nm), d...]
"""
size = max(v.size(0) for v in tensors)
rest_size = list(tensors[0].size()[1:])
res = tensors[0].new(len(tensors), size, *rest_size).fill_(pad_idx)
def copy_tensor(src, dst):
assert dst.numel() == src.numel()
dst.copy_(src)
for i, v in enumerate(tensors):
copy_tensor(v, res[i][:len(v)])
return res
ntok = sum([len(x['leaves']) + len(x['nodes']) for x in examples])
examples_d = {
"leaves": merge_trees([x['leaves'] for x in examples], 1),
"nodes": merge_trees([x['nodes'] for x in examples], 1),
"pos_tags": merge_trees([x['pos_tags'] for x in examples], 1),
"spans": merge_trees([x['spans'] for x in examples], 0),
# "length": torch.cat([x['length'] for x in examples], 0),
}
return examples_d, ntok
@staticmethod
def line2multimerge_example(
s, vocab, consumer, tokenize=tokenize_line,
append_eos=False, reverse_order=False,
add_if_not_exist=False,
offset=0, end=-1,
line2example=None,
remove_root=True, take_pos_tag=True, take_nodes=True,
reverse_node=True,
no_collapse=False,
label_only=False,
tolower=False
):
# different line2multi_example is that it merge multiple sentences together-> single leave, nodes
tree_strings = s.split(nstack_process.NstackTreeBuilder.SENT_SPLITTER)
try:
if line2example is None:
line2example = NstackTreeTokenizer.line2example
examples = [line2example(
x, vocab, consumer, tokenize, append_eos, reverse_order, add_if_not_exist,
offset, end, remove_root=remove_root, take_pos_tag=take_pos_tag, take_nodes=take_nodes,
no_collapse=no_collapse,
label_only=label_only, tolower=tolower,
) for x in tree_strings]
except ValueError as ve:
print(f'Error in this example')
print(s)
raise ve
keys = list(examples[0].keys())
def merge_seq(tensors, pad_idx=1, reverse=False):
"""
[(n1, d...), (n2, d...), (nm, d...)]
:param tensors:
:param pad_idx:
:return: [sum(n1...nm), d...]
"""
# total_len = sum(v.size(0) for v in tensors)
out = torch.cat(tensors, 0)
if reverse:
out = torch.flip(out, [0])
return out
def merge_indices(tensors, leave_lengths, pad_idx=0, reverse=False):
"""
[(n1, d...), (n2, d...), (nm, d...)]
:param tensors:
:param leave_lengths
:param pad_idx:
:return: [sum(n1...nm), d...]
"""
assert len(tensors) == len(leave_lengths), f'{len(tensors)} != {len(leave_lengths)}'
agg_tensors = []
cur_len = 0
for i, (t, l) in enumerate(zip(tensors, leave_lengths)):
agg_tensors.append(cur_len + t)
cur_len += l
out = torch.cat(agg_tensors, 0)
if reverse:
out = torch.flip(out, [0])
return out
ntok = sum([len(x['leaves']) + len(x['nodes']) for x in examples])
leaves_list = [x['leaves'] for x in examples]
nodes_list = [x['nodes'] for x in examples]
pos_tags_list = [x['pos_tags'] for x in examples]
spans_list = [x['spans'] for x in examples]
leave_lens = [x.size(0) for x in leaves_list]
leaves = merge_seq(leaves_list, pad_idx=1, reverse=False)
pos_tags = merge_seq(pos_tags_list, pad_idx=1, reverse=False)
nodes = merge_seq(nodes_list, pad_idx=1, reverse=reverse_node)
spans = merge_indices(spans_list, leave_lens, pad_idx=0, reverse=reverse_node)
nsent = len(leave_lens)
examples_d = {
"leaves": leaves_list,
"nodes": nodes_list,
"pos_tags": pos_tags_list,
"spans": spans_list,
}
return examples_d, ntok, nsent
@staticmethod
def line2_all_tokens(s, remove_root=True, take_pos_tag=True, take_nodes=True, no_collapse=False, tolower=False):
token_list = []
strings = s.split(tree_builder.TreeBuilder.SENT_SPLITTER)
# print(f'line2_all_tokens: {remove_root}, {take_pos_tag}, {take_nodes}')
for s in strings:
try:
# leaves, pos_tags, nodes, spans = nstack_process.tree_string_to_leave_pos_node_span(
# s, remove_root=remove_root, take_pos_tag=take_pos_tag, take_nodes=take_nodes,
# no_collapse=no_collapse)
tokens = nstack_process.tree_string_to_symbols(
s,
remove_root=remove_root, take_pos_tag=take_pos_tag,
take_nodes=take_nodes,
no_collapse=no_collapse
)
except IndexError as e:
print(s)
raise e
except RecursionError as er:
print("Recursion error due to too long tree -> omit the tree")
continue
if tolower:
# leaves = ' '.join(leaves).lower().split()
# pos_tags = ' '.join(pos_tags).lower().split()
# nodes = ' '.join(nodes).lower().split()
tokens= ' '.join(tokens).lower().split()
# token_list += leaves
# if take_pos_tag:
# token_list += pos_tags
# if take_nodes:
# token_list += nodes
token_list += tokens
return token_list
@staticmethod
def acquire_vocab_multithread(
filename, vocab, tokenize=tokenize_line, num_workers=1,
add_single_thread=None, remove_root=True, take_pos_tag=True, take_nodes=True,
no_collapse=False,
tolower=False
):
def merge_result(counter):
for w, c in counter.items():
vocab.add_symbol(w, c)
if add_single_thread is None:
add_single_thread = NstackTreeTokenizer.add_to_vocab_single_thread
if num_workers > 1:
pool = Pool(processes=num_workers)
results = []
for worker_id in range(num_workers):
results.append(pool.apply_async(
add_single_thread,
(filename, tokenize, vocab.eos_word, worker_id, num_workers,
remove_root, take_pos_tag, take_nodes, no_collapse, tolower)
))
pool.close()
pool.join()
assert len(results) == num_workers, f'{len(results)} processes died!'
for r in results:
merge_result(r.get())
else:
merge_result(
NstackTreeTokenizer.add_to_vocab_single_thread(
filename, tokenize, vocab.eos_word,
remove_root=remove_root, take_pos_tag=take_pos_tag, take_nodes=take_nodes, no_collapse=no_collapse,
tolower=tolower))
@staticmethod
def add_to_vocab_single_thread(
filename, tokenize, eos_word, worker_id=0, num_workers=1,
remove_root=True, take_pos_tag=True, take_nodes=True, no_collapse=False, tolower=False):
counter = Counter()
with open(filename, 'r', encoding='utf-8') as f:
size = os.fstat(f.fileno()).st_size
chunk_size = size // num_workers
offset = worker_id * chunk_size
end = offset + chunk_size
f.seek(offset)
if offset > 0:
safe_readline(f) # drop first incomplete line
line = f.readline()
while line:
token_list = NstackTreeTokenizer.line2_all_tokens(
line, remove_root=remove_root, take_pos_tag=take_pos_tag, take_nodes=take_nodes,
no_collapse=no_collapse, tolower=tolower)
for word in token_list:
counter.update([word])
if f.tell() > end:
break
line = f.readline()
return counter