Methods › Natural Language Processing › Reading Comprehension Models › Deep LSTM Reader

Deep LSTM Reader

1 paper tagged archive 2025-07-28

Introduced by Karl Moritz Hermann et al. in Teaching Machines to Read and Comprehend

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The Deep LSTM Reader is a neural network for reading comprehension. We feed documents one word at a time into a Deep LSTM encoder, after a delimiter we then also feed the query into the encoder. The model therefore processes each document query pair as a single long sequence. Given the embedded document and query the network predicts which token in the document answers the query.

The model consists of a Deep LSTM cell with skip connections from each input x(t) to every hidden layer, and from every hidden layer to the output y(t):

x′(t, k) = x(t)||y′(t, k - 1) , y(t) = y′(t, 1)|| …||y′(t, K)

i(t, k) = (Wₖₓᵢx′(t, k) + Wₖₕᵢh(t - 1, k) + W_(kci)c(t - 1, k) + bₖᵢ)

f(t, k) = (W_(kxf)x(t) + W_(khf)h(t - 1, k) + W_(kcf)c(t - 1, k) + b_(kf))

c(t, k) = f(t, k)c(t - 1, k) + i(t, k)tanh(W_(kxc)x′(t, k) + W_(khc)h(t - 1, k) + b_(kc))

o(t, k) = (Wₖₓₒx′(t, k) + Wₖₕₒh(t - 1, k) + W_(kco)c(t, k) + bₖₒ)

h(t, k) = o(t, k)tanh(c(t, k))

y′(t, k) = W_(kyh)(t, k) + b_(ky)

where || indicates vector concatenation, h(t, k) is the hidden state for layer k at time t, and i, f, o are the input, forget, and output gates respectively. Thus our Deep LSTM Reader is defined by g^(LSTM)(d, q) = y(|d|+|q|) with input x(t) the concatenation of d and q separated by the delimiter |||.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: AMA-LSTM; LSTM-VRN; IPM-LSTM; LSTM-MAS; G2-Reader; FDHT-LSTM; SACL-LSTM; Tri-Reader.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 1 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

1 task the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Reading Comprehension1

Usage over time archive 2025-07-28

Papers per year tagged with Deep LSTM Reader: 2015 to 2015, peak 1 1 0 2015: 1 paper 2015
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Reading Comprehension ModelsRecurrent Neural Networks

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