-
Notifications
You must be signed in to change notification settings - Fork 0
/
run_ans_extr.py
1684 lines (1490 loc) · 64 KB
/
run_ans_extr.py
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
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# coding=utf-8
# Copyright 2018 The Google AI Language Team Authors and The HugginFace Inc. team.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Run BERT on Answer Extraction MRC."""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import collections
import copy
import logging
import json
import math
import os
import random
import six
from tqdm import tqdm, trange
import pickle
import glob
import numpy as np
import torch
from torch.utils.data import TensorDataset, DataLoader, RandomSampler, SequentialSampler
from torch.utils.data.distributed import DistributedSampler
import arguments
import processor as dataset_processor
import tokenization
import output_ans_extr
from entity_anonymizer import anonymize_entity
from modeling import BertConfig, BertForQuestionAnswering
from optimization import BERTAdam
from input_ablation_ans_extr import generate_ablated_input, reconstruct_doc_tokens
from input_example import InputTokenizedAnswerExtractionExample, InputAnswerExtractionFeature
from vocabulary_selection import vocab_selection
import score_functions
dev_score_function = { # TODO
"hotpot": score_functions.HotpotQAEvaluator
}["hotpot"]('./data/hotpot/hotpot_dev_distractor_v1.json')
score_function = dev_score_function
logging.basicConfig(
format="%(asctime)s - %(levelname)s - %(name)s - %(message)s",
datefmt="%m/%d/%Y %H:%M:%S",
level=logging.INFO,
)
logger = logging.getLogger(__name__)
entity_set = set()
entity_cache = {}
def tokenize_with_positions(
doc_tokens, tokenizer, start_position=None, end_position=None
):
tok_to_orig_index = []
orig_to_tok_index = []
all_doc_tokens = []
for (i, token) in enumerate(doc_tokens):
orig_to_tok_index.append(len(all_doc_tokens))
sub_tokens = tokenizer.tokenize(token)
for sub_token in sub_tokens:
tok_to_orig_index.append(i)
all_doc_tokens.append(sub_token)
if not start_position or not end_position:
return all_doc_tokens, tok_to_orig_index
tok_start_position = orig_to_tok_index[start_position]
if end_position < len(doc_tokens) - 1:
tok_end_position = orig_to_tok_index[end_position + 1] - 1
else:
tok_end_position = len(all_doc_tokens) - 1
return all_doc_tokens, tok_start_position, tok_end_position, tok_to_orig_index
def generate_tokenized_examples(
examples,
input_ablation=None,
corenlp_cache=None,
tokenizer=None,
entity_anonymization=None,
):
"""
input: example given by dataset processor
output: example in which original doc/query tokens are not tokenized, just modified
to preserve the positions of answer span
"""
global entity_set
tokenized_examples = []
for ei, example in enumerate(tqdm(examples)):
ablation_info = ""
refer_to_orig_doc = False
doc_tokens = example.doc_tokens[:]
start_position, end_position = example.start_position, example.end_position
query_tokens = example.query_text
# standard setting
if entity_anonymization or example.input_ablation:
basic_higher_tokenizer = tokenization.BasicTokenizer(do_lower_case=False)
tok_doc_tokens, tok_to_orig_index = tokenize_with_positions(
doc_tokens, basic_higher_tokenizer
)
tok_query_tokens, query_tok_to_orig_index = tokenize_with_positions(
query_tokens.split(), basic_higher_tokenizer
)
query_tokens = query_tokens.split()
if entity_anonymization:
refer_to_orig_doc = True
anon_tags = None
add_inf = False
stemming = False
ent_anon_spec = entity_anonymization.split('_')
if len(ent_anon_spec) > 1:
anon_tags = ent_anon_spec[1]
if len(ent_anon_spec) == 3:
add_inf = ent_anon_spec[2] == 'inf'
stemming = ent_anon_spec[2] == 'stem'
if entity_anonymization.startswith("close"):
# use cache for each example.did (entity_cache)
# use different vocab for different question (query_anonym_dict)
anonym_dicts, entity_dict = anonymize_entity(
tok_doc_tokens,
tok_query_tokens,
entity_cache.get(example.did, None),
target_tags=anon_tags,
only_stem=stemming,
add_inflection=add_inf,
)
if example.did not in entity_cache:
entity_cache[example.did] = entity_dict
entity_set.update(list(anonym_dicts['doc'].values()))
entity_set.update(list(anonym_dicts['query'].values()))
elif entity_anonymization.startswith("open"):
anonym_dict, query_anonym_dict, update_entity_dict = anonymize_entity(
tok_doc_tokens,
tok_query_tokens,
entity_cache,
mode_open=True,
target_tags=entity_tags,
)
entity_cache.update(update_entity_dict)
doc_tokens = reconstruct_doc_tokens(
doc_tokens, anonym_dicts['doc'], tok_to_orig_index, tok_doc_tokens
)
query_tokens = reconstruct_doc_tokens(
example.query_text.split(),
anonym_dicts['query'],
query_tok_to_orig_index,
tok_query_tokens,
)
if example.input_ablation and example.input_ablation != "original":
if example.did == example.qid:
doc_cache = corenlp_cache[example.qid]["doc"]
else:
doc_cache = corenlp_cache[example.did]
answer_position = (start_position, end_position)
ablated_example = generate_ablated_input(
example.input_ablation,
doc_tokens,
answer_position,
tok_to_orig_index,
doc_cache,
corenlp_cache[example.qid],
)
doc_tokens = ablated_example.get("doc_tokens", doc_tokens)
query_tokens = ablated_example.get("query_tokens", query_tokens)
start_position = ablated_example.get("start_position", start_position)
end_position = ablated_example.get("end_position", end_position)
ablation_info = ablated_example.get(
"drop_dict", ablated_example.get("ablation_info", "")
)
refer_to_orig_doc = ablated_example.get("refer_to_orig_doc", False)
if ei < 10:
print(ablation_info)
# set 'is_impossible' to mix_input_ablation
# if input_ablation == 'mix_input_ablation':
# start_position = 0
# end_position = 0
# example.is_impossible = True
tokenized_examples.append(
InputTokenizedAnswerExtractionExample(
example.did,
example.qid,
doc_tokens,
query_tokens,
start_position,
end_position,
example.orig_answer_text,
ablation_info,
example.doc_tokens,
example.query_text,
example.orig_answer_texts,
example.is_impossible,
refer_to_orig_doc,
)
)
if entity_anonymization and tokenizer and len(entity_cache) > 0:
if entity_anonymization.startswith("open"):
entity_set.update(list(entity_cache.values()))
if len(entity_anonymization.split('_')) > 2:
if entity_anonymization.split('_')[2] == 'inf':
new_entity_set = []
for ent in entity_set:
if ' ' in ent:
new_entity_set.extend(ent.split())
else:
new_entity_set.append(ent)
entity_set = set(new_entity_set)
print("vocabulary updated")
print(sorted(entity_set))
tokenizer.vocab_update(sorted(entity_set))
return tokenized_examples
def convert_examples_to_features(
examples,
tokenizer,
max_seq_length,
doc_stride,
max_query_length,
is_training,
is_output_example=False,
# is_output_example=True,
ignore_out_of_span=False,
):
"""Loads a data file into a list of `InputBatch`s."""
unique_id = 1000000000
tokenize_fn = tokenizer.tokenize
features = []
for (example_index, example) in enumerate(
tqdm(examples) if is_output_example else examples
):
if type(example.query_tokens) == list:
query_tokens = [
t for token in example.query_tokens for t in tokenize_fn(token)
]
else:
query_tokens = tokenize_fn(example.query_tokens)
if len(query_tokens) > max_query_length:
query_tokens = query_tokens[0:max_query_length]
tok_to_orig_index = []
orig_to_tok_index = []
all_doc_tokens = []
for (i, token) in enumerate(example.doc_tokens):
orig_to_tok_index.append(len(all_doc_tokens))
sub_tokens = tokenize_fn(token)
for sub_token in sub_tokens:
tok_to_orig_index.append(i)
all_doc_tokens.append(sub_token)
tok_start_position = None
tok_end_position = None
if is_training and example.is_impossible:
tok_start_position = -1
tok_end_position = -1
if is_training and not example.is_impossible:
tok_start_position = orig_to_tok_index[example.start_position]
if example.end_position < len(example.doc_tokens) - 1:
tok_end_position = orig_to_tok_index[example.end_position + 1] - 1
else:
tok_end_position = len(all_doc_tokens) - 1
(tok_start_position, tok_end_position) = _improve_answer_span(
all_doc_tokens,
tok_start_position,
tok_end_position,
tokenize_fn,
example.orig_answer_text,
)
# The -3 accounts for [CLS], [SEP] and [SEP]
max_tokens_for_doc = max_seq_length - len(query_tokens) - 3
# We can have documents that are longer than the maximum sequence length.
# To deal with this we do a sliding window approach, where we take chunks
# of the up to our max length with a stride of `doc_stride`.
_DocSpan = collections.namedtuple( # pylint: disable=invalid-name
"DocSpan", ["start", "length"]
)
doc_spans = []
start_offset = 0
while start_offset < len(all_doc_tokens):
length = len(all_doc_tokens) - start_offset
if length > max_tokens_for_doc:
length = max_tokens_for_doc
doc_spans.append(_DocSpan(start=start_offset, length=length))
if start_offset + length == len(all_doc_tokens):
break
start_offset += min(length, doc_stride)
for (doc_span_index, doc_span) in enumerate(doc_spans):
tokens = []
token_to_orig_map = {}
token_is_max_context = {}
segment_ids = []
tokens.append("[CLS]")
segment_ids.append(0)
for token in query_tokens:
tokens.append(token)
segment_ids.append(0)
tokens.append("[SEP]")
segment_ids.append(0)
for i in range(doc_span.length):
split_token_index = doc_span.start + i
token_to_orig_map[len(tokens)] = tok_to_orig_index[split_token_index]
is_max_context = _check_is_max_context(
doc_spans, doc_span_index, split_token_index
)
token_is_max_context[len(tokens)] = is_max_context
tokens.append(all_doc_tokens[split_token_index])
segment_ids.append(1)
tokens.append("[SEP]")
segment_ids.append(1)
input_ids = tokenizer.convert_tokens_to_ids(tokens)
# The mask has 1 for real tokens and 0 for padding tokens. Only real
# tokens are attended to.
input_mask = [1] * len(input_ids)
# Zero-pad up to the sequence length.
while len(input_ids) < max_seq_length:
input_ids.append(0)
input_mask.append(0)
segment_ids.append(0)
assert len(input_ids) == max_seq_length
assert len(input_mask) == max_seq_length
assert len(segment_ids) == max_seq_length
start_position = None
end_position = None
if is_training and not example.is_impossible:
# For training, if our document chunk does not contain an annotation
# we throw it out, since there is nothing to predict.
doc_start = doc_span.start
doc_end = doc_span.start + doc_span.length - 1
out_of_span = False
if (
example.start_position < doc_start
or example.end_position < doc_start
or example.start_position > doc_end
or example.end_position > doc_end
):
out_of_span = True
if out_of_span:
start_position = 0
end_position = 0
if ignore_out_of_span:
continue
else:
doc_offset = len(query_tokens) + 2
start_position = tok_start_position - doc_start + doc_offset
end_position = tok_end_position - doc_start + doc_offset
if is_training and example.is_impossible:
start_position = 0
end_position = 0
if example_index < 5 and is_output_example:
logger.info("*** Example ***")
logger.info("unique_id: %s" % (unique_id))
logger.info("example_index: %s" % (example_index))
logger.info("doc_span_index: %s" % (doc_span_index))
logger.info("orig_doc_tokens %s" % ' '.join(example.orig_doc_tokens))
logger.info("query_text %s" % example.orig_query_tokens)
logger.info(
"tokens: %s"
% " ".join([tokenization.printable_text(x) for x in tokens])
)
logger.info(
"token_to_orig_map: %s"
% " ".join(
[
"%d:%d" % (x, y)
for (x, y) in six.iteritems(token_to_orig_map)
]
)
)
logger.info(
"token_is_max_context: %s"
% " ".join(
[
"%d:%s" % (x, y)
for (x, y) in six.iteritems(token_is_max_context)
]
)
)
logger.info("input_ids: %s" % " ".join([str(x) for x in input_ids]))
logger.info("input_mask: %s" % " ".join([str(x) for x in input_mask]))
logger.info("segment_ids: %s" % " ".join([str(x) for x in segment_ids]))
if is_training and not example.is_impossible:
answer_text = " ".join(tokens[start_position : (end_position + 1)])
logger.info("start_position: %d" % (start_position))
logger.info("end_position: %d" % (end_position))
logger.info(
"answer: %s" % (tokenization.printable_text(answer_text))
)
if is_training and example.is_impossible:
logger.info("impossible example")
features.append(
InputAnswerExtractionFeature(
unique_id=unique_id,
example_index=example_index,
doc_span_index=doc_span_index,
tokens=tokens,
token_to_orig_map=token_to_orig_map,
token_is_max_context=token_is_max_context,
input_ids=input_ids,
input_mask=input_mask,
segment_ids=segment_ids,
start_position=start_position,
end_position=end_position,
is_impossible=example.is_impossible,
)
)
unique_id += 1
return features
def _improve_answer_span(
doc_tokens, input_start, input_end, tokenize_fn, orig_answer_text
):
"""Returns tokenized answer spans that better match the annotated answer."""
# The SQuAD annotations are character based. We first project them to
# whitespace-tokenized words. But then after WordPiece tokenization, we can
# often find a "better match". For example:
#
# Question: What year was John Smith born?
# Context: The leader was John Smith (1895-1943).
# Answer: 1895
#
# The original whitespace-tokenized answer will be "(1895-1943).". However
# after tokenization, our tokens will be "( 1895 - 1943 ) .". So we can match
# the exact answer, 1895.
#
# However, this is not always possible. Consider the following:
#
# Question: What country is the top exporter of electornics?
# Context: The Japanese electronics industry is the lagest in the world.
# Answer: Japan
#
# In this case, the annotator chose "Japan" as a character sub-span of
# the word "Japanese". Since our WordPiece tokenizer does not split
# "Japanese", we just use "Japanese" as the annotation. This is fairly rare
# in SQuAD, but does happen.
tok_answer_text = " ".join(tokenize_fn(orig_answer_text))
for new_start in range(input_start, input_end + 1):
for new_end in range(input_end, new_start - 1, -1):
text_span = " ".join(doc_tokens[new_start : (new_end + 1)])
if text_span == tok_answer_text:
return (new_start, new_end)
return (input_start, input_end)
def _check_is_max_context(doc_spans, cur_span_index, position):
"""Check if this is the 'max context' doc span for the token."""
# Because of the sliding window approach taken to scoring documents, a single
# token can appear in multiple documents. E.g.
# Doc: the man went to the store and bought a gallon of milk
# Span A: the man went to the
# Span B: to the store and bought
# Span C: and bought a gallon of
# ...
#
# Now the word 'bought' will have two scores from spans B and C. We only
# want to consider the score with "maximum context", which we define as
# the *minimum* of its left and right context (the *sum* of left and
# right context will always be the same, of course).
#
# In the example the maximum context for 'bought' would be span C since
# it has 1 left context and 3 right context, while span B has 4 left context
# and 0 right context.
best_score = None
best_span_index = None
for (span_index, doc_span) in enumerate(doc_spans):
end = doc_span.start + doc_span.length - 1
if position < doc_span.start:
continue
if position > end:
continue
num_left_context = position - doc_span.start
num_right_context = end - position
score = min(num_left_context, num_right_context) + 0.01 * doc_span.length
if best_score is None or score > best_score:
best_score = score
best_span_index = span_index
return cur_span_index == best_span_index
RawResult = collections.namedtuple(
"RawResult", ["unique_id", "start_logits", "end_logits"]
)
def run_eval_model(model, eval_features, args, device, show_evaluating=False):
all_input_ids = torch.tensor([f.input_ids for f in eval_features], dtype=torch.long)
all_input_mask = torch.tensor(
[f.input_mask for f in eval_features], dtype=torch.long
)
all_segment_ids = torch.tensor(
[f.segment_ids for f in eval_features], dtype=torch.long
)
all_example_index = torch.arange(all_input_ids.size(0), dtype=torch.long)
eval_data = TensorDataset(
all_input_ids, all_input_mask, all_segment_ids, all_example_index
)
eval_sampler = SequentialSampler(eval_data)
eval_dataloader = DataLoader(
eval_data, sampler=eval_sampler, batch_size=args.eval_batch_size
)
if show_evaluating:
eval_dataloader = tqdm(eval_dataloader, desc="Evaluating")
all_results = []
for input_ids, input_mask, segment_ids, example_indices in eval_dataloader:
input_ids = input_ids.to(device)
input_mask = input_mask.to(device)
segment_ids = segment_ids.to(device)
with torch.no_grad():
batch_start_logits, batch_end_logits = model(
input_ids, segment_ids, input_mask
)
for i, example_index in enumerate(example_indices):
start_logits = batch_start_logits[i].detach().cpu().tolist()
end_logits = batch_end_logits[i].detach().cpu().tolist()
eval_feature = eval_features[example_index.item()]
unique_id = int(eval_feature.unique_id)
all_results.append(
RawResult(
unique_id=unique_id,
start_logits=start_logits,
end_logits=end_logits,
)
)
return all_results
# for debug or distractor_ablation
def get_predictions(model, examples, eval_features, args, device, show_tqdm=False, get_nbest=0):
all_results = run_eval_model(model, eval_features, args, device, show_tqdm)
# ref: function write_prediction
example_index_to_features = collections.defaultdict(list)
for feature in eval_features:
example_index_to_features[feature.example_index].append(feature)
unique_id_to_result = {result.unique_id: result for result in all_results}
# logits
answer_logits = []
for (example_index, example) in enumerate(examples):
features = example_index_to_features[example_index]
ans_logits = []
for (feature_index, feature) in enumerate(features):
result = unique_id_to_result[feature.unique_id]
if not 0 <= feature.start_position < len(result.start_logits):
continue
ans_start_logit = result.start_logits[feature.start_position]
if not 0 <= feature.end_position < len(result.end_logits):
continue
ans_end_logit = result.end_logits[feature.end_position]
ans_logits.append(ans_start_logit + ans_end_logit)
answer_logits.append(max(ans_logits))
# for example, feature in zip(examples, eval_features):
arg_nsdt = args.null_score_diff_threshold if args.allow_impossible else None
predictions = write_predictions(
examples,
eval_features,
all_results,
get_nbest or 20,
30,
True,
null_score_diff_threshold=arg_nsdt,
return_prediction=True if not get_nbest else False,
return_nbest=True if get_nbest else False,
)
return answer_logits, predictions
def write_predictions(
all_examples,
all_features,
all_results,
n_best_size,
max_answer_length,
do_lower_case,
output_prediction_file=None,
output_nbest_file=None,
output_null_log_odds_file=None,
null_score_diff_threshold=None,
verbose_logging=False,
return_prediction=False,
return_nbest=False,
):
"""Write final predictions to the json file."""
if output_prediction_file:
logger.info("Writing predictions to: %s" % (output_prediction_file))
if output_nbest_file:
logger.info("Writing nbest to: %s" % (output_nbest_file))
allow_impossible = null_score_diff_threshold is not None
example_index_to_features = collections.defaultdict(list)
for feature in all_features:
example_index_to_features[feature.example_index].append(feature)
unique_id_to_result = {}
for result in all_results:
unique_id_to_result[result.unique_id] = result
_PrelimPrediction = collections.namedtuple( # pylint: disable=invalid-name
"PrelimPrediction",
["feature_index", "start_index", "end_index", "start_logit", "end_logit"],
)
all_predictions = collections.OrderedDict()
all_nbest_json = collections.OrderedDict()
scores_diff_json = collections.OrderedDict()
for (example_index, example) in enumerate(all_examples):
features = example_index_to_features[example_index]
prelim_predictions = []
# keep track of the minimum score of null start+end of position 0
score_null = 1000000 # large and positive
min_null_feature_index = 0 # the paragraph slice with min mull score
null_start_logit = 0 # the start logit at the slice with min null score
null_end_logit = 0 # the end logit at the slice with min null score
for (feature_index, feature) in enumerate(features):
result = unique_id_to_result[feature.unique_id]
start_indexes = _get_best_indexes(result.start_logits, n_best_size)
end_indexes = _get_best_indexes(result.end_logits, n_best_size)
# if we could have irrelevant answers, get the min score of irrelevant
if allow_impossible: # should be args.allow_impossible
feature_null_score = result.start_logits[0] + result.end_logits[0]
if feature_null_score < score_null:
score_null = feature_null_score
min_null_feature_index = feature_index
null_start_logit = result.start_logits[0]
null_end_logit = result.end_logits[0]
for start_index in start_indexes:
for end_index in end_indexes:
# We could hypothetically create invalid predictions, e.g., predict
# that the start of the span is in the question. We throw out all
# invalid predictions.
if start_index >= len(feature.tokens):
continue
if end_index >= len(feature.tokens):
continue
if start_index not in feature.token_to_orig_map:
continue
if end_index not in feature.token_to_orig_map:
continue
if not feature.token_is_max_context.get(start_index, False):
continue
if end_index < start_index:
continue
length = end_index - start_index + 1
if length > max_answer_length:
continue
prelim_predictions.append(
_PrelimPrediction(
feature_index=feature_index,
start_index=start_index,
end_index=end_index,
start_logit=result.start_logits[start_index],
end_logit=result.end_logits[end_index],
)
)
if allow_impossible:
prelim_predictions.append(
_PrelimPrediction(
feature_index=min_null_feature_index,
start_index=0,
end_index=0,
start_logit=null_start_logit,
end_logit=null_end_logit,
)
)
prelim_predictions = sorted(
prelim_predictions,
key=lambda x: (x.start_logit + x.end_logit),
reverse=True,
)
_NbestPrediction = collections.namedtuple( # pylint: disable=invalid-name
"NbestPrediction",
[
"text",
"start_logit",
"end_logit",
"orig_start_position",
"orig_end_position",
],
)
seen_predictions = {}
nbest = []
for pred in prelim_predictions:
if len(nbest) >= n_best_size:
break
feature = features[pred.feature_index]
if pred.start_index > 0:
tok_tokens = feature.tokens[pred.start_index : (pred.end_index + 1)]
orig_doc_start = feature.token_to_orig_map[pred.start_index]
orig_doc_end = feature.token_to_orig_map[pred.end_index]
if example.refer_to_orig_doc:
orig_tokens = example.orig_doc_tokens[
orig_doc_start : (orig_doc_end + 1)
]
else:
orig_tokens = example.doc_tokens[
orig_doc_start : (orig_doc_end + 1)
]
tok_text = " ".join(tok_tokens)
# De-tokenize WordPieces that have been split off.
tok_text = tok_text.replace(" ##", "")
tok_text = tok_text.replace("##", "")
# Clean whitespace
tok_text = tok_text.strip()
tok_text = " ".join(tok_text.split())
orig_text = " ".join(orig_tokens)
final_text = get_final_text(
tok_text, orig_text, do_lower_case, verbose_logging
)
if final_text in seen_predictions:
continue
else:
orig_doc_start = -1
orig_doc_end = -1
final_text = ""
seen_predictions[final_text] = True
nbest.append(
_NbestPrediction(
text=final_text,
start_logit=pred.start_logit,
end_logit=pred.end_logit,
orig_start_position=orig_doc_start,
orig_end_position=orig_doc_end,
)
)
if allow_impossible and "" not in seen_predictions:
nbest.append(
_NbestPrediction(
text="",
start_logit=null_start_logit,
end_logit=null_end_logit,
orig_start_position=-1,
orig_end_position=-1,
)
)
seen_predictions[""] = True
if not nbest or (
allow_impossible and "" in seen_predictions and len(nbest) == 1
):
nbest.append(
_NbestPrediction(
text="empty",
start_logit=0.0,
end_logit=0.0,
orig_start_position=-1,
orig_end_position=-1,
)
)
assert len(nbest) >= 1
total_scores = []
best_non_null_entry = None
for entry in nbest:
total_scores.append(entry.start_logit + entry.end_logit)
if not best_non_null_entry:
if entry.text:
best_non_null_entry = entry
probs = _compute_softmax(total_scores)
nbest_json = []
for (i, entry) in enumerate(nbest):
output = collections.OrderedDict()
output["text"] = entry.text
output["probability"] = probs[i]
output["start_logit"] = entry.start_logit
output["end_logit"] = entry.end_logit
output["orig_start_position"] = entry.orig_start_position
output["orig_end_position"] = entry.orig_end_position
nbest_json.append(output)
assert len(nbest_json) >= 1
if not allow_impossible:
all_predictions[example.qid] = nbest_json[0]["text"]
else:
# predict "" iff the null score - the score of best non-null > threshold
score_diff = (
score_null
- best_non_null_entry.start_logit
- (best_non_null_entry.end_logit)
)
scores_diff_json[example.qid] = score_diff
if score_diff > null_score_diff_threshold:
all_predictions[example.qid] = ""
else:
all_predictions[example.qid] = best_non_null_entry.text
all_nbest_json[example.qid] = nbest_json
if output_prediction_file:
with open(output_prediction_file, "w") as writer:
writer.write(json.dumps(all_predictions, indent=4) + "\n")
# if output_nbest_file:
# with open(output_nbest_file, "w") as writer:
# writer.write(json.dumps(all_nbest_json, indent=4) + "\n")
if output_null_log_odds_file:
with open(output_null_log_odds_file, "w") as writer:
writer.write(json.dumps(scores_diff_json, indent=4) + "\n")
if return_prediction:
return [all_nbest_json[ex.qid][0] for ex in all_examples]
if return_nbest:
return [all_nbest_json[ex.qid] for ex in all_examples]
def get_final_text(pred_text, orig_text, do_lower_case, verbose_logging=False):
"""Project the tokenized prediction back to the original text."""
# When we created the data, we kept track of the alignment between original
# (whitespace tokenized) tokens and our WordPiece tokenized tokens. So
# now `orig_text` contains the span of our original text corresponding to the
# span that we predicted.
#
# However, `orig_text` may contain extra characters that we don't want in
# our prediction.
#
# For example, let's say:
# pred_text = steve smith
# orig_text = Steve Smith's
#
# We don't want to return `orig_text` because it contains the extra "'s".
#
# We don't want to return `pred_text` because it's already been normalized
# (the SQuAD eval script also does punctuation stripping/lower casing but
# our tokenizer does additional normalization like stripping accent
# characters).
#
# What we really want to return is "Steve Smith".
#
# Therefore, we have to apply a semi-complicated alignment heruistic between
# `pred_text` and `orig_text` to get a character-to-charcter alignment. This
# can fail in certain cases in which case we just return `orig_text`.
def _strip_spaces(text):
ns_chars = []
ns_to_s_map = collections.OrderedDict()
for (i, c) in enumerate(text):
if c == " ":
continue
ns_to_s_map[len(ns_chars)] = i
ns_chars.append(c)
ns_text = "".join(ns_chars)
return (ns_text, ns_to_s_map)
# We first tokenize `orig_text`, strip whitespace from the result
# and `pred_text`, and check if they are the same length. If they are
# NOT the same length, the heuristic has failed. If they are the same
# length, we assume the characters are one-to-one aligned.
tokenizer = tokenization.BasicTokenizer(do_lower_case=do_lower_case)
tok_text = " ".join(tokenizer.tokenize(orig_text))
start_position = tok_text.find(pred_text)
if start_position == -1:
if verbose_logging:
logger.info("Unable to find text: '%s' in '%s'" % (pred_text, orig_text))
return orig_text
end_position = start_position + len(pred_text) - 1
(orig_ns_text, orig_ns_to_s_map) = _strip_spaces(orig_text)
(tok_ns_text, tok_ns_to_s_map) = _strip_spaces(tok_text)
if len(orig_ns_text) != len(tok_ns_text):
if verbose_logging:
logger.info(
"Length not equal after stripping spaces: '%s' vs '%s'",
orig_ns_text,
tok_ns_text,
)
return orig_text
# We then project the characters in `pred_text` back to `orig_text` using
# the character-to-character alignment.
tok_s_to_ns_map = {}
for (i, tok_index) in six.iteritems(tok_ns_to_s_map):
tok_s_to_ns_map[tok_index] = i
orig_start_position = None
if start_position in tok_s_to_ns_map:
ns_start_position = tok_s_to_ns_map[start_position]
if ns_start_position in orig_ns_to_s_map:
orig_start_position = orig_ns_to_s_map[ns_start_position]
if orig_start_position is None:
if verbose_logging:
logger.info("Couldn't map start position")
return orig_text
orig_end_position = None
if end_position in tok_s_to_ns_map:
ns_end_position = tok_s_to_ns_map[end_position]
if ns_end_position in orig_ns_to_s_map:
orig_end_position = orig_ns_to_s_map[ns_end_position]
if orig_end_position is None:
if verbose_logging:
logger.info("Couldn't map end position")
return orig_text
output_text = orig_text[orig_start_position : (orig_end_position + 1)]
return output_text
def _get_best_indexes(logits, n_best_size):
"""Get the n-best logits from a list."""
index_and_score = sorted(enumerate(logits), key=lambda x: x[1], reverse=True)
best_indexes = []
for i in range(len(index_and_score)):
if i >= n_best_size:
break
best_indexes.append(index_and_score[i][0])
return best_indexes
def _compute_softmax(scores):
"""Compute softmax probability over raw logits."""
if not scores:
return []
max_score = None
for score in scores:
if max_score is None or score > max_score:
max_score = score
exp_scores = []
total_sum = 0.0
for score in scores:
x = math.exp(score - max_score)
exp_scores.append(x)
total_sum += x