It is not surprising as coreferred mentions are labeled with the same identifier in the masked version, even if their original surface forms did not match (  used Wikipedia links for masking). Indeed, in the masked version, an entity is always referred to via the same unique surface form (e.g., MASK1) within and across documents. In the unmasked setting, on the other hand, mentions to an entity may differ (e.g., “US” vs “United States”) and they might not be retrieved by the coreference system we are employing, making the task harder for all models. Therefore, as we rely mostly on exact matching when constructing our graph for the masked case, we are more effective in recovering coreference links on the masked rather than unmasked version. In Figure 3 , we show how the model performance goes when the input graph is large. In particular, how Entity-GCN performs as the number of candidate answers or the number of nodes increases.

Ablation study	To help determine the sources of improvements, we perform an ablation study using the publicly available validation set (see Table 3 ). We perform two groups of ablation, one on the embedding layer, to study the effect of ELMo, and one on the edges, to study how different relations affect the overall model performance. We argue that ELMo is crucial, since we do not rely on any other context encoder. However, it is interesting to explore how our R-GCN performs without it. Therefore, in this experiment, we replace the deep contextualized embeddings of both the query and the nodes with GloVe  vectors (insensitive to context). Since we do not have any component in our model that processes the documents, we expect a drop in performance. In other words, in this ablation our model tries to answer questions without reading the context at all. For example, in Figure 1 , our model would be aware that “Stockholm” and “Sweden” appear in the same document but any context words, including the ones encoding relations (e.g., “is the capital of”) will be hidden.

Method	In this section we explain our method. We first introduce the dataset we focus on, WikiHop by  , as well as the task abstraction. We then present the building blocks that make up our Entity-GCN model, namely, an entity graph used to relate mentions to entities within and across documents, a document encoder used to obtain representations of mentions in context, and a relational graph convolutional network that propagates information through the entity graph.

Node annotations	Keeping in mind we want an efficient model, we encode words in supporting documents and in the query using only a pre-trained model for contextualized word representations rather than training our own encoder. Specifically, we use ELMo  , a pre-trained bi-directional language model that relies on character-based input representation. ELMo representations, differently from other pre-trained word-based models (e.g., word2vec  or GloVe  ), are contextualized since each token representation depends on the entire text excerpt (i.e., the whole sentence). We choose not to fine tune nor propagate gradients through the ELMo architecture, as it would have defied the goal of not having specialized RNN encoders. In the experiments, we will also ablate the use of ELMo showing how our model behaves using non-contextualized word representations (we use GloVe). ELMo encodings are used to produce a set of representations $\lbrace \mathbf {x}_i\rbrace _{i=1}^N$ , where $\mathbf {x}_i \in \mathbb {R}^D$ denotes the $i$ th candidate mention in context.

Reasoning on an entity graph	In an offline step, we organize the content of each training instance in a graph connecting mentions of candidate answers within and across supporting documents. For a given query $q = \langle s, r, ? \rangle $ , we identify mentions in $S_q$ of the entities in $C_q \cup \lbrace s\rbrace $ and create one node per mention. This process is based on the following heuristic: we consider mentions spans in $S_q$ exactly matching an element of $C_q \cup \lbrace s\rbrace $ . Admittedly, this is a rather simple strategy which may suffer from low recall. we use predictions from a coreference resolution system to add mentions of elements in $C_q \cup \lbrace s\rbrace $ beyond exact matching (including both noun phrases and anaphoric pronouns). In particular, we use the end-to-end coreference resolution by  . we discard mentions which are ambiguously resolved to multiple coreference chains; this may sacrifice recall, but avoids propagating ambiguity.

Dataset and task abstraction	The WikiHop dataset comprises of tuples $\langle q, S_q, C_q, a^\star \rangle $ where: $q$ is a query/question, $S_q$ is a set of supporting documents, $C_q$ is a set of candidate answers (all of which are entities mentioned in $S_q$ ), and $a^\star \in C_q$ is the entity that correctly answers the question. WikiHop is assembled assuming that there exists a corpus and a knowledge base (KB) related to each other. The KB contains triples $\langle s, r, o \rangle $ where $s$ is a subject entity, $o$ an object entity, and $r$ a unidirectional relation between them.  used Wikipedia as corpus and Wikidata  as KB. The KB is only used for constructing WikiHop:  retrieved the supporting documents $q$0 from the corpus looking at mentions of subject and object entities in the text. Note that the set $q$1 (not the KB) is provided to the QA system, and not all of the supporting documents are relevant for the query but some of them act as distractors.

To each node $v_i$ , we associate a continuous annotation $\mathbf {x}_i \in \mathbb {R}^D$ which represents an entity in the context where it was mentioned (details in Section "Node annotations" ). We then proceed to connect these mentions i) if they co-occur within the same document (we will refer to this as DOC-BASED edges), ii) if the pair of named entity mentions is identical (MATCH edges—these may connect nodes across and within documents), or iii) if they are in the same coreference chain, as predicted by the external coreference system (COREF edges). Note that MATCH edges when connecting mentions in the same document are mostly included in the set of edges predicted by the coreference system. Having the two types of edges lets us distinguish between less reliable edges provided by the coreference system and more reliable (but also more sparse) edges given by the exact-match heuristic. We treat these three types of connections as three different types of relations. See Figure 2 for an illustration.

22)  where $\mathcal {N}_i$ is the set of indices of nodes neighbouring the $i$ th node, $\mathcal {R}_{ij}$ is the set of edge annotations between $i$ and $j$ , and $f_r$ is a parametrized function specific to an edge type $r\in \mathcal {R}$ . Recall the available relations from Section "Ablation study" , namely, $\mathcal {R} =\lbrace $ DOC-BASED, MATCH, COREF, COMPLEMENT $\rbrace $ . A gating mechanism regulates how much of the update message propagates to the next step. This provides the model a way to prevent completely overwriting past information. Indeed, if all necessary information to answer a question is present at a layer which is not the last, then the model should learn to stop using neighbouring information for the next steps.

Error analysis	In this section we provide an error analysis for our best single model predictions. First of all, we look at which type of questions our model performs well or poorly. There are more than 150 query types in the validation set but we filtered the three with the best and with the worst accuracy that have at least 50 supporting documents and at least 5 candidates. We show results in Table 4 . We observe that questions regarding places (birth and death) are considered harder for Entity-GCN. We then inspect samples where our model fails while assigning highest likelihood and noticed two principal sources of failure i) a mismatch between what is written in Wikipedia and what is annotated in Wikidata, and ii) a different degree of granularity (e.g., born in “London” vs “UK” could be considered both correct by a human but not when measuring accuracy). See Table 6 in the supplement material for some reported samples. Secondly, we study how the model performance degrades when the input graph is large. In particular, we observe a negative Pearson's correlation (-0.687) between accuracy and the number of candidate answers. However, the performance does not decrease steeply.

Next, we ablate each type of relations independently, that is, we either remove connections of mentions that co-occur in the same document (DOC-BASED), connections between mentions matching exactly (MATCH), or edges predicted by the coreference system (COREF). The first thing to note is that the model makes better use of DOC-BASED connections than MATCH or COREF connections. This is mostly because i) the majority of the connections are indeed between mentions in the same document, and ii) without connecting mentions within the same document we remove important information since the model is unaware they appear closely in the document. Secondly, we notice that coreference links and complement edges seem to play a more marginal role. Though it may be surprising for coreference edges, recall that the MATCH heuristic already captures the easiest coreference cases, and for the rest the out-of-domain coreference system may not be reliable. Still, modelling all these different relations together gives our Entity-GCN a clear advantage. This is our best system evaluating on the development. Since Entity-GCN seems to gain little advantage using the coreference system, we report test results both with and without using it.

Question Answering by Reasoning Across Documents with Graph Convolutional Networks	Most research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. We introduce a neural model which integrates and reasons relying on information spread within documents and across multiple documents. We frame it as an inference problem on a graph. Mentions of entities are nodes of this graph while edges encode relations between different mentions (e.g., within-and crossdocument coreference). Graph convolutional networks (GCNs) are applied to these graphs and trained to perform multi-step reasoning. Our Entity-GCN method is scalable and compact, and it achieves state-of-the-art results on a multi-document question answering dataset, WIKIHOP (Welbl et al., 2018).

Besides, the neighbourhood of a node may include mentions of the same entity as well as others (e.g., same-document relation), and these mentions may have occurred in different documents. Taking this idea recursively, each further step of the algorithm allows a node to indirectly interact with nodes already known to their neighbours. After $L$ layers of R-GCN, information has been propagated through paths connecting up to $L+1$ nodes. We start with node representations $\lbrace \mathbf {h}_i^{(0)}\rbrace _{i=1}^N$ , and transform them by applying $L$ layers of R-GCN obtaining $\lbrace \mathbf {h}_i^{(L)}\rbrace _{i=1}^N$ . Together with a representation $\mathbf {q}$ of the query, we define a distribution over candidate answers and we train maximizing the likelihood of observations.

Related work	In previous work, BiDAF  , FastQA  , Coref-GRU  , MHPGM  , and Weaver / Jenga  have been applied to multi-document question answering. The first two mainly focus on single document QA and  adapted both of them to work with WikiHop. They process each instance of the dataset by concatenating all $d \in S_q$ in a random order adding document separator tokens. They trained using the first answer mention in the concatenated document and evaluating exact match at test time. Coref-GRU, similarly to us, encodes relations between entity mentions in the document. Instead of using graph neural network layers, as we do, they augment RNNs with jump links corresponding to pairs of corefereed mentions. MHPGM uses a multi-attention mechanism in combination with external commonsense relations to perform multiple hops of reasoning. Weaver is a deep co-encoding model that uses several alternating bi-LSTMs to process the concatenated documents and the query. Graph neural networks have been shown successful on a number of NLP tasks  ,  ,  , including those involving document level modeling  .

Besides, in the masked case all mentions become `unknown' tokens with GloVe and therefore the predictions are equivalent to a random guess. Once the strong pre-trained encoder is out of the way, we also ablate the use of our R-GCN component, thus completely depriving the model from inductive biases that aim at multi-hop reasoning. The first important observation is that replacing ELMo by GloVe (GloVe with R-GCN in Table 3 ) still yields a competitive system that ranks far above baselines from  and even above the Coref-GRU of  , in terms of accuracy on (unmasked) validation set. The second important observation is that if we then remove R-GCN (GloVe w/o R-GCN in Table 3 ), we lose 8.0 points. That is, the R-GCN component pushes the model to perform above Coref-GRU still without accessing context, but rather by updating mention representations based on their relation to other ones. These results highlight the impact of our R-GCN component. In this experiment we investigate the effect of the different relations available in the entity graph and processed by the R-GCN module.

Conclusion	We designed a graph neural network that operates over a compact graph representation of a set of documents where nodes are mentions to entities and edges signal relations such as within and cross-document coreference. The model learns to answer questions by gathering evidence from different documents via a differentiable message passing algorithm that updates node representations based on their neighbourhood. Our model outperforms published results where ablations show substantial evidence in favour of multi-step reasoning. Moreover, we make the model fast by using pre-trained (contextual) embeddings.

Note that these representations do not depend on the query yet and no trainable model was used to process the documents so far, that is, we use ELMo as a fixed pre-trained encoder. Therefore, we can pre-compute representation of mentions once and store them for later use. ELMo encodings are used to produce a query representation $\mathbf {q} \in \mathbb {R}^K$ as well. Here, $\mathbf {q}$ is a concatenation of the final outputs from a bidirectional RNN layer trained to re-encode ELMo representations of words in the query. The vector $\mathbf {q}$ is used to compute a query-dependent representation of mentions $\lbrace \mathbf { \hat{x}}_i\rbrace _{i=1}^N$ as well as to compute a probability distribution over candidates (as in Equation 16 ). Query-dependent mention encodings $\mathbf {\hat{x}}_i = f_x(\mathbf {q}, \mathbf {x}_i)$ are generated by a trainable function $f_x$ which is parameterized by a feed-forward neural network.

We start off by testing our stronger encoder (i.e., ELMo) in absence of edges connecting mentions in the supporting documents (i.e., using only self-loops – No R-GCN in Table 3 ). The results suggest that WikipHop genuinely requires multihop inference, as our best model is 6.1% and 8.4% more accurate than this local model, in unmasked and masked settings, respectively. However, it also shows that ELMo representations capture predictive context features, without being explicitly trained for the task. It confirms that our goal of getting away with training expensive document encoders is a realistic one. We then inspect our model's effectiveness in making use of the structure encoded in the graph. We start naively by fully-connecting all nodes within and across documents without distinguishing edges by type (No relation types in Table 3 ). We observe only marginal improvements with respect to ELMo alone (No R-GCN in Table 3 ) in both the unmasked and masked setting suggesting that a GCN operating over a naive entity graph would not add much to this task and a more informative graph construction and/or a more sophisticated parameterization is indeed needed.

The probability of selecting a candidate $c \in C_q$ as an answer is then  $$ 
P(c|q, C_q, S_q) \propto \exp \left(\max _{i \in \mathcal {M}_c} f_o([\mathbf {q}, \mathbf {h}^{(L)}_i]) \right)\;,$$   (Eq. 16)  where $f_o$ is a parameterized affine transformation, and $\mathcal {M}_c$ is the set of node indices such that $i\in \mathcal {M}_c$ only if node $v_i$ is a mention of $c$ . The $\max $ operator in Equation 16 is necessary to select the node with highest predicted probability since a candidate answer is realized in multiple locations via different nodes.

In addition to that, and to prevent having disconnected graphs, we add a fourth type of relation (COMPLEMENT edge) between any two nodes that are not connected with any of the other relations. We can think of these edges as those in the complement set of the entity graph with respect to a fully connected graph. Our model then approaches multi-step reasoning by transforming node representations (Section "Node annotations" for details) with a differentiable message passing algorithm that propagates information through the entity graph. The algorithm is parameterized by a graph convolutional network (GCN)  , in particular, we employ relational-GCNs  , an extended version that accommodates edges of different types. In Section "Entity relational graph convolutional network" we describe the propagation rule. Each step of the algorithm (also referred to as a hop) updates all node representations in parallel. In particular, a node is updated as a function of messages from its direct neighbours, and a message is possibly specific to a certain relation. At the end of the first step, every node is aware of every other node it connects directly to.

Surprisingly, with coreference, we observe performance degradation on the test set. It is likely that the test documents are harder for the coreference system. We do perform one last ablation, namely, we replace our heuristic for assigning edges and their labels by a model component that predicts them. The last row of Table 3 (Induced edges) shows model performance when edges are not predetermined but predicted. For this experiment, we use a bilinear function $f_e(\mathbf {\hat{x}}_i, \mathbf {\hat{x}}_j) = \sigma \left( \mathbf {\hat{x}}^\top _i \mathbf {W}_e \mathbf {\hat{x}}_j \right)$ that predicts the importance of a single edge connecting two nodes $i,j$ using the query-dependent representation of mentions (see Section "Node annotations" ). The performance drops below `No R-GCN' suggesting that it cannot learn these dependencies on its own. Most results are stronger for the masked settings even though we do not apply the coreference resolution system in this setting due to masking.

Queries, on the other hand, are not expressed in natural language, but instead consist of tuples $q$2 where the object entity is unknown and it has to be inferred by reading the support documents. Therefore, answering a query corresponds to finding the entity $q$3 that is the object of a tuple in the KB with subject $q$4 and relation $q$5 among the provided set of candidate answers $q$6 . The goal is to learn a model that can identify the correct answer $a^\star $ from the set of supporting documents $S_q$ . To that end, we exploit the available supervision to train a neural network that computes scores for candidates in $C_q$ . We estimate the parameters of the architecture by maximizing the likelihood of observations. For prediction, we then output the candidate that achieves the highest probability. In the following, we present our model discussing the design decisions that enable multi-step reasoning and an efficient computation.

The distribution of the number of candidates in the dataset peaks at 5 and has an average of approximately 20. Therefore, the model does not see many samples where there are a large number of candidate entities during training. Differently, we notice that as the number of nodes in the graph increases, the model performance drops but more gently (negative but closer to zero Pearson's correlation). This is important as document sets can be large in practical applications. See Figure 3 in the supplemental material for plots. In Table 6 , we report three samples from WikiHop development set where out Entity-GCN fails. In particular, we show two instances where our model presents high confidence on the answer, and one where is not. We commented these samples explaining why our model might fail in these cases.

This implies that only a lightweight computation has to be performed online, both at train and test time, whereas the rest is preprocessed. Even in the somewhat contrived WikiHop setting, where fairly small sets of candidates are provided, the model is at least 5 times faster to train than BiDAF. Interestingly, when we substitute ELMo with simple pre-trained word embeddings, Entity-GCN still performs on par with many techniques that use expensive question-aware recurrent document encoders. Despite not using recurrent document encoders, the full Entity-GCN model achieves over 2% improvement over the best previously-published results. As our model is efficient, we also reported results of an ensemble which brings further 3.6% of improvement and only 3% below the human performance reported by  . Our contributions can be summarized as follows:

Architecture	See table 5 for an outline of Entity-GCN architectural detail. Here the computational steps ELMo embeddings are a concatenation of three 1024-dimensional vectors resulting in 3072-dimensional input vectors $\lbrace \mathbf {x}_i\rbrace _{i=1}^N$ . For the query representation $\mathbf {q}$ , we apply 2 bi-LSTM layers of 256 and 128 hidden units to its ELMo vectors. The concatenation of the forward and backward states results in a 256-dimensional question representation. ELMo embeddings of candidates are projected to 256-dimensional vectors, concatenated to the $\mathbf {q}$ , and further transformed with a two layers MLP of 1024 and 512 hidden units in 512-dimensional query aware entity representations $\lbrace \mathbf {\hat{x}}_i\rbrace _{i=1}^N \in \mathbb {R}^{512}$ . All transformations $f_*$ in R-GCN-layers are affine and they do maintain the input and output dimensionality of node representations the same (512-dimensional).

Entity relational graph convolutional network	Our model uses a gated version of the original R-GCN propagation rule. At the first layer, all hidden node representation are initialized with the query-aware encodings $\mathbf {h}_i^{(0)} = \mathbf {\hat{x}}_i$ . Then, at each layer $0\le \ell \le L$ , the update message $\mathbf {u}_i^{(\ell )}$ to the $i$ th node is a sum of a transformation $f_s$ of the current node representation $\mathbf {h}^{(\ell )}_i$ and transformations of its neighbours:  $$\mathbf {u}^{(\ell )}_i = f_s(\mathbf {h}^{(\ell )}_i) + \frac{1}{|\mathcal {N}_i|} \sum _{j \in \mathcal {N}_i} \sum _{r \in \mathcal {R}_{ij}} f_r(\mathbf {h}_j^{(\ell )})\;,$$   (Eq.

We additionally re-ran BiDAF baseline to compare training time: when using a single Titan X GPU, BiDAF and Entity-GCN process 12.5 and 57.8 document sets per second, respectively. Note that  had to use BiDAF with very small state dimensionalities (20), and smaller batch size due to the scalability issues (both memory and computation costs). We compare applying the same reductions. Eventually, we also report an ensemble of 5 independently trained models. All models are trained on the same dataset splits with different weight initializations. The ensemble prediction is obtained as $\arg \max \limits _c \prod \limits _{i=1}^5 P_i(c|q, C_q, S_q)$ from each model.

Comparison	In this experiment, we compare our Enitity-GCN against recent prior work on the same task. We present test and development results (when present) for both versions of the dataset in Table 2 . From  , we list an oracle based on human performance as well as two standard reading comprehension models, namely BiDAF  and FastQA  . We also compare against Coref-GRU  , MHPGM  , and Weaver  . Additionally, we include results of MHQA-GRN  , from a recent arXiv preprint describing concurrent work. They jointly train graph neural networks and recurrent encoders. We report single runs of our two best single models and an ensemble one on the unmasked test set (recall that the test set is not publicly available and the task organizers only report unmasked results) as well as both versions of the validation set. Entity-GCN (best single model without coreference edges) outperforms all previous work by over 2% points.

Though there is no guarantee that a question cannot be answered by relying just on a single sentence, the authors ensure that it is answerable using a chain of reasoning crossing document boundaries. Though an important practical problem, the multi-hop setting has so far received little attention. The methods reported by  approach the task by merely concatenating all documents into a single long text and training a standard RNN-based reading comprehension model, namely, BiDAF  and FastQA  . Document concatenation in this setting is also used in Weaver  and MHPGM  . The only published paper which goes beyond concatenation is due to  , where they augment RNNs with jump-links corresponding to co-reference edges. Though these edges provide a structural bias, the RNN states are still tasked with passing the information across the document and performing multi-hop reasoning. Instead, we frame question answering as an inference problem on a graph representing the document collection. Nodes in this graph correspond to named entities in a document whereas edges encode relations between them (e.g., cross- and within-document coreference links or simply co-occurrence in a document).

We assume that reasoning chains can be captured by propagating local contextual information along edges in this graph using a graph convolutional network (GCN)  . The multi-document setting imposes scalability challenges. In realistic scenarios, a system needs to learn to answer a query for a given collection (e.g., Wikipedia or a domain-specific set of documents). In such scenarios one cannot afford to run expensive document encoders (e.g., RNN or transformer-like self-attention  ), unless the computation can be preprocessed both at train and test time. Even if (similarly to WikiHop creators) one considers a coarse-to-fine approach, where a set of potentially relevant documents is provided, re-encoding them in a query-specific way remains the bottleneck. In contrast to other proposed methods (e.g.,  ,  ,  ), we avoid training expensive document encoders. In our approach, only a small query encoder, the GCN layers and a simple feed-forward answer selection component are learned. Instead of training RNN encoders, we use contextualized embeddings (ELMo) to obtain initial (local) representations of nodes.

Training details	We train our models with a batch size of 32 for at most 20 epochs using the Adam optimizer  with $\beta _1=0.9$ , $\beta _2=0.999$ and a learning rate of $10^{-4}$ . To help against overfitting, we employ dropout (drop rate $\in {0, 0.1, 0.15, 0.2, 0.25}$ )  and early-stopping on validation accuracy. We report the best results of each experiment based on accuracy on validation set.

All transformations $f_*$ are affine and they are not layer-dependent (since we would like to use as few parameters as possible to decrease model complexity promoting efficiency and scalability).

Gate levels are computed as  $$\mathbf {a}^{(\ell )}_i = \sigma \left( f_a\left([\mathbf {u}^{(\ell )}_i, \mathbf {h}^{(\ell )}_i ]\right) \right) \;,$$   (Eq. 23)  where $\sigma (\cdot )$ is the sigmoid function and $f_a$ a parametrized transformation. Ultimately, the updated representation is a gated combination of the previous representation and a non-linear transformation of the update message:  $$\mathbf {h}^{(\ell + 1)}_i = \phi (\mathbf {u}^{(\ell )}_i) \odot \mathbf {a}^{(\ell )}_i + \mathbf {h}^{(\ell )}_i \odot (1 - \mathbf {a}^{(\ell )}_i ) \;,$$   (Eq. 24)  where $\phi (\cdot )$ is any nonlinear function (we used $\tanh $ ) and $\odot $ stands for element-wise multiplication.

Eventually, a 2-layers MLP with [256, 128] hidden units takes the concatenation between $\lbrace \mathbf {h}_i^{(L)}\rbrace _{i=1}^N$ and $\mathbf {q}$ to predict the probability that a candidate node $v_i$ may be the answer to the query $q$ (see Equation 16 ). During preliminary trials, we experimented with different numbers of R-GCN-layers (in the range 1-7). We observed that with WikiHop, for $L \ge 3$ models reach essentially the same performance, but more layers increase the time required to train them. Besides, we observed that the gating mechanism learns to keep more and more information from the past at each layer making unnecessary to have more layers than required.

Experiments	In this section, we compare our method against recent work as well as preforming an ablation study using the WikiHop dataset  . See Appendix "Implementation and experiments details" in the supplementary material for a description of the hyper-parameters of our model and training details.

They have also been applied in the context of asking questions about knowledge contained in a knowledge base  . In schlichtkrull2017modeling, GCNs are used to capture reasoning chains in a knowledge base. Our work and unpublished concurrent work by  are the first to study graph neural networks in the context of multi-document QA. Besides differences in the architecture,  propose to train a combination of a graph recurrent network and an RNN encoder. We do not train any RNN document encoders in this work.

Acknowledgments	We would like to thank Johannes Welbl for helping to test our system on WikiHop. This project is supported by SAP Innovation Center Network, ERC Starting Grant BroadSem (678254) and the Dutch Organization for Scientific Research (NWO) VIDI 639.022.518. Wilker Aziz is supported by the Dutch Organisation for Scientific Research (NWO) VICI Grant nr. 277-89-002.

Introduction	The long-standing goal of natural language understanding is the development of systems which can acquire knowledge from text collections. Fresh interest in reading comprehension tasks was sparked by the availability of large-scale datasets, such as SQuAD  and CNN/Daily Mail  , enabling end-to-end training of neural models  ,  ,  . These systems, given a text and a question, need to answer the query relying on the given document. Recently, it has been observed that most questions in these datasets do not require reasoning across the document, but they can be answered relying on information contained in a single sentence  . The last generation of large-scale reading comprehension datasets, such as a NarrativeQA  , TriviaQA  , and RACE  , have been created in such a way as to address this shortcoming and to ensure that systems relying only on local information cannot achieve competitive performance. Even though these new datasets are challenging and require reasoning within documents, many question answering and search applications require aggregation of information across multiple documents. The WikiHop dataset  was explicitly created to facilitate the development of systems dealing with these scenarios. Each example in WikiHop consists of a collection of documents, a query and a set of candidate answers (Figure 1 ).

Question: How did they detect entity mentions?
Answer: Exact matches to the entity string and predictions from a coreference resolution system