Key points are not available for this paper at this time.
Machine comprehension of text is the overarching goal of a great deal of research in natural language processing. The Machine Comprehension Test In this paper we develop a lexical matching method that takes into account multiple context windows, question types and coreference resolution. We show that the proposed method outperforms the baseline of We hope that our approach will inform future work on this task. Furthermore, we argue that MC500 is harder than MC160 due to the way question answer pairs were created.
Smith et al. (Thu,) studied this question.