A Lightweight Method to Generate Unanswerable Questions in English

被引:0
作者
Gautam, Vagrant [1 ]
Zhang, Miaoran [1 ]
Klakow, Dietrich [1 ]
机构
[1] Saarland Univ, Saarland Informat Campus, Saarbrucken, Germany
来源
FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS - EMNLP 2023 | 2023年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
If a question cannot be answered with the available information, robust systems for question answering (QA) should know not to answer. One way to build QA models that do this is with additional training data comprised of unanswerable questions, created either by employing annotators or through automated methods for unanswerable question generation. To show that the model complexity of existing automated approaches is not justified, we examine a simpler data augmentation method for unanswerable question generation in English: performing antonym and entity swaps on answerable questions. Compared to the prior state-of-the-art, data generated with our training-free and lightweight strategy results in better models (+1.6 F1 points on SQuAD 2.0 data with BERT-large), and has higher human-judged relatedness and readability. We quantify the raw benefits of our approach compared to no augmentation across multiple encoder models, using different amounts of generated data, and also on TydiQA-MinSpan data (+9.3 F1 points with BERT-large). Our results establish swaps as a simple but strong baseline for future work.
引用
收藏
页码:7349 / 7360
页数:12
相关论文
共 37 条
  • [21] Lan Z., 2020, INT C LEARN REPR, DOI DOI 10.48550/ARXIV.1909.11942
  • [22] Liu DH, 2020, PROCEEDINGS OF THE 2020 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP), P5798
  • [23] Liu Y., 2019, INFORM SYST RES, DOI [DOI 10.48550/arXiv.1907.11692, 10.48550/arXiv.1907.11692, DOI 10.48550/ARXIV.1907.11692]
  • [24] Semi-supervised sequence tagging with bidirectional language models
    Peters, Matthew E.
    Ammar, Waleed
    Bhagavatula, Chandra
    Power, Russell
    [J]. PROCEEDINGS OF THE 55TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2017), VOL 1, 2017, : 1756 - 1765
  • [25] Radford A, 2019, OPENAI BLOG, V1, P9, DOI DOI 10.4018/978-1-5225-9348-5.CH006
  • [26] Rajpurkar P, 2018, PROCEEDINGS OF THE 56TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 2, P784
  • [27] Strubell E, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P3645
  • [28] Sugawara S, 2022, PROCEEDINGS OF THE 60TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2022), VOL 1: (LONG PAPERS), P6951
  • [29] Sulem E, 2021, FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2021, P4543
  • [30] Tan C, 2018, IEEE INT CONF CON AU, P857, DOI 10.1109/ICCA.2018.8444234