SOTAVerified

A Surprisingly Robust Trick for Winograd Schema Challenge

2019-05-15Code Available1· sign in to hype

Vid Kocijan, Ana-Maria Cretu, Oana-Maria Camburu, Yordan Yordanov, Thomas Lukasiewicz

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

The Winograd Schema Challenge (WSC) dataset WSC273 and its inference counterpart WNLI are popular benchmarks for natural language understanding and commonsense reasoning. In this paper, we show that the performance of three language models on WSC273 strongly improves when fine-tuned on a similar pronoun disambiguation problem dataset (denoted WSCR). We additionally generate a large unsupervised WSC-like dataset. By fine-tuning the BERT language model both on the introduced and on the WSCR dataset, we achieve overall accuracies of 72.5% and 74.7% on WSC273 and WNLI, improving the previous state-of-the-art solutions by 8.8% and 9.6%, respectively. Furthermore, our fine-tuned models are also consistently more robust on the "complex" subsets of WSC273, introduced by Trichelair et al. (2018).

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
Winograd Schema ChallengeBERTwiki 340M (fine-tuned on WSCR)Accuracy72.5Unverified
Winograd Schema ChallengeBERT-large 340M (fine-tuned on WSCR)Accuracy71.4Unverified
Winograd Schema ChallengeBERTwiki 340M (fine-tuned on half of WSCR)Accuracy70.3Unverified
Winograd Schema ChallengeBERT-base 110M (fine-tuned on WSCR)Accuracy62.3Unverified

Reproductions