2000 character limit reached
A Co-Matching Model for Multi-choice Reading Comprehension (1806.04068v1)
Published 11 Jun 2018 in cs.CL
Abstract: Multi-choice reading comprehension is a challenging task, which involves the matching between a passage and a question-answer pair. This paper proposes a new co-matching approach to this problem, which jointly models whether a passage can match both a question and a candidate answer. Experimental results on the RACE dataset demonstrate that our approach achieves state-of-the-art performance.
- Shuohang Wang (69 papers)
- Mo Yu (117 papers)
- Shiyu Chang (120 papers)
- Jing Jiang (192 papers)