Ming-Wei Chang, Michael Collins, Kenton Lee, Tom Kwiatkowski, Kristina Toutanova, Christopher Clark
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper we study yes/no questions that are naturally occurring -meaning that they are generated in unprompted and unconstrained settings. We build a reading comprehension dataset, BoolQ, of such questions, and show that they are unexpectedly challenging. They often query for complex, non-factoid information, and require difficult entailment-like inference to solve. We also explore the effectiveness of a range of transfer learning baselines. We find that transferring from entailment data is more effective than transferring from paraphrase or extractive QA data, and that it, surprisingly, continues to be very beneficial even when starting from massive pre-trained language models such as BERT. Our best method trains BERT on MultiNLI and then re-trains it on our train set. It achieves 80.4% accuracy compared to 90% accuracy of human annotators (and 62% majority-baseline), leaving a significant gap for future work.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1905.10044")
get_code_for_paper("1905.10044")
have("1905.10044")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1905.10044.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1905.10044)
Connect an agent — have() is free.