Title: MACHINE COMPREHENSION USING MATCH-LSTM AND ANSWER POINTER

Abstract: 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 tasks. 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. Besides, our boundary model also achieves the best performance on the MSMARCO dataset (Nguyen et al., 2016) .

1. INTRODUCTION:

Machine comprehension of text is one of the ultimate goals of natural language processing. While the ability of a machine to understand text can be assessed in many different ways, in recent years, several benchmark datasets have been created to focus on answering questions as a way to evaluate machine comprehension (Richardson et al., 2013; Hermann et al., 2015; Hill et al., 2016; Weston et al., 2016; Rajpurkar et al., 2016; Nguyen et al., 2016) . In this setup, typically the machine is first presented with a piece of text such as a news article or a story. The machine is then expected to answer one or multiple questions related to the text.

In most of the benchmark datasets, a question can be treated as a multiple choice question, whose correct answer is to be chosen from a set of provided candidate answers (Richardson et al., 2013; Hill et al., 2016) . Presumably, questions with more given candidate answers are more challenging. The Stanford Question Answering Dataset (SQuAD) introduced recently by Rajpurkar et al. (2016) contains such more challenging questions whose correct answers can be any sequence of tokens from the given text. Moreover, unlike some other datasets whose questions and answers were created automatically in Cloze style (Hermann et al., 2015; Hill et al., 2016) , the questions and answers in SQuAD were created by humans through crowdsourcing, which makes the dataset more realistic. Another real dataset, the Human-Generated MAchine Reading COmprehension dataset (MSMARCO) (Nguyen et al., 2016) , provided a query together with several related documents collected from Bing Index. The answer to the query is generated by human and the answer words can not only come from the given text.

Given these advantages of the SQuAD and MSMARCO datasets, in this paper, we focus on these new datasets to study machine comprehension of text. A sample piece of text and three of its associated questions from SQuAD are shown in Table 1 . Traditional solutions to this kind of question answering tasks rely on NLP pipelines that involve multiple steps of linguistic analyses and feature engineering, including syntactic parsing, named entity recognition, question classification, semantic parsing, etc. Recently, with the advances of applying neural network models in NLP, there has been In 1870, Tesla moved to Karlovac, to attend school at the Higher Real Gymnasium, where he was profoundly influenced by a math teacher Martin Sekulić. The classes were held in German, as it was a school within the Austro-Hungarian Military Frontier. Tesla was able to perform integral calculus in his head, which prompted his teachers to believe that he was cheating. He finished a four-year term in three years, graduating in 1873.

1. In what language were the classes given? German 2. Who was Tesla's main influence in Karlovac? Martin Sekulić 3. Why did Tesla go to Karlovac? attend school at the Higher Real Gymnasium Table 1 : A paragraph from Wikipedia and three associated questions together with their answers, taken from the SQuAD dataset. The tokens in bold in the paragraph are our predicted answers while the texts next to the questions are the ground truth answers.

much interest in building end-to-end neural architectures for various NLP tasks, including several pieces of work on machine comprehension (Hermann et al., 2015; Hill et al., 2016; Yin et al., 2016; Kadlec et al., 2016; Cui et al., 2016) . However, given the properties of previous machine comprehension datasets, existing end-to-end neural architectures for the task either rely on the candidate answers (Hill et al., 2016; Yin et al., 2016) or assume that the answer is a single token (Hermann et al., 2015; Kadlec et al., 2016; Cui et al., 2016) , which make these methods unsuitable for the SQuAD/MSMARCO dataset. In this paper, we propose a new end-to-end neural architecture to address the machine comprehension problem as defined in the SQuAD/MSMARCO dataset. And for the MSMARCO dataset, we will only make use of the words in the given text to generate the answer.

Specifically, observing that in the SQuAD/MSMARCO dataset many questions could be entailed from some sentences in the original text, we adopt a match-LSTM model that we developed earlier for textual entailment (Wang & Jiang, 2016) as one layer of our model. We build a bi-directional match-LSTM on the given passage with attentions on the question for each word so that each position in the paragraph will have a hidden representation reflecting its relation to the question. Then we further adopt the Pointer Net (Ptr-Net) model developed by Vinyals et al. (2015) to select the words in these positions based on the hidden representations built by match-LSTM as an answer.

We propose two ways to apply the Ptr-Net model for our task: a sequence model which selects the answer word by word, and a boundary model which only selects the start and end points of the answer span. Experiments on the SQuAD dataset show that our two models both outperform the best performance reported by Rajpurkar et al. (2016) . Moreover, using an ensemble of several of our models, we can achieve very competitive performance on SQuAD. For the MSMARCO dataset, a real query based problem, our boundary model outperforms our sequence model with a big margin. It also outperforms the golden passage baseline.

Our contributions can be summarized as follows:

(1) We propose two new end-to-end neural network models for machine comprehension, which combine match-LSTM and Ptr-Net to handle the special properties of the SQuAD dataset. To the best of our knowledge, we are the first to propose the boundary model which is more suitable to the SQuAD/MSMARCO tasks. And we are the first to integrate the attention-based word pair matching into machine comprehension tasks.

(2) We have achieved the performance of an exact match score of 71.3% and an F1 score of 80.8% on the unseen SQuAD test dataset, which is much better than the feature-engineered solution (Rajpurkar et al., 2016) . Our performance is also close to the state of the art on SQuAD, which is 74.8% in terms of exact match and 82.2% in terms of F1 collected from the SQuAD Leaderboard1 . Besides, our boundary model achieves the state-of-art performance on the MSMARCO dataset with BLUE-1/2/3/4 40.7/33.9/30.6/28.7 and Rouge-L 37.32 . (3) Our further visualization of the models reveals some useful insights of the attention mechanism for reasoning the questions. And we also show that the boundary model can overcome the early stop prediction problem in the sequence model. Besides, we also made our code available online3 .

Figure 1 : An overview of our two models. Both models consist of an LSTM preprocessing layer, a match-LSTM layer and an Answer Pointer layer. For each match-LSTM in a particular direction, hq i , which is defined as H q α i , is computed using the α in the corresponding direction, as described in Eqn. (2)

2. METHOD:

In this section, we first briefly review match-LSTM and Pointer Net. These two pieces of existing work lay the foundation of our method. We then present our end-to-end neural architecture for machine comprehension.

2.1. MATCH-LSTM:

In a recent work on learning natural language inference, we proposed a match-LSTM model for predicting textual entailment (Wang & Jiang, 2016) . In textual entailment, two sentences are given where one is a premise and the other is a hypothesis. To predict whether the premise entails the hypothesis, the match-LSTM model goes through the tokens of the hypothesis sequentially. At each position of the hypothesis, attention mechanism is used to obtain a weighted vector representation of the premise. This weighted premise is then to be combined with a vector representation of the current token of the hypothesis and fed into an LSTM, which we call the match-LSTM. The match-LSTM essentially sequentially aggregates the matching of the attention-weighted premise to each token of the hypothesis and uses the aggregated matching result to make a final prediction. Vinyals et al. (2015) proposed a Pointer Network (Ptr-Net) model to solve a special kind of problems where we want to generate an output sequence whose tokens must come from the input sequence. Instead of picking an output token from a fixed vocabulary, Ptr-Net uses attention mechanism as a pointer to select a position from the input sequence as an output symbol. The pointer mechanism has inspired some recent work on language processing (Gu et al., 2016; Kadlec et al., 2016) . Here we adopt Ptr-Net in order to construct answers using tokens from the input text.

2.2. POINTER NET:



2.3. OUR METHOD:

Formally, the problem we are trying to solve can be formulated as follows. We are given a piece of text, which we refer to as a passage, and a question related to the passage. The passage is represented by matrix P ∈ R d×P , where P is the length (number of tokens) of the passage and d is the dimensionality of word embeddings. Similarly, the question is represented by matrix Q ∈ R d×Q where Q is the length of the question. Our goal is to identify a subsequence from the passage as the answer to the question.

As pointed out earlier, since the output tokens are from the input, we would like to adopt the Pointer Net for this problem. A straightforward way of applying Ptr-Net here is to treat an answer as a sequence of tokens from the input passage but ignore the fact that these tokens are consecutive in the original passage, because Ptr-Net does not make the consecutivity assumption. Specifically, we represent the answer as a sequence of integers a = (a 1 , a 2 , . . .), where each a i is an integer between 1 and P , indicating a certain position in the passage.

Alternatively, if we want to ensure consecutivity, that is, if we want to ensure that we indeed select a subsequence from the passage as an answer, we can use the Ptr-Net to predict only the start and the end of an answer. In this case, the Ptr-Net only needs to select two tokens from the input passage, and all the tokens between these two tokens in the passage are treated as the answer. Specifically, we can represent the answer to be predicted as two integers a = (a s , a e ), where a s an a e are integers between 1 and P .

We refer to the first setting above as a sequence model and the second setting above as a boundary model. For either model, we assume that a set of training examples in the form of triplets

{(P n , Q n , a n )} N n=1 are

given. An overview of the two neural network models are shown in Figure 1 . Both models consist of three layers: (1) An LSTM preprocessing layer that preprocesses the passage and the question using LSTMs. (2) A match-LSTM layer that tries to match the passage against the question. (3) An Answer Pointer (Ans-Ptr) layer that uses Ptr-Net to select a set of tokens from the passage as the answer. The difference between the two models only lies in the third layer.

LSTM Preprocessing Layer:

The purpose for the LSTM preprocessing layer is to incorporate contextual information into the representation of each token in the passage and the question. We use a standard one-directional LSTM (Hochreiter & Schmidhuber, 1997) to process the passage4 and the question separately, as shown below:

EQUATION

The resulting matrices H p ∈ R l×P and H q ∈ R l×Q are hidden representations of the passage and the question, where l is the dimensionality of the hidden vectors. In other words, the i th column vector h p i (or h q i ) in H p (or H q ) represents the i th token in the passage (or the question) together with some contextual information from the left.

Match-LSTM Layer:

We apply the match-LSTM model (Wang & Jiang, 2016) proposed for textual entailment to our machine comprehension problem by treating the question as a premise and the passage as a hypothesis. The match-LSTM sequentially goes through the passage. At position i of the passage, it first uses the standard word-by-word attention mechanism to obtain attention weight vector -

EQUATION

where

W q , W p , W r ∈ R l×l , b p , w ∈ R l×1 and b ∈ R are parameters to be learned, - → G i ∈ R l×Q is the intermediate result, - → h r i-1 ∈ R l×1

is the hidden vector of the one-directional match-LSTM (to be explained below) at position i -1, and the outer product (• ⊗ e Q ) produces a matrix or row vector by repeating the vector or scalar on the left for Q times.

Essentially, the resulting attention weight -→ α i,j above indicates the degree of matching between the i th token in the passage with the j th token in the question. Next, we use the attention weight vector -→ α i to obtain a weighted version of the question and combine it with the current token of the passage to form a vector -→ z i :

EQUATION

where

H q ∈ R l×Q , - → α i ∈ R 1×Q and h p i ∈ R l×1

. This vector -→ z i is fed into a standard onedirectional LSTM to form our so-called match-LSTM:

EQUATION

where -→ h r i ∈ R l×1 . We further build a similar match-LSTM in the reverse direction. The purpose is to obtain a representation that encodes the contexts from both directions for each token in the passage.

Let - → H r ∈ R l×P represent the hidden states [ - → h r 1 , - → h r 2 , . . . , - → h r P ] and ← - H r ∈ R l×P represent [ ← - h r 1 , ← - h r 2 , . . . , ← - h r P ]

, the hidden states of match-LSTM in the reverse direction. We define H r ∈ R 2l×P as the concatenation of the two:

H r = - → H r ← - H r .

(5)

Answer Pointer Layer:

The top layer, the Answer Pointer (Ans-Ptr) layer, is motivated by the Pointer Net introduced by Vinyals et al. (2015) . This layer uses the sequence H r as input. Recall that we have two different models: The sequence model produces a sequence of answer tokens but these tokens may not be consecutive in the original passage. The boundary model produces only the start token and the end token of the answer, and then all the tokens between these two in the original passage are considered to be the answer. We now explain the two models separately.

The Sequence Model: Recall that in the sequence model, the answer is represented by a sequence of integers a = (a 1 , a 2 , . . .) indicating the positions of the selected tokens in the original passage.

The Ans-Ptr layer models the generation of these integers in a sequential manner. Because the length of an answer is not fixed, in order to stop generating answer tokens at certain point, we allow each a k to take up an integer value between 1 and P + 1, where P + 1 is a special value indicating the end of the answer. Once a k is set to be P + 1, the generation of the answer stops.

In order to generate the k th answer token indicated by a k , first, the attention mechanism is used again to obtain an attention weight vector β k ∈ R 1×(P +1) , where β k,j (1 ≤ j ≤ P + 1) is the probability of selecting the j th token from the passage as the k th token in the answer, and β k,(P +1) is the probability of stopping the answer generation at position k. β k is modeled as follows:

EQUATION

EQUATION

where H r ∈ R 2l×(P +1) is the concatenation of H r with a zero vector, defined as

H r = [H r ; 0], V ∈ R l×2l , W a ∈ R l×l , b a , v ∈ R l×1 and c ∈ R are parameters to be learned, F k ∈ R l×(P +1) is the intermediate result, (• ⊗ e (P +1

) ) follows the same definition as before, and h a k-1 ∈ R l×1 is the hidden vector at position k -1 of an answer LSTM as defined below:

EQUATION

We can then model the probability of generating the answer sequence as

EQUATION

and

EQUATION

To train the model, we minimize the following loss function based on the training examples:

EQUATION

The Boundary Model: The boundary model works in a way very similar to the sequence model above, except that instead of predicting a sequence of indices a 1 , a 2 , . . ., we only need to predict two indices a s and a e . So the main difference from the sequence model above is that in the boundary model we do not need to add the zero padding to H r , and the probability of generating an answer is simply modeled as

EQUATION

As this boundary model could point to a span covering too many tokens without any restriction, we try to manually limit the length of the predicted span and then search the span with the highest probability computed by p(a s ) × p(a e |a s ) as the answer.

3. EXPERIMENTS:

In this section, we present our experiment results and perform some analyses to better understand how our models works.

3.1. DATA:

We use the Stanford Question Answering Dataset (SQuAD) v1.1 and the human-generated Microsoft MAchine Reading COmprehension (MSMARCO) dataset v1.1 to conduct our experiments.

Passages in SQuAD come from 536 articles in Wikipedia covering a wide range of topics. Each passage is a single paragraph from a Wikipedia article, and each passage has around 5 questions associated with it. In total, there are 23,215 passages and 107,785 questions. The data has been split into a training set (with 87,599 question-answer pairs), a development set (with 10,570 questionanswer pairs) and a hidden test set.

For the MSMARCO dataset, the questions are user queries issued to the Bing search engine, the context passages are real Web documents and the answers are human-generated. We select the span that has the highest F1 score with the gold standard answer for training and only predict the span in the passages during evaluation. The data has been split into a training set (82326 pairs), a development set (10047 pairs) and a test set (9650 pairs).

3.2. EXPERIMENT SETTINGS:

We first tokenize all the passages, questions and answers. We use word embeddings from GloVe (Pennington et al., 2014) to initialize the model. Words not found in GloVe are initialized as zero vectors. The word embeddings are not updated during the training of the model.

The dimensionality l of the hidden layers is set to be 150. We use ADAMAX (Kingma & Ba, 2015) with the coefficients β 1 = 0.9 and β 2 = 0.999 to optimize the model. Each update is computed through a minibatch of 30 instances. We do not use L2-regularization.

For the SQuAD dataset, the performance is measured by two metrics: percentage of exact match with the ground truth answers and word-level F1 score when comparing the tokens in the predicted answers with the tokens in the ground truth answers. Note that in the development set and the test set each question has around three ground truth answers. F1 scores with the best matching answers are used to compute the average F1 score. For the MSMARCO dataset, the metrics in the official tool of MSMARCO evaluation are BLEU-1/2/3/4 and Rouge-L, which are widely used in many domains.

3.3. RESULTS:

The SQuAD and MSMARCO results of our models as well as the results of the baselines (Rajpurkar et al., 2016; Yu et al., 2016) bi-Ans-Ptr" which adds bidirectional answer pointer, "deep" which adds another twolayer bi-directional LSTMs between the match-LSTM and the Answer Pointer layers, and "elem" which adds elementwise comparison ,(h p i -H q α i ) and (h p i H q α i ), into Eqn 3. "-pre-LSTM" refers to removing the pre-processing layer.

the experiments with the ablation of attention mechanism in match-LSTM. Specifically, we use the final representation of the question to replace the weighted sum of the question representations. For the MSMARCO dataset, as the context for each question is consisted of around 10 documents, the "Golden Passage" is to directly use the human labeled document which could answer the question as the prediction.

From the results in Table 2 , we can see that the boundary model could clearly outperform the sequence model in a big margin on both datasets. We hypothesis that the sequence model is more likely to stop word generation earlier, and the boundary model can somehow overcome this problem. We have a statistical analysis on the answers generated by our sequence and boundary models shown in Table 3 . We can see that the length of the answers generated by the sequence model is much shorter than the ground truth. Especially for the MSMARCO task where the answers are usually much longer, the sequence model could only generate 7 words on average, while the ground truth answers are 16 on average and the boundary model could generate nearly the same number of words with the ground truth. Several answers generated by our models are shown in Appendix A. From Table 2 , we can also see that the performance gets poorer by removing the attention mechanism in match-LSTM, while for the MSMARCO dataset, the attention mechanism effects less, with no more than 2 percent reduction in BLEU and Rouge-L scores by attention mechanism ablation.

Based on the effectiveness of boundary pointer and match-LSTM, we conduct further exploration of the boundary model by adding element-wise comparison (h p i -H q α i ) and (h p i H q α i ) into Eqn 3 in match-LSTM layer, adding 2 more bi-directional LSTM layers between match-LSTM and Ans-Ptr layers, and adding bi-directional Ans-Ptr. We show the ablation study of this further tuned model in Table 4 . We can see that adding element-wise matching could make the biggest improvement for our boundary model. We also try to remove the phrase-level representation by removing the pre-process LSTM and using the word-level representations as the inputs of match-LSTM. Interestingly, we find the phrase-level representation effects little on the MSMARCO task.

Overall, we can see that both of our match-LSTM models have clearly outperformed the logistic regression model by Rajpurkar et al. (2016) , which relies on carefully designed features. The improvement of our models over the logistic regression model shows that our end-to-end neural network models without much feature engineering are very effective on these tasks and datasets. Our boundary model also outperformed the DCR model (Yu et al., 2016) , which maximizes the probability of the gold standard span from all the candidate spans through a neural network structure. To better understand the strengths and weaknesses of our models, we perform some further analyses of the results below.

3.4. FURTHER ANALYSES:

First, we suspect that longer answers are harder to predict. To verify this hypothesis, we analysed the performance in terms of both exact match and F1 score with respect to the answer length on the development set, as shown in Figure 2 . For example, for questions whose answers contain more than 9 tokens, the F1 score of the boundary model drops to around 55% and the exact match score drops to only around 30%, compared to the F1 score and exact match score of close to 72% and 67%, respectively, for questions with single-token answers. And that supports our hypothesis. We use a crude way to split the questions into different groups based on a set of question words we have defined, including "what," "how," "who," "when," "which," "where," and "why." These different question words roughly refer to questions with different types of answers. For example, "when" questions look for temporal expressions as answers, whereas "where" questions look for locations as answers. According to the performance on the development dataset, our models work the best for "when" questions. This may be because in this dataset temporal expressions are relatively easier to recognize. Other groups of questions whose answers are noun phrases, such as "what" questions, "which" questions and "where" questions, also get relatively better results. On the other hand, "why" questions are the hardest to answer. This is not surprising because the answers to "why" questions can be very diverse, and they are not restricted to any certain type of phrases.

Finally, we would like to check whether the attention mechanism used in the match-LSTM layer is effective in helping the model locate the answer. We show the attention weights α in Figure 3 . In the figure the darker the color is the higher the weight is. We can see that some words have been well aligned based on the attention weights. For example, the word "German" in the passage is aligned well to the word "language" in the first question, and the model successfully predicts "German" as the answer to the question. For the question word "who" in the second question, the word "teacher" actually receives relatively higher attention weight, and the model has predicted the phrase "Martin Sekulic" after that as the answer, which is correct. For the third question that starts with "why", the attention weights are more evenly distributed and it is not clear which words have been aligned to "why". For the last question, we can see that the word knowledge needed for generating the answer can also be detected by match-LSTM. For example, the words "European", "Parliament", "Council", "European" and "Union" have higher attention weights on "governing" in the question. Even though our models can solve this type of questions, they are still not able to solve the questions that need multi-sentences reasoning. More answers generated by our models for the questions related to different kinds of reasoning are shown in Appendix B.

4. RELATED WORK:

Machine comprehension of text has gained much attention in recent years, and increasingly researchers are building data-drive, end-to-end neural network models for the task. We will first review the recently released datasets and then some end-to-end models on this task.

4.1. DATASETS:

A number of datasets for studying machine comprehension were created in Cloze style by removing a single token from a sentence in the original corpus, and the task is to predict the missing word. 2016) created the MovieQA dataset. In these datasets, candidate answers are provided for each question. Similar to these two datasets, the SQuAD dataset (Rajpurkar et al., 2016) was also created by human annotators. Different from the previous two, however, the SQuAD dataset does not provide candidate answers, and thus all possible subsequences from the given passage have to be considered as candidate answers.

Besides the datasets above, there are also a few other datasets created for machine comprehension, such as WikiReading dataset (Hewlett et al., 2016) and bAbI dataset (Weston et al., 2016) , but they are quite different from the datasets above in nature.

4.2. END-TO-END NEURAL NETWORK MODELS FOR MACHINE COMPREHENSION:

There have been a number of studies proposing end-to-end neural network models for machine comprehension. A common approach is to use recurrent neural networks (RNNs) to process the given text and the question in order to predict or generate the answers (Hermann et al., 2015) . Attention mechanism is also widely used on top of RNNs in order to match the question with the given passage (Hermann et al., 2015; Chen et al., 2016) . Given that answers often come from the given passage, Pointer Network has been adopted in a few studies in order to copy tokens from the given passage as answers (Kadlec et al., 2016; Trischler et al., 2016) . Compared with existing work, we use match-LSTM to match a question and a given passage, and we use Pointer Network in a different way such that we can generate answers that contain multiple tokens from the given passage.

Memory Networks (Weston et al., 2015) have also been applied to machine comprehension (Sukhbaatar et al., 2015; Kumar et al., 2016; Hill et al., 2016) , but its scalability when applied to a large dataset is still an issue. In this work, we did not consider memory networks for the SQuAD/MSMARCO datasets.

The setting of visual question answering (Antol et al., 2015) is quite similar to machine comprehension, while their answers are usually very short. So the sequence order of the word-level attention representation used to align the figure and the question (Xu & Saenko, 2016; Fukui et al., 2016; Lu et al., 2016) , are not used in VQA. While our model focus on the word-by-word attention and use LSTM to concatenate the aligned pairs and that would be helpful to generate a longer sequence as answer.

5. CONCLUSIONS:

In this paper, We developed two models for the machine comprehension problem defined in the Stanford Question Answering (SQuAD) and A Human-Generated MAchine Reading COmprehension (MSMARCO) datasets, both making use of match-LSTM and Pointer Network. Experiments on the SQuAD and MSMARCO datasets showed that our second model, the boundary model, could achieve a performance close to the state-of-the-art performance on the SQuAD dataset and achieved the state-of-the-art on the MSMARCO dataset. We also show the boundary model could overcome the early stop prediction problem of the sequence model.

In the future, we plan to look further into the different types of questions and focus on those questions which currently have low performance, such as the "why' questions and multi-sentences related questions. We also plan to test how our models could be applied to other machine comprehension datasets.

Wenpeng Yin, Sebastian Ebert, and Hinrich Schütze. Attention-based convolutional neural network for machine comprehension. arXiv preprint arXiv:1602.04341, 2016.

Yang Yu, Wei Zhang, Kazi Hasan, Mo Yu, Bing Xiang, and Bowen Zhou. End-to-end answer chunk extraction and ranking for reading comprehension. arXiv preprint arXiv:1610.09996, 2016.

:

https://rajpurkar.github.io/SQuAD-explorer/

http://www.msmarco.org/leaders.aspx

https://github.com/shuohangwang/SeqMatchSeq

For the MSMARCO dataset, P is actually consisted of several unrelated documents. The previous state of pre-processing LSTM and match-LSTM to compute the first state of each document is set to zero.

Figures and Tables:

Figure 2: Performance breakdown by answer lengths and question types on SQuAD development dataset. Top: Plot (1) shows the performance of our two models (where s refers to the sequence model , b refers to the boundary model, and e refers to the ensemble boundary model) over answers with different lengths. Plot (2) shows the numbers of answers with different lengths. Bottom: Plot (3) shows the performance our the two models on different types of questions. Plot (4) shows the numbers of different types of questions.

Figure 3: Visualization of the attention weights α for four questions. The first three questions share the same paragraph. The title is the answer predicted by our model.

For example, Hermann et al. (2015) created questions in Cloze style from CNN and Daily Mail highlights. Hill et al. (2016) created the Children's Book Test dataset, which is based on children's stories. Cui et al. (2016) released two similar datasets in Chinese, the People Daily dataset and the Children's Fairy Tale dataset. Instead of creating questions in Cloze style, a number of other datasets rely on human annotators to create real questions. Richardson et al. (2013) created the well-known MCTest dataset and Tapaswi et al. (

Experiment Results on SQuAD and MSMARCO datasets. Here "LSTM with Ans-Ptr" removes the attention mechanism in match-LSTM (mLSTM) by using the final state of the LSTM for the question to replace the weighted sum of all the states. Our best boundary model is the further tuned model and its ablation study is shown in Table4. "en" refers to ensemble method.

Table content: <table><tr><td/><td/><td/><td colspan="2">SQuAD</td><td/><td>MSMARCO</td></tr><tr><td/><td/><td colspan="2">Exact Match</td><td>F1</td><td/><td>BLEU1/2/3/4 / Rouge-L</td></tr><tr><td/><td/><td>Dev</td><td>Test</td><td colspan="2">Dev Test</td><td>Dev &amp; Test</td></tr><tr><td>Human</td><td/><td colspan="5">80.3 77.0 90.5 86.8 -&amp; 46/-/-/-/ 47</td></tr><tr><td>Golden Passage</td><td/><td>-</td><td>-</td><td>-</td><td>-</td><td>19.6 / 18.8 / 18.1 / 17.5 / 32.3 &amp; -</td></tr><tr><td colspan="2">LR (Rajpurkar et al., 2016)</td><td colspan="5">40.0 40.4 51.0 51.0 -</td></tr><tr><td>DCR (Yu et al., 2016)</td><td/><td colspan="5">62.5 62.5 71.2 71.0 -</td></tr><tr><td colspan="2">LSTM with Ans-Ptr (Sequence)</td><td>37.7</td><td>-</td><td>48.5</td><td>-</td><td>10.3 / 7.2 / 5.6 / 4.6 / 21.6 &amp; -</td></tr><tr><td colspan="2">LSTM with Ans-Ptr (Boundary)</td><td>45.2</td><td>-</td><td>55.3</td><td>-</td><td>32.0 / 25.3 / 22.2 / 20.4 / 32.3 &amp; -</td></tr><tr><td colspan="2">mLSTM with Ans-Ptr (Sequence)</td><td>54.4</td><td>-</td><td>68.2</td><td>-</td><td>12.5 / 9.2 / 7.5 / 6.5 / 22.5 &amp; -</td></tr><tr><td colspan="2">mLSTM with Ans-Ptr (Boundary)</td><td>63.0</td><td>-</td><td>72.7</td><td>-</td><td>32.9 / 26.4 / 23.2 / 21.6 / 33.8 &amp; -</td></tr><tr><td colspan="2">Our best boundary model</td><td colspan="5">67.0 66.9 77.2 77.1 40.1 / 33.3 / 30.1 / 28.2 / 37.2 &amp;</td></tr><tr><td/><td/><td/><td/><td/><td/><td>40.7 / 33.9 / 30.6 / 28.7 / 37.3</td></tr><tr><td colspan="7">mLSTM with Ans-Ptr (Boundary+en) 67.6 67.9 76.8 77.0 -</td></tr><tr><td colspan="2">Our best boundary model (en)</td><td colspan="5">71.3 72.6 80.0 80.8 -</td></tr><tr><td>SQuAD</td><td>MSMARCO</td><td/><td/><td/><td/></tr><tr><td>#w in A/Q/P</td><td>#w in A/Q/P</td><td/><td/><td/><td/></tr><tr><td colspan="2">raw 3.1 / 11 / 141 16.3 / 6 / 667</td><td/><td/><td/><td/></tr><tr><td>seq 2.4 / -/ -</td><td>6.7 / -/ -</td><td/><td/><td/><td/></tr><tr><td>bou 3.0 / -/ -</td><td>15.7 / -/ -</td><td/><td/><td/><td/></tr></table>



Table content: <table><tr><td/><td>SQuAD</td><td>MSMARCO</td></tr><tr><td/><td>EM &amp; F1</td><td>BLEU1/2/3/4 &amp; Rouge-L</td></tr><tr><td colspan="3">Best model 67.0 &amp; 77.2 40.1/33.3/30.1/28.2 &amp; 37.2</td></tr><tr><td colspan="3">-bi-Ans-Ptr 66.5 &amp; 76.8 39.9/32.8/29.6/27.9 &amp; 36.7</td></tr><tr><td>-deep</td><td colspan="2">65.9 &amp; 75.8 39.6/32.6/29.4/27.4 &amp; 35.9</td></tr><tr><td>-elem</td><td colspan="2">65.2 &amp; 75.4 38.1/31.4/28.3/26.5 &amp; 35.5</td></tr><tr><td colspan="3">-pre-LSTM 64.0 &amp; 72.9 39.6/32.8/29.8/27.7 &amp; 36.3</td></tr><tr><td>: Statistical analysis on the</td><td/></tr><tr><td>development datasets. #w: num-</td><td/></tr><tr><td>ber of words on average; P: passage;</td><td/></tr><tr><td>Q: question; A: answer; raw: raw</td><td/></tr><tr><td>data from the development dataset;</td><td/></tr><tr><td>seq/bou: the answers generated by</td><td/></tr><tr><td>the sequence/boundary models with</td><td/></tr><tr><td>match-LSTM.</td><td/></tr></table>

Ablation study for our best boundary model on the development datasets. Our best model is a further tuned boundary model by considering "

Table content: <table/>

Peer review (iclr2017):
SUMMARY. This paper proposes a new neural network architectures for solving the task of reading comprehension question answering where the goal is answering a questions regarding a given text passage. The proposed model combines two well-know neural network architectures match-lstm and pointer nets. First the passage and the questions are encoded with a unidirectional LSTM. Then the encoded words in the passage and the encoded words in the questions are combined with an attention mechanism so that each word of the passage has a certain degree of compatibility with the question. For each word in the passage the word representation and the weighted representation of the query is concatenated and passed to an forward lstm. The same process is done in the opposite direction with a backward lstm. The final representation is a concatenation of the two lstms. As a decoded a pointer network is used. The authors tried with two approaches: generating the answer word by word, and generating the first index and the last index of the answer. The proposed model is tested on the Stanford Question Answering Dataset. An ensemble of the proposed model achieves performance close to state-of-the-art models. ---------- OVERALL JUDGMENT I think the model is interesting mainly because of the use of pointer networks as a decoder. One thing that the authors could have tried is a multi-hop approach. It has been shown in many works to be extremely beneficial in the joint encoding of passage and query. The authors can think of it as a deep match-lstm. The analysis of the model is interesting and insightful. The sharing of the code is good.