<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Comparative Study of Models for Answer Sentence Selection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessio Gravina Federico Rossetto</string-name>
          <email>gravina.alessio@gmail.com</email>
          <email>gravina.alessio@gmail.com fedingo@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Silvia Severini</string-name>
          <email>sissisev@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giuseppe Attardi</string-name>
          <email>attardi@di.unipi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universita` di Pisa</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universita` di Pisa Universita` di Pisa</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Answer Sentence Selection is one of the steps typically involved in Question Answering. Question Answering is considered a hard task for natural language processing systems, since full solutions would require both natural language understanding and inference abilities. In this paper, we explore how the state of the art in answer selection has improved recently, comparing two of the best proposed models for tackling the problem: the Crossattentive Convolutional Network and the BERT model. The experiments are carried out on two datasets, WikiQA and SelQA, both created for and used in open-domain question answering challenges. We also report on cross domain experiments with the two datasets.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Answer Sentence Selection is an important
subtask of Question Answering, that aims at
selecting the sentence containing the correct answer to
a given question among a set of candidate
sentences. Table 1 shows an example of a question
and a list of its candidate answers, taken from the
SelQA dataset
        <xref ref-type="bibr" rid="ref8">(Jurczyk et al., 2016)</xref>
        . The last
column contains a binary value, representing whether
the sentence contains the answer or not.
      </p>
      <p>Answer extraction involves natural language
processing techniques for interpreting candidate
sentences and establishing whether they relate to
questions and contain an answer. More
sophisticated methods of Answer Sentence Selection that
All authors contributed equally to this manuscript.</p>
      <p>
        Copyright c 2019 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).
go beyond Information Retrieval approaches
involve for example tree edit models
        <xref ref-type="bibr" rid="ref6">(Heilman and
Smith, 2010)</xref>
        and semantic distances based on
word embeddings
        <xref ref-type="bibr" rid="ref12">(Wang et al., 2016)</xref>
        .
      </p>
      <p>
        Recently, Deep Neural Networks have also been
applied to this task
        <xref ref-type="bibr" rid="ref9">(Rao et al., 2016)</xref>
        , providing
performance improvements with respect to
previous techniques. The most common approaches
exploit either recurrent or convolutional neural
networks. These models are good at capturing
contextual information from sentences, making them
a nice fit for the problem of answer sentence
selection.
      </p>
      <p>
        Research on this problem has benefited in
the last few years by the development of better
datasets for training systems on this task. These
datasets include WikiQA
        <xref ref-type="bibr" rid="ref13">(Yang et al., 2015)</xref>
        and
SelQA
        <xref ref-type="bibr" rid="ref8">(Jurczyk et al., 2016)</xref>
        . The latter is notable
for its larger size, that reaches more that 60.000
sentence-question pairs. This allows for the
creation of deeper and more complex models, with
less risk of overfit.
      </p>
      <p>
        The state of the art model on the SelQA dataset
        <xref ref-type="bibr" rid="ref8">(Jurczyk et al., 2016)</xref>
        , up to 2018, was
Crossattentive Convolutional Network
        <xref ref-type="bibr" rid="ref5">(Gravina et al.,
2018)</xref>
        , with a score of 0.906 MRR
        <xref ref-type="bibr" rid="ref2">(Craswell,
2009)</xref>
        .
      </p>
      <p>In this paper we present further experiments
with the Cross-attentive Convolutional Network
model as well as experiments that exploit the
BERT language model by Devlin et al. (2018).</p>
      <p>In the following sections we survey relevant
literature on the topic, we describe the datasets used
in our experiments and present the models tested
in our experiments. Finally, we describe the
experiments conducted with these models and report
the results achieved.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>We present a brief survey of the most recent
approaches for answer selection in question
answering.</p>
      <p>Tan et al. (2015) present four Deep Learning
models for answer selection based on biLSTM
(bidirectional LSTM) and CNN (Convolutional
Neural Network), with different complexities and
capabilities. The basic model, called QA-LSTM,
implements two similar flows, one for the
question and one for the answer. The biLSTM builds
a representation of the question/answer pair that
is passed by a max or average pooling layer. The
two flows are then merged with a cosine similarity
matching that expresses how close question and
answer are.</p>
      <p>
        A more complex solution, called
QALSTM/CNN, uses a similar model, which
replaces the pooling layer with a CNN. The
output of biLSTM is sent to a convolution filter,
in order to give a more complete representation
of questions and answers. This filter is followed
by 1-max pooling layer and a fully connected
layer. Finally, the paper presents the most
complex models, QA-LSTM with attention and
QA-LSTM/CNN with attention, that extend the
previous models with the addition of a simple
attention mechanism between question and
answer, which aims to better identify the best
candidate answer to the question. The mechanism
consists in multiplying the biLSTM hidden units
of the answers with the output computed from
the question pooling layer. These models are
tested on the InsuranceQA
        <xref ref-type="bibr" rid="ref4">(Feng et al., 2015)</xref>
        and
TREC-QA
        <xref ref-type="bibr" rid="ref14">(Yao et al., 2013)</xref>
        datasets, achieving
quite good performances.
      </p>
      <p>
        The HyperQA
        <xref ref-type="bibr" rid="ref11">(Tay et al., 2017)</xref>
        model uses
a pairwise ranking objective to represent the
relationship between question and answer
embeddings in a hyperbolic space instead of an euclidean
space. This empowers the model with a
selforganizing ability and enables automatic discovery
of latent hierarchies while learning embeddings of
questions and answers.
      </p>
      <p>Wang et al. (2016) present a model that takes
into account similarities and dissimilarities
between sentences by decomposing and composing
lexical semantics over sentences. In particular the
model represents each word as a vector and
calculates a semantic matching vector for each word
based on all words in the other sentence. Then
each word vector is decomposed into a similar
and a dissimilar component, based on the
semantic matching vector. Afterwards, a CNN model is
used to capture features by composing these parts
and a similarity score is estimated over the
composed feature vectors to predict which sentence is
the answer to the question.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Models</title>
      <p>We describe here the models used in our
experiments.
3.1</p>
      <sec id="sec-3-1">
        <title>Simple Logistic Regression Classifier</title>
        <p>Jurczyk et al. (2016) state that the SelQA dataset
was created through a process that tried to reduce
the number of co-occurrent words, so that simple
word matching methods would be less effective.
To evaluate whether this aim was indeed achieved,
we built a simple linear regression classifier using
as features the sentence and question length, the
number of co-occurrent words and the idf
coefficients of the word co-occurrences.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Cross-attentive Convolutional Network</title>
        <p>
          The Cross-attentive Convolutional Network
(CACN) is a model designed for the task of
Answer Sentence Selection and in 2018 had
achieved state of the art performance
          <xref ref-type="bibr" rid="ref5">(Gravina et
al., 2018)</xref>
          . The model relies on a Convolutional
Neural Network with a double mechanism of
attention between questions and answers. The
model is inspired by the light attentive mechanism
proposed by Yin and Schu¨tze (2017), which it
improves by applying it in both directions to
question and answer pairs.
        </p>
        <p>
          The CACN model achieved top score in the
”Fujitsu AI NLP Challenge 2018” 1, that used the
1https://openinnovationgateway.com/ai-nlp-challenge/
SelQA dataset.
BERT (Bidirectional Encoder Representations
from Transformers)
          <xref ref-type="bibr" rid="ref3">(Devlin et al., 2018)</xref>
          is a
language representation model. BERT usage involves
two steps: pre-training and fine-tuning. During
pre-training, the model is trained on a large
collection of unlabeled text on a language modeling
task. Fine-tuning BERT on a downstream task
involves extending the model with additional layers
tailored to the task, initializing the model with the
pre-trained parameters, and then training the
extended model with labeled data from the task. The
extended model might consist just of a single
output layer. Such models have been shown
capable to achieve state-of-the-art accuracy for a wide
range of tasks, such as question answering,
machine translation, summarization and language
inference.
        </p>
        <p>Several pre-trained BERT models are publicly
available, including the following ones that we
used in our experiments:</p>
        <p>BERT-Base Uncased: with 12 layers, hidden
size of 768 and a total number of 110M
parameters;
BERT-Large Uncased: with 24 layers, hidden
size of 1024 and a total number of 340M
parameters.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Datasets</title>
      <p>We tested the models on two datasets: SelQA and
WikiQA. The first one is the one used in the
Fujitsu AI-NLP Challenge, while the second one is a
commonly used dataset for open-domain Question
Answering. A more detailed description follows.
4.1</p>
      <sec id="sec-4-1">
        <title>SelQA</title>
        <p>
          The SelQA dataset
          <xref ref-type="bibr" rid="ref8">(Jurczyk et al., 2016)</xref>
          was
specifically created to be challenging for question
answering systems, in particular by explicitly
reducing word co-occurrences between question and
answers. Questions with associated long sentence
answers were generated through crowd-sourcing
from articles drawn from the ten most prevalent
topics in the English Wikipedia.
        </p>
        <p>The dataset consists of a total of 486 articles that
were randomly sampled from the topics of: Arts,
Country, Food, Historical Events, Movies,
Music, Science, Sports, Travel, TV. The original data
was preprocessed into smaller chunks, resulting in
8,481 sections, 113,709 sentences and 2,810,228
tokens.</p>
        <p>For each section, a question that can be
answered in that same section by one or more
sentences was generated by human annotators. The
corresponding sentence or sentences that answer
the question were selected. To add some noise,
annotators were also asked to create another set
of questions from the same selected sections
excluding the original sentences previously selected
as answers. Then all questions were paraphrased
using different terms, in order to ensure the QA
algorithm would be evaluated by their reading
comprehension ability rather than from statistical
measures like counting word co-occurrences. Lastly
if ambiguous questions were found, they were
rephrased again by a human annotator.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>WikiQA</title>
        <p>
          The WikiQA dataset
          <xref ref-type="bibr" rid="ref13">(Yang et al., 2015)</xref>
          dataset
consists of 3047 questions sampled from Bing
query logs from the period of May 1st, 2010 to
July 31st, 2011. Each question is associated to
sentences taken from a Wikipedia page assumed
to be the topic of the question based on the user
clicks. In order to eliminate answer sentence
biases caused by key-word matching, the sentences
were taken from the summary of this selected
page.
        </p>
        <p>The WikiQA dataset contains also questions for
which there are no correct sentences to enable
researchers to work on answer triggering.</p>
        <p>This dataset has the drawback to be smaller
compared to SelQA. Because of this, a model is
more likely to over-fit the training set. To avoid
this problem we added some strong regularization
to the models.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <p>5.0.1</p>
      <sec id="sec-5-1">
        <title>GloVe, ELMo and FastText</title>
        <p>We carried out some preliminary experiments on
the SelQA dataset, in order to determine which
embeddings would work best with the CACN.</p>
        <p>
          We tested three types of embeddings: GloVe
(size 300), ELMo
          <xref ref-type="bibr" rid="ref1">(Che et al., 2018)</xref>
          (size 1024)
and FastText
          <xref ref-type="bibr" rid="ref7">(Joulin et al., 2016)</xref>
          (size 300). With
ELMo the model achieved comparable results to
GloVe, but the training time was almost twice.
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>5.1 SelQA results</title>
        <p>The logistic regression classifier obtains a score of
83.36 %, which is 7 points lower than CACN, not
bad considering the simplicity of the model.
Nevertheless this confirms that a simple word
matching method is not competitive with more
sophisticated methods on SelQA.</p>
        <p>CACN was the best performing model on the
Fujitsu AI NLP Challenge 2018, with a MRR of
90.61 %.</p>
        <p>After the introduction of BERT, we decided to
compare CACN with several versions of BERT,
both alone and in combination with CACN.</p>
        <p>We tried a few variant approaches. First, we
fine-tuned a fully connected layer on top of BERT,
leaving his parameters frozen, on the SelQA
training set. This model achieved 91.17, a marginal
improvement over CACN.</p>
        <p>We then explored adding different networks on
top of the BERT architecture.</p>
        <p>We added a full CACN, on top of either the
BERT-Base and BERT-Large models, with no
improvement and even a drop with BERT-Large.
Also in this case we froze the parameters of the
BERT model.</p>
        <p>Since these experiments did not provide
improvements, we didn’t try to train the entire model.</p>
        <p>The best results were achieved by fine-tuning
the BERT model on the SelQA dataset with a
simple feed-forward layer, that achieved an
impressive improvement of about 5 points to a MRR
score of 95.29 %. Fine-tuning required about 4
hours on a server with an Nvidia P100 GPU.</p>
        <p>The results of all our experiments on SelQA are
summarized in table 3.
5.2</p>
      </sec>
      <sec id="sec-5-3">
        <title>WikiQA results</title>
        <p>In the experiments with CACN on WikiQA, we
removed from the training set questions with no
correct answer, but left the test set unchanged, so
that the results are comparable with thos in the
literature. This was done to preserve a similar
structure to the SelQA dataset, which contains at least</p>
      </sec>
      <sec id="sec-5-4">
        <title>Model</title>
        <p>LR Classifier
CACN GloVe
BERT-Base + FCN
BERT-Base + CACN
BERT-Large + CACN
BERT-Base Fine-tuned
one correct answer for each question. This
significantly reduced the number of training
examples but, despite this, the MRR score of the CACN
model improved.</p>
        <p>Also in this case we kept the word embeddings
fixed during training the CACN. We also added a
dropout and normalization to regularize the model,
that helped the model to better learn from the
training set.</p>
        <p>We then fine-tuned BERT on the WikiQA
training set, performing full updates to the model,
achieving again a significant improvement to a top
score of 87.53 % MRR.</p>
        <p>From the current leaderboard on the WikiQA
dataset 2, we have extracted the top 5 entries
and added the results with CACN and BERT-Base
fine-tuned, as reported in Table 4.</p>
      </sec>
      <sec id="sec-5-5">
        <title>Model</title>
        <p>
          BERT-Base Fine-tuned
Comp-Clip + LM + LC
RE2
HyperQA
          <xref ref-type="bibr" rid="ref11">(Tay et al., 2017)</xref>
          PWIM
CACN
          <xref ref-type="bibr" rid="ref5">(Gravina et al., 2018)</xref>
          In this section we report the results of our
crossdomain experiments. The aim was to evaluate how
well the CACN model performs in a context
different from the one in which it was trained. In other
words, we test the transfer learning ability of the
model to a different domain.
        </p>
        <p>The experiments consisted in training a model
on one dataset and then testing it on the other one.
We report in Table 5 the results of these
experiments.</p>
        <p>2https://paperswithcode.com/sota/question-answeringon-wikiqa
82.95%
76.64%</p>
        <p>The drop in MRR score is small when training
on WikiQA and testing on SelQA and larger in the
other direction.</p>
        <p>This is possibly due to the size of the datasets.
In the second case in fact we are training on only
8000 pairs and testing on more than 80000
question/answer pairs.</p>
        <p>However, the transfer score, computed as the
ratio between the in-domain and out-domain MRR,
is fairly good: about 83% in the SelQA to WikiQA
case and over 76% in the other direction.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>We compared the Cross-attentive Convolutional
Network and several BERT based models on
the task of Answer Sentence Selection on two
datasets.</p>
      <p>The experiments show that a BERT model,
finetuned on an Answer Sentence Selection dataset,
improves significantly the state of the art, with a
gain of 5 to 9 points of MRR score on SelQA
and WikiQA respectively. As a drawback, this
approach takes a considerable amount of time to be
trained even on GPUs.</p>
      <p>The BERT-Base model without fine-tuning
achieves almost the same accuracy as the CACN
with GloVe embeddings, which uses a much
smaller number of parameters in the model. The
CACN also requires less data to train. On the other
hand, BERT is quite effective at leveraging the
knowledge collected from large amounts of
unlabeled text, and at transferring it across tasks.</p>
      <p>We also evaluated the abilities of CACN at
transfer learning. BERT is a model that has been
pre-trained on a large corpus, while CACN
leverages the GloVe embeddings as a starting point for
the training.</p>
      <p>We also exploited the WikiQA and SelQA
datasets in a cross-domain experiment using
CACN. We found that the model maintains a good
score across domains, with a transfer score of
about 83% from SelQA to WikiQA.</p>
      <p>We confirmed that the SelQA dataset is not
easily solvable using simple word-occurrences
methods like a logistic regression classifier on word
count features.</p>
      <p>BERT models confirmed their superiority to
previous state of the art models for the task of
Answer Sentence Selection. This was to be expected
since they perform quite well also on the more
complex task of Reading Comprehension, which
requires not only to select a sentence but also to
extract the answer from that sentence.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>The experiments were carried on a Dell server
with 4 Nvidia GPUs Tesla P100, partly funded by
the University of Pisa under grant Grandi
Attrezzature 2016.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Wanxiang</given-names>
            <surname>Che</surname>
          </string-name>
          , Yijia Liu, Yuxuan Wang,
          <string-name>
            <given-names>Bo</given-names>
            <surname>Zheng</surname>
          </string-name>
          , and Ting Liu.
          <year>2018</year>
          .
          <article-title>Towards better UD parsing: Deep contextualized word embeddings, ensemble, and treebank concatenation</article-title>
          .
          <source>In Proceedings of the CoNLL</source>
          <year>2018</year>
          <article-title>Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies</article-title>
          , pages
          <fpage>55</fpage>
          -
          <lpage>64</lpage>
          , Brussels, Belgium, October. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Nick</given-names>
            <surname>Craswell</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Mean Reciprocal Rank</article-title>
          . In Ling Liu and
          <string-name>
            <surname>M. Tamer O</surname>
          </string-name>
          ¨ zsu, editors,
          <source>Encyclopedia of Database Systems</source>
          . Springer US, Boston, MA.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Jacob</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          . arXiv preprint arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Minwei</given-names>
            <surname>Feng</surname>
          </string-name>
          , Bing Xiang,
          <string-name>
            <surname>Michael R. Glass</surname>
            ,
            <given-names>Lidan</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            , and
            <given-names>Bowen</given-names>
          </string-name>
          <string-name>
            <surname>Zhou</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Applying deep learning to answer selection: A study and an open task</article-title>
          .
          <source>arXiv preprint arXiv:1508</source>
          .
          <fpage>01585</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Alessio</given-names>
            <surname>Gravina</surname>
          </string-name>
          , Federico Rossetto, Silvia Severini, and
          <string-name>
            <given-names>Giuseppe</given-names>
            <surname>Attardi</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Cross attention for selection-based question answering</article-title>
          .
          <source>In NL4AI@ AI* IA</source>
          , pages
          <fpage>53</fpage>
          -
          <lpage>62</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Michael</given-names>
            <surname>Heilman</surname>
          </string-name>
          and
          <string-name>
            <given-names>Noah A.</given-names>
            <surname>Smith</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Tree edit models for recognizing textual entailments, paraphrases, and answers to questions</article-title>
          . In Human Language Technologies:
          <article-title>The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics</article-title>
          , HLT
          <volume>10</volume>
          , pages
          <fpage>1011</fpage>
          -
          <lpage>1019</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Armand</given-names>
            <surname>Joulin</surname>
          </string-name>
          , Edouard Grave, Piotr Bojanowski, Matthijs Douze, Hrve Jgou, and
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Fasttext.zip: Compressing text classification models</article-title>
          .
          <source>cite arxiv:1612</source>
          .03651Comment: Submitted to
          <string-name>
            <surname>ICLR</surname>
          </string-name>
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Tomasz</given-names>
            <surname>Jurczyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Michael</given-names>
            <surname>Zhai</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Jinho D.</given-names>
            <surname>Choi</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>SelQA: A New Benchmark for Selectionbased Question Answering</article-title>
          .
          <source>In Proceedings of the 28th International Conference on Tools with Artificial Intelligence, of ICTAI'16</source>
          , pages
          <fpage>820</fpage>
          -
          <lpage>827</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Jinfeng</given-names>
            <surname>Rao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Hua</given-names>
            <surname>He</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Jimmy</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Noisecontrastive estimation for answer selection with deep neural networks</article-title>
          .
          <source>In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM 16)</source>
          , pages
          <fpage>1913</fpage>
          -
          <lpage>1916</lpage>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Ming</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Bing</given-names>
            <surname>Xiang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Bowen</given-names>
            <surname>Zhou</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Lstmbased deep learning models for non-factoid answer selection</article-title>
          .
          <source>CoRR, abs/1511</source>
          .04108.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Yi</given-names>
            <surname>Tay</surname>
          </string-name>
          , Anh Tuan Luu, and Siu Cheung Hui.
          <year>2017</year>
          .
          <article-title>Enabling efficient question answer retrieval via hyperbolic neural networks</article-title>
          .
          <source>CoRR, abs/1707</source>
          .07847.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Zhiguo</given-names>
            <surname>Wang</surname>
          </string-name>
          , Haitao Mi, and
          <string-name>
            <given-names>Abraham</given-names>
            <surname>Ittycheriah</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Sentence similarity learning by lexical decomposition and composition</article-title>
          .
          <source>In Proceedings of COLING</source>
          <year>2016</year>
          ,
          <source>the 26th International Conference on Computational Linguistics: Technical Papers</source>
          , pages
          <fpage>1340</fpage>
          -
          <lpage>1349</lpage>
          .
          <article-title>The COLING 2016 Organizing Committee</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Yi</given-names>
            <surname>Yang</surname>
          </string-name>
          , Scott Wen tau Yih, and
          <string-name>
            <given-names>Chris</given-names>
            <surname>Meek</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>WikiQA: A challenge dataset for open-domain question answering</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing. ACL Association for Computational Linguistics</source>
          , September.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Xuchen</given-names>
            <surname>Yao</surname>
          </string-name>
          , Benjamin Van Durme,
          <string-name>
            <surname>Chris</surname>
            <given-names>CallisonBurch</given-names>
          </string-name>
          , and
          <string-name>
            <given-names>Peter</given-names>
            <surname>Clark</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Answer extraction as sequence tagging with tree edit distance</article-title>
          .
          <source>In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , pages
          <fpage>858</fpage>
          -
          <lpage>867</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Wenpeng</given-names>
            <surname>Yin</surname>
          </string-name>
          and Hinrich Schu¨tze.
          <year>2017</year>
          . Attentive Convolution. CoRR.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>