mlsanityData to 7 Oct 2026

Context-guided Triple Matching for Multiple Choice Question Answering

arXiv 2109.12996 ↗First posted 27 Sep 2021cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

The task of multiple choice question answering (MCQA) refers to identifying a suitable answer from multiple candidates, by estimating the matching score among the triple of the passage, question and answer. Despite the general research interest in this regard, existing methods decouple the process into several pair-wise or dual matching steps, that limited the ability of assessing cases with multiple evidence sentences. To alleviate this issue, this paper introduces a novel Context-guided Triple Matching algorithm, which is achieved by integrating a Triple Matching (TM) module and a Contrastive Regularization (CR). The former is designed to enumerate one component from the triple as the background context, and estimate its semantic matching with the other two. Additionally, the contrastive term is further proposed to capture the dissimilarity between the correct answer and distractive ones. We validate the proposed algorithm on several benchmarking MCQA datasets, which exhibits competitive performances against state-of-the-arts.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 25 references that are in the map. First posted on arXiv 27 Sep 2021.

Builds on

18 of 25 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
  4. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  5. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  6. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
  7. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  8. 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 832
  9. 2021R-Drop: Regularized Dropout for Neural Networkscited by 202
  10. 2018Open Domain Question Answering Using Early Fusion of Knowledge Bases and Textcited by 167
  11. 2019DREAM: A Challenge Dataset and Models for Dialogue-Based Reading Comprehensioncited by 156
  12. 2019SG-Net: Syntax-Guided Machine Reading Comprehensioncited by 52
6 more
  1. 2020Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphscited by 30
  2. 2019Dual Co-Matching Network for Multi-choice Reading Comprehensioncited by 26
  3. 2019MMM: Multi-stage Multi-task Learning for Multi-choice Reading Comprehensioncited by 20
  4. 2018A Co-Matching Model for Multi-choice Reading Comprehensioncited by 13
  5. 2020Context-Aware Answer Extraction in Question Answeringcited by 13
  6. 2020DUMA: Reading Comprehension with Transposition Thinkingcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.