mlsanityData to 14 Oct 2026

A Parallel-Hierarchical Model for Machine Comprehension on Sparse Data

arXiv 1603.08884 ↗First posted 29 Mar 2016cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

Understanding unstructured text is a major goal within natural language processing. Comprehension tests pose questions based on short text passages to evaluate such understanding. In this work, we investigate machine comprehension on the challenging it MCTest benchmark. Partly because of its limited size, prior work on it MCTest has focused mainly on engineering better features. We tackle the dataset with a neural approach, harnessing simple neural networks arranged in a parallel hierarchy. The parallel hierarchy enables our model to compare the passage, question, and answer from a variety of trainable perspectives, as opposed to using a manually designed, rigid feature set. Perspectives range from the word level to sentence fragments to sequences of sentences; the networks operate only on word-embedding representations of text. When trained with a methodology designed to help cope with limited training data, our Parallel-Hierarchical model sets a new state of the art for it MCTest, outperforming previous feature-engineered approaches slightly and previous neural approaches by a significant margin (over 15% absolute).

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Mar 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2016: 1; 2017: 0; 2018: 0; 2019: 0; 2020: 0; 2021: 0; 2022: 0; 2023: 0; 2024: 1.

2 papers.