-
Notifications
You must be signed in to change notification settings - Fork 0
/
tapk.py
executable file
·619 lines (538 loc) · 20.6 KB
/
tapk.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
#!/usr/bin/env python3
# coding: utf8
# Author: Lenz Furrer, 2016--2018
"""
Compute Threshold Average Precision at (a median of) k errors per query.
"""
__version__ = '1.0'
import re as _re
import sys as _sys
import math as _math
import itertools as _it
import numbers as _numbers
import argparse as _argparse
from collections import namedtuple as _namedtuple
# Constants.
ASC = 'asc'
DESC = 'desc'
# Defaults.
QUANTILE = 0.5 # median
SUMMARY_FMT_E0 = 'Threshold\t{u} mean TAP\n{e0}\t{tap:.4f}'
SUMMARY_FMT_K = ('EPQ (threshold at {q} quantile)\t{u} mean TAP\n'
'{k} ({e0})\t{tap:.4f}')
QUERY_FMT = '{query} ({weight:g})\t{tap:.4f}'
QUERY_FMT_UNW = '{query}\t{tap:.4f}'
def main():
"""
Run from commandline.
"""
ap = _argparse.ArgumentParser(description=__doc__)
inparams = ap.add_argument_group('input')
inparams.add_argument(
'-i', '--retrieval-lists',
dest='infiles', nargs='+', default=['-'], metavar='PATH',
help='one or more input files (UTF-8) containing retrieval lists '
'(default: STDIN)')
procparams = ap.add_argument_group('parameters')
eparam = procparams.add_mutually_exclusive_group(required=True)
eparam.add_argument(
'-k', type=_posint, metavar='N', nargs='+',
help='number of errors per query for calculating E0')
eparam.add_argument(
'-t', dest='e0', type=float, metavar='F', nargs='+',
help='threshold score or E value (bypass `k`)')
procparams.add_argument(
'-m', '--monotonicity', choices=(ASC, DESC),
help='descending scores or ascending E values? '
'(default: the lists determine)')
procparams.add_argument(
'-q', '--quantile', type=_zerotoone, default=QUANTILE, metavar='F',
help='quantile q, 0.0 < q <= 1.0 '
'(default: the median, 0.5)')
procparams.add_argument(
'-u', '--unweighted', action='store_true',
help='ignore all weights, to perform an unweighted calculation')
procparams.add_argument(
'-p', '--pad-insufficient', action='store_true',
help='pad insufficient retrieval lists with irrelevant records')
outparams = ap.add_argument_group('output formatting')
outparams.add_argument(
'-s', '--summary-only', action='store_false',
dest='show_query_wise_result',
help='suppress query-wise results')
outparams.add_argument(
'-f', '--summary-format', metavar='FMT', type=_unescape_backslashes,
help='format string for the result summary. '
'Available fields: k, e0, tap, q[uantile], u[nweighted]')
outparams.add_argument(
'-Q', '--query-format', metavar='FMT', type=_unescape_backslashes,
help='format string for a separate result line per query. '
'Available fields: query, tap, weight, T_q '
'(default: {!r} for weighted, {!r} for unweighted TAP)'
''.format(QUERY_FMT, QUERY_FMT_UNW))
ap.add_argument(
'-V', '--version', action='version',
version='TAP-k {}'.format(__version__))
args = ap.parse_args()
try:
run(output=_sys.stdout, **vars(args))
except InputError as e:
ap.exit(str(e)) # no usage message
except BrokenPipeError:
# Die silently when the output is truncated by Unix head or less.
pass
def tapk(infiles, **params):
"""
Compute TAP-k for one value of k or E0.
Args:
infiles (iterable of sources): retrieval lists
(source can be a path or any line iterator)
e0 (float): predetermined threshold
(required if k is not specified)
k (float): number of errors for determining E0
(ignored if e0 is given)
monotonicity (str): scores or E-values?
(value must be "asc", "desc", or None)
quantile (float): how many lists should have at
most k errors? (ignored if e0 is given)
unweighted (bool): same weight for all retrieval
lists
pad_insufficient (bool): pad insufficient retrieval
lists with irrelevant records
Returns:
results: a namedtuple with overall TAP and detailed
scores for all queries
"""
name, value, params = _prepare(infiles, **params)
params[name] = value
return evaluate(**params)
def run(infiles, **params):
"""
Produce formatted output for one or more values of k/E0.
"""
name, values, params = _prepare(infiles, **params)
# Iterate over multiple values of E0 or k, depending on what is given.
if isinstance(values, _numbers.Number):
values = (values,)
for v in values:
params[name] = v
_run_one(**params)
def _prepare(infiles, **params):
params = _short_options(**params)
return _read_input(infiles, **params)
def _short_options(t=None, m=None, q=QUANTILE, u=False, p=False, **params):
# Accept the short-option letters from the CLI.
params.setdefault('e0', t)
params.setdefault('monotonicity', m)
params.setdefault('quantile', q)
params.setdefault('unweighted', u)
params.setdefault('pad_insufficient', p)
return params
def _read_input(infiles, e0, k=None, unweighted=False, monotonicity=None,
**params):
# Determine the main parameter.
if e0 is not None:
name, value = 'e0', e0
elif k is not None:
name, value = 'k', k
else:
raise ValueError('either k or e0 must be specified')
# Parse and sanity-check the retrieval lists.
retlists = [rl for src in infiles for rl in parserecords(src, unweighted)]
monotonicity = _sanity_check(retlists, monotonicity)
params.update(retlists=retlists, ascending=monotonicity == ASC)
return name, value, params
def _run_one(quantile=QUANTILE, output=_sys.stdout, show_query_wise_result=False,
summary_format=None, query_format=None, **params):
"""
Evaluate and output TAP for one value of k or E0.
"""
# Result computation.
result = evaluate(quantile=quantile, **params)
# Output formatting.
unweighted = all(r.weight == 1.0 for r in result.queries)
params.update(
tap=result.tap, k=result.k, e0=result.e0, q=quantile,
u='unweighted' if unweighted else 'weighted')
# Summary.
if summary_format is None:
summary_format = SUMMARY_FMT_E0 if result.k is None else SUMMARY_FMT_K
print(summary_format.format_map(params), file=output)
# Query-wise results.
if show_query_wise_result:
if query_format is None:
query_format = QUERY_FMT_UNW if unweighted else QUERY_FMT
print('\nIndividual results for each query:', file=output)
for query in result.queries:
print(query_format.format_map(query._asdict()), file=output)
print(file=output)
def evaluate(retlists, quantile=QUANTILE, e0=None, pad_insufficient=False,
**params):
"""
Calculate TAP-k for multiple queries.
"""
if e0 is None:
e0 = _determine_E0(retlists, quantile=quantile,
pad_insufficient=pad_insufficient, **params)
return _evaluate_e0(retlists, e0, **params)
def _evaluate_e0(retlists, e0, ascending, k=None):
"""
Calculate TAP for a given threshold, for multiple queries.
"""
if ascending:
def past_E0(score):
'E value is beyond E0.'
return score > e0
else:
def past_E0(score):
'Threshold score is beyond E0.'
return score < e0
e0_nan = _math.isnan(e0)
results = [QueryResult(r.query, tap(r, past_E0, e0_nan), r.weight, r.T_q)
for r in retlists]
avg_tap = (sum(r.tap * r.weight for r in results) /
sum(r.weight for r in results))
return Result(avg_tap, k, e0, results)
Result = _namedtuple('Result', 'tap k e0 queries')
QueryResult = _namedtuple('QueryResult', 'query tap weight T_q')
def tap(records, past_E0, e0_nan):
"""
Threshold average precision for one query.
"""
summed_precision = 0.0
rel_count = 0 # number of relevant records seen so far
retrieved = 0 # number of records considered
for relevance, score in records:
if past_E0(score):
# Exit the loop without updating the retrieved count.
break
retrieved += 1
# Sum precision value at each relevant record.
if relevance:
rel_count += 1
summed_precision += rel_count / retrieved
if not records.T_q:
# No ground-truth targets: Retrieving nothing is the right thing to do.
summed_precision = 1.0 / (retrieved + 1)
elif retrieved and not e0_nan:
# The sentinel needs to be added to the average
# (a second time if the last retrieved record was relevant), unless
# - there were no records at all, in which case the summed
# precision is 0 by definition, or
# - E0 is NaN as a result of truncated retrieval lists in
# combination with the --pad-insufficient option.
summed_precision += rel_count / retrieved
# Divide by the total number of relevant records,
# plus one for the sentinel.
return summed_precision / (records.T_q + 1)
def _determine_E0(retlists, k, quantile, ascending, pad_insufficient):
"""
Determine E_k(A) based on the retrieved records.
Args:
retlists (iterable of iterable of (bool, float)):
the records for each query, consisting of
pairs <relevance label, E value>
k (int): number of errors per query at quantile
quantile (float): between 0 and 1; eg. 0.5 for
median
ascending (bool): True if the E values increase
from best to worst.
"""
# Collect the E value at k errors for each query.
E_k = []
total_weights = 0.0
for records in retlists:
total_weights += records.weight
errors = 0
for relevance, score in records:
if not relevance:
errors += 1
if errors >= k:
E_k.append((score, records.weight))
break
# If the inner loop ends without a break, then there are
# less than k errors in this query.
# In this case E0 could be arbitrarily generous without introducing
# more than k errors, which is equivalent to placing it at the end
# of the sorted list.
# However, the quantile calculation walks from the start, so we can
# simply skip those.
# Sort the scores from best to worst.
E_k.sort(reverse=not ascending)
try:
E0 = _weighted_quantile(E_k, quantile, total_weights)
except InputError:
# E0 can't be determined.
if pad_insufficient:
# Compute TAP of the complete retrieval lists (no cutoff at E0).
E0 = _math.nan
else:
# Re-raise with a proper message (the callee didn't have all info).
raise InputError(
'Fewer than {} of the retrieval lists have {} errors.'
.format(quantile, k))
return E0
def _weighted_quantile(weighted_scores, quantile, total_weights):
"""
Walk through the sorted scores until quantile is reached.
"""
quantile *= total_weights # spread q to the absolute weight scale
quantile *= 1.0 - 1e-12 # don't miss it because of imprecision
summed_weight = 0.0
for s, w in weighted_scores:
summed_weight += w
if summed_weight >= quantile:
return s
# If we get here, then we fell off the end of the list --
# there are not enough retrieval lists with k errors.
raise InputError # construct the message in the caller
def _sanity_check(retlists, monotonicity):
"""
Thoroughly check the retrieval lists and determine monotonicity.
Any failure raises an InputError.
On success, return the monotonicity (ASC or DESC).
Check the following:
- at least 1 retrieval list given
- number of relevant records is less than or euqal to T_q
- monotonicity
* is determined (either through -m or the data)
* is given in each list
* is consistent among all lists
* if given through -m, is consistent with the data
"""
if not retlists:
raise InputError('no retrieval list found')
for records in retlists:
records.check_rel_count()
monotonicity = records.check_monotonicity(monotonicity)
if monotonicity is None:
raise InputError(
'Every retrieval list was empty or repeated the same score or '
'E-value,\nin which case you must specify through the -m/'
'--monotonicity option\n'
'whether the lists are ascending or descending.')
return monotonicity
def parserecords(source, unweighted=False):
"""
Iterate over _RetrievalList instances parsed from plain-text.
"""
lines = enumerate(map(str.strip, _smartopen(source)), 1)
hunks = _it.groupby(lines, key=lambda l: bool(l[1]))
for non_blank, hunk in hunks:
if non_blank:
yield _RetrievalList.from_lines(source, hunk, unweighted)
def _smartopen(source):
"""
Open file if necessary and iterate over its lines.
"""
if source == '-':
# STDIN.
yield from _sys.stdin
elif isinstance(source, str):
# File name.
with open(source, encoding='utf8') as f:
yield from f
else:
# Anything else: try to iterate over.
yield from source
class _RetrievalList:
"""
A list of rated records and some metadata.
"""
__slots__ = ('source', 'query', 'weight', 'T_q', 'records')
def __init__(self, source, query, T_q, records, weight=1.0):
self.source = source
self.query = query
self.weight = weight
self.T_q = T_q
self.records = records
@classmethod
def from_lines(cls, src, lines, unweighted=False, enumerated=True):
"""
Constructor for incremental building through parsing.
"""
if not enumerated:
lines = enumerate(lines)
query, T_q, weight = cls._parse_headers(src, lines, unweighted)
records = [cls._parse_rel_score_line(src, l, i) for i, l in lines]
return cls(src, query, T_q, records, weight)
@classmethod
def _parse_headers(cls, src, lines, unweighted=False):
"""
Parse the header lines and be specific about any failure.
"""
# First line: query name and optional weight.
no, line1 = next(lines)
try:
query, weight = line1.split()
except ValueError as e:
if str(e).startswith('too many values'):
raise InputFormatError(
'The line for a unique identifier '
'should have at most 2 columns.', src, no, line1)
# If the weight was missing, it defaults to 1.
query = line1.strip()
weight = 1.0
else:
try:
weight = float(weight)
if weight <= 0:
raise ValueError()
except ValueError:
raise InputFormatError(
'Column 2 in the line for a unique identifier '
'should be a positive weight.', src, no, line1)
# Override any given weight if flagged for disabling.
if unweighted:
weight = 1.0
# Second line: number of records relevant for this query.
try:
no, line2 = next(lines)
T_q = int(line2)
if T_q < 0:
raise ValueError()
except StopIteration:
raise InputValueError('Unexpected end of file', src, query)
except ValueError:
raise InputFormatError(
'The line containing the number of relevant records '
'should be a non-negative integer', src, no, line2)
return query, T_q, weight
@staticmethod
def _parse_rel_score_line(src, line, no):
"""Get relevance and score for one input record."""
try:
relevance, score, *_ = line.split()
if relevance not in ('0', '1'):
raise ValueError()
score = float(score)
except ValueError:
raise InputFormatError(
'Column 1 should have shown record relevancy as 0 or 1.\n'
'Column 2 should have shown the record score as a float.',
src, no, line)
return bool(int(relevance)), score
def check_rel_count(self):
"""
The number of records marked as relevant must not exceed T_q.
"""
total = sum(rel for rel, _ in self)
if total > self.T_q:
raise InputValueError(
'too many records marked as relevant (found {}, T_q = {})'
.format(total, self.T_q),
self.source, self.query)
def check_monotonicity(self, given):
"""
Check and (if necessary) determine monotonicity.
"""
found = None
for a, b in self._score_bigrams():
found = self._monotonicity(a, b)
if found is None:
continue
elif given is None:
given = found
elif found != given:
raise InputValueError(
'monotonicity violation (given {}, found {})'
.format(given, found),
self.source, self.query)
return found or given
def _score_bigrams(self):
if len(self) < 2:
# Short-circuit for insufficient lists.
return
i = (score for _, score in self)
first = next(i)
for second in i:
yield first, second
first = second
@staticmethod
def _monotonicity(a, b):
if a < b:
return ASC
elif a > b:
return DESC
else:
return None
def __iter__(self):
return iter(self.records)
def __len__(self):
return len(self.records)
class InputError(Exception):
"""Unspecific input-related problem."""
class _LocatableInputError(InputError):
"""Base class for errors with a specific source."""
def __init__(self, message, source, *args):
if not isinstance(source, str):
# Limit source description to 99 characters.
source = repr(source)
if len(source) >= 100:
source = '{}...{}'.format(source[:48], source[-48:])
super().__init__(message, source, *args)
self.source = source
self.message = message
class InputFormatError(_LocatableInputError):
"""Input text could not be parsed."""
def __init__(self, message, source, line_number, line):
super().__init__(message, source, line_number, line)
self.line_number = line_number
self.line = line
def __str__(self):
location = ('Offending input file: {}, line: {}'
.format(self.source, self.line_number))
return '\n'.join((self.message, location, self.line))
class InputValueError(_LocatableInputError):
"""Input is incomplete or inconsistent."""
def __init__(self, message, source, query):
super().__init__(message, source, query)
self.query = query
def __str__(self):
return ('File {}, query {}: {}'
.format(self.source, self.query, self.message))
def _posint(expr):
"""
Make sure expr is a positive integer.
"""
try:
k = int(expr)
except ValueError:
raise _argparse.ArgumentTypeError(
'cannot parse as integer: {}'.format(expr))
if k <= 0:
raise _argparse.ArgumentTypeError(
'{} is not a positive integer'.format(expr))
return k
def _zerotoone(expr):
"""
Make sure expr is a float in the interval ]0..1].
"""
try:
q = float(expr)
except ValueError:
raise _argparse.ArgumentTypeError(
'cannot parse as float: {}'.format(expr))
if not 0 < q <= 1:
raise _argparse.ArgumentTypeError(
'violation of 0 < q <= 1 (given: {})'.format(expr))
return q
def _unescape_backslashes(expr):
r"""
Process a few backslash sequences.
Replace \t, \n, and \r in format strings
with the actual tab/newline characters,
unless preceded by another backslash.
"""
mapping = {r'\t': '\t', r'\n': '\n', r'\r': '\r'}
def map_(match):
'Map the sequence to its character.'
return mapping[match.group()]
expr = _re.sub(r'''(?<!\\) # negative lookbehind: no preceding backslash
\\[tnr] # escaped tab, LF, or CR''',
map_, expr, flags=_re.VERBOSE)
# Unescape backslashes.
expr = expr.replace('\\\\', '\\')
return expr
if __name__ == '__main__':
main()