wsc273.py 6.77 KB
Newer Older
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
"""
The Winograd Schema Challenge
http://commonsensereasoning.org/2011/papers/Levesque.pdf

A Winograd schema is a pair of sentences that differ in only one or two words
and that contain an ambiguity that is resolved in opposite ways in the two
sentences and requires the use of world knowledge and reasoning for its resolution.
The Winograd Schema Challenge 273 is a collection of 273 such Winograd schemas.

NOTE: This evaluation of Winograd Schema Challenge is based on `partial evaluation`
as described by Trinh & Le in Simple Method for Commonsense Reasoning (2018).
See: https://arxiv.org/abs/1806.0

Homepage: https://cs.nyu.edu/~davise/papers/WinogradSchemas/WS.html

@inproceedings{ea01b9c0db064caca6986b925d75f2bb,
    title = "The winograd schema challenge",
    abstract = "In this paper, we present an alternative to the Turing Test that has some conceptual and practical advantages. A Wino-grad schema is a pair of sentences that differ only in one or two words and that contain a referential ambiguity that is resolved in opposite directions in the two sentences. We have compiled a collection of Winograd schemas, designed so that the correct answer is obvious to the human reader, but cannot easily be found using selectional restrictions or statistical techniques over text corpora. A contestant in the Winograd Schema Challenge is presented with a collection of one sentence from each pair, and required to achieve human-level accuracy in choosing the correct disambiguation.",
    author = "Levesque, {Hector J.} and Ernest Davis and Leora Morgenstern",
    year = "2012",
    language = "English (US)",
    isbn = "9781577355601",
    series = "Proceedings of the International Conference on Knowledge Representation and Reasoning",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    pages = "552--561",
    booktitle = "13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012",
    note = "13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012 ; Conference date: 10-06-2012 Through 14-06-2012",
}
"""
30
31
import numpy as np
import random
&'s avatar
& committed
32
33
from lm_eval.base import rf
from ..metrics import mean
34
35
36
37
from . common import HFTask


class WinogradSchemaChallenge273(HFTask):
Leo Gao's avatar
Leo Gao committed
38
    VERSION = 0
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
    DATASET_PATH = "winograd_wsc"
    DATASET_NAME = "wsc273"

    upper_pronouns = ["A", "An", "The", "She", "He",
                      "It", "They", "My", "His", "Her", "Their"]

    def __init__(self):
        super().__init__()
        self.data = self.__clean_data()

    def __clean_data(self):
        # The HF implementation of `wsc273` is not `partial evaluation` friendly.
        data = []
        for doc in self.data["test"]:
            doc["text"] = doc["text"].replace("  ", " ")
54
55
            doc["options"][0] = self.__normalize_option(doc, doc["options"][0])
            doc["options"][1] = self.__normalize_option(doc, doc["options"][1])
56
57
58
            data.append(doc)
        return {"test": data}

59
    def __normalize_option(self, doc, option):
60
        # Append `'s` to possessive determiner based options.
61
        if doc["pronoun"].lower() in ["my", "his", "her", "our", "their"]:
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
            option += "'s"
        # Appropriately lowercase the pronoun in the option.
        pronoun = option.split()[0]
        start_of_sentence = doc["text"][doc['pronoun_loc'] - 2] == '.'
        if not start_of_sentence and pronoun in self.upper_pronouns:
            return option.replace(pronoun, pronoun.lower())
        return option

    def has_training_docs(self):
        return False

    def has_validation_docs(self):
        return False

    def has_test_docs(self):
        return True

79
    def fewshot_examples(self, k, rnd):
80
81
        # NOTE: `super().fewshot_examples` samples from training docs which are
        # not available for this test-set-only dataset.
82
83
84
85
86

        if self._fewshot_docs is None:
            self._fewshot_docs = list(self.test_docs())

        return rnd.sample(list(self._fewshot_docs), k)
87

88
89
    def doc_to_text(self, doc):
        return self.partial_context(doc, doc["options"][doc["label"]])
90
91

    @classmethod
92
93
94
95
96
97
    def partial_context(cls, doc, option):
        # Substitute the pronoun in the original text with the specified
        # option and ignore everything after.
        return doc["text"][:doc["pronoun_loc"]] + option

    def doc_to_target(self, doc):
Leo Gao's avatar
Leo Gao committed
98
        return self.partial_target(doc)
99
100
101
102
103

    @classmethod
    def partial_target(cls, doc):
        # The target is everything after the document specified pronoun.
        start_index = doc["pronoun_loc"] + len(doc["pronoun"])
Leo Gao's avatar
Leo Gao committed
104
        return " " + doc["text"][start_index:].strip()
105
106

    def construct_requests(self, doc, ctx):
107
        """Uses RequestFactory to construct Requests and returns an iterable of
108
109
110
111
112
        Requests which will be sent to the LM.

        :param doc:
            The document as returned from training_docs, validation_docs, or test_docs.
        :param ctx: str
113
            The context string, generated by fewshot_context. This includes the natural
114
            language description, as well as the few shot examples, and the question
115
            part of the document for `doc`.
116
117
        """
        target = self.partial_target(doc)
118
        lls = []
119
120
121
        for option in doc["options"]:
            partial_ctx = self.partial_context(doc, option)
            full_ctx = self.append_context(ctx, partial_ctx)
122
123
            lls.append(rf.loglikelihood(full_ctx, target)[0])
        return lls
124
125
126

    @classmethod
    def append_context(cls, ctx, partial_ctx):
127
        ctx = ctx.split("\n\n")  # Each fewshot context is on its own new line.
128
129
        ctx.pop()  # Remove the correct context put in by `doc_to_text`.
        return "\n\n".join([*ctx, partial_ctx]) if ctx else partial_ctx
130
131

    def process_results(self, doc, results):
132
133
        """Take a single document and the LM results and evaluates, returning a
        dict where keys are the names of submetrics and values are the values of
134
135
136
137
138
139
140
141
142
143
144
145
146
147
        the metric for that one document

        :param doc:
            The document as returned from training_docs, validation_docs, or test_docs.
        :param results:
            The results of the requests created in construct_requests.
        """
        return {
            "acc": np.argmax(results) == doc["label"]
        }

    def aggregation(self):
        """
        :returns: {str: [float] -> float}
148
            A dictionary where keys are the names of submetrics and values are
149
150
151
152
153
154
155
156
157
            functions that aggregate a list of metrics
        """
        return {
            "acc": mean
        }

    def higher_is_better(self):
        """
        :returns: {str: bool}
158
            A dictionary where keys are the names of submetrics and values are
159
160
161
162
163
            whether a higher value of the submetric is better
        """
        return {
            "acc": True
        }