Papers › Machine Comprehension Using Match-LSTM and Answer Pointer
Machine Comprehension Using Match-LSTM and Answer Pointer
Shuohang Wang, Jing Jiang
Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans through crowdsourcing. SQuAD provides a challenging testbed for evaluating machine comprehension algorithms, partly because compared with previous datasets, in SQuAD the answers do not come from a small set of candidate answers and they have variable lengths. We propose an end-to-end neural architecture for the task. The architecture is based on match-LSTM, a model we proposed previously for textual entailment, and Pointer Net, a sequence-to-sequence model proposed by Vinyals et al.(2015) to constrain the output tokens to be from the input sequences. We propose two ways of using Pointer Net for our task. Our experiments show that both of our two models substantially outperform the best results obtained by Rajpurkar et al.(2016) using logistic regression and manually crafted features.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1608.07905")
Code
Syntology Ran 3 of 3 code samples harvested from 0 repositories linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · violated contract; 1 ran · our draft was wrong.
By repository: 3 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
3 samples harvested; 3 ran; 1 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 3 of the 3 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
f6c275d6a18330a9 · report
2112c433b9c6d343 · report
c6a80c065d2e4851 · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Boundary) (ensemble) | EM | 67.901 | #171 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Boundary) (ensemble) | F1 | 77.022 | #171 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Bi-Ans-Ptr (Boundary) | EM | 64.744 | #181 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Bi-Ans-Ptr (Boundary) | F1 | 73.743 | #181 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Boundary) | EM | 60.474 | #191 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Boundary) | F1 | 70.695 | #191 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Sentence) | EM | 54.505 | #195 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 | Match-LSTM with Ans-Ptr (Sentence) | F1 | 67.748 | #195 of 213 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 dev | Match-LSTM with Bi-Ans-Ptr (Boundary+Search+b) | EM | 64.1 | #47 of 55 | Archive leaderboard | report |
| Question Answering | SQuAD1.1 dev | Match-LSTM with Bi-Ans-Ptr (Boundary+Search+b) | F1 | 64.7 | #47 of 55 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections