Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dual Co-Matching Network for Multi-choice Reading Comprehension (1901.09381v2)

Published 27 Jan 2019 in cs.CL

Abstract: Multi-choice reading comprehension is a challenging task that requires complex reasoning procedure. Given passage and question, a correct answer need to be selected from a set of candidate answers. In this paper, we propose \textbf{D}ual \textbf{C}o-\textbf{M}atching \textbf{N}etwork (\textbf{DCMN}) which model the relationship among passage, question and answer bidirectionally. Different from existing approaches which only calculate question-aware or option-aware passage representation, we calculate passage-aware question representation and passage-aware answer representation at the same time. To demonstrate the effectiveness of our model, we evaluate our model on a large-scale multiple choice machine reading comprehension dataset (i.e. RACE). Experimental result show that our proposed model achieves new state-of-the-art results.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Shuailiang Zhang (6 papers)
  2. Hai Zhao (227 papers)
  3. Yuwei Wu (66 papers)
  4. Zhuosheng Zhang (125 papers)
  5. Xi Zhou (43 papers)
  6. Xiang Zhou (164 papers)
Citations (128)