<!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>Unsupervised Pre-training for Biomedical Question Answering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vaishnavi Kommaraju?</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Karthick Gunasekaran?</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kun Li?</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Trapit Bansal</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrew McCallum</string-name>
          <email>mccallumg@cs.umass.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivana Williams</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ana-Maria Istrate</string-name>
          <email>aistrateg@chanzuckerberg.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chan Zuckerberg Initiative</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Massachusetts Amherst</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We explore the suitability of unsupervised representation learning methods on biomedical text { BioBERT, SciBert, and BioSentVec { for biomedical question answering. To further improve unsupervised representations for biomedical QA, we introduce a new pre-training task from unlabeled data designed to reason about biomedical entities in the context. Our pre-training method consists of corrupting a given context by randomly replacing some mention of a biomedical entity with a random entity mention and then querying the model with the correct entity mention in order to locate the corrupted part of the context. This de-noising task enables the model to learn good representations from abundant, unlabeled biomedical text that helps QA tasks and minimizes the train-test mismatch between the pre-training task and the downstream QA tasks by requiring the model to predict spans. Our experiments show that pre-training BioBERT on the proposed pre-training task signi cantly boosts performance and outperforms the previous best model from the 7th BioASQ Task 7b-Phase B challenge.</p>
      </abstract>
      <kwd-group>
        <kwd>Biomedical question answering</kwd>
        <kwd>self-supervised data gen- eration</kwd>
        <kwd>language models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Accurate systems for biomedical question-answering have the potential to be
useful for a range of problems including clinical decision making, researching
disease treatments and symptoms, answering user questions and more. The task
of machine reading comprehension (MRC) aims to evaluate this ability, where
the model is presented with a context along with a question regarding the context
and is expected to predict the answer to the question. MRC has received
significant interest, where specially in the general domain several large datasets for
supervised learning of MRC models have been proposed [
        <xref ref-type="bibr" rid="ref14 ref28">14, 28</xref>
        ]. Recently,
selfsupervised pre-training of transformer models [
        <xref ref-type="bibr" rid="ref17 ref24 ref6">6, 17, 24</xref>
        ] with language modeling
objectives has been shown to learn good feature representations and improve
performance on many question-answering tasks [
        <xref ref-type="bibr" rid="ref10 ref6 ref9">6, 9, 10</xref>
        ].
      </p>
      <p>
        In the biomedical domain, large MRC datasets have been scarce as annotating
data can be expensive, and typical datasets, for example training dataset of
BioASQ competitions [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], are signi cantly smaller than general domain datasets
like SQuAD [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], which limits the accuracy of supervised models for biomedical
QA. To overcome this, several recent methods have leveraged di erent avenues
of distant supervision to create large datasets for learning MRC models [
        <xref ref-type="bibr" rid="ref15 ref8">15, 8</xref>
        ].
Moreover, following the success of unsupervised pre-training [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], recent methods
have pre-trained BERT language model on biomedical datasets [
        <xref ref-type="bibr" rid="ref12 ref2 ref4">12, 4, 2</xref>
        ], which
has been shown to learn better representations for biomedical text, improving
performance for biomedical MRC [
        <xref ref-type="bibr" rid="ref12 ref27">12, 27</xref>
        ].
      </p>
      <p>
        In this work, we focus on learning good representations of biomedical text
from unsupervised data that are helpful for QA. To this end, we consider three
popular methods for unsupervised representations in the biomedical domain:
BioBERT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], SciBERT [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and BioSentVec [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. We evaluate the performance
of these methods with ne-tuning on three MRC tasks: factoid, list and yes/no
questions from the BioASQ Task 8b challenge. Further, since transfer learning
from general domain QA datasets has been useful for improving performance on
biomedical QA [
        <xref ref-type="bibr" rid="ref12 ref23">23, 12</xref>
        ], we evaluate transfer from SQuAD [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and PubMedQA
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] datasets when using the pre-trained models and nd improvements when
using these datasets for additional ne-tuning. Finally, to leverage abundant
unlabelled biomedical data, we develop a new pre-training method for improving
biomedical MRC performance.
      </p>
      <p>
        Our pre-training method is focused on learning good representations of
biomedical text and developing reasoning about entities in context to help MRC tasks.
The pre-training approach involves nding mentions of entities, using a
biomedical named entity tagger [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], and corrupting a random entity mention in the
context by replacing it with another random entity mention from the corpus. The
model is then queried with the correct entity mention { similar to a question in
an MRC model { and is required to predict the location of the corrupted entity
mention from the context. As the method does not require expensive human
annotation it bene ts from training on large amounts of biomedical text data.
We use a large corpora of Pubmed abstracts for this pre-training. Moreover, the
pre-training approach minimizes train-test mismatch for MRC and we can reuse
the entire MRC model used in pre-training (including classi cation layers) and
ne-tune it for any particular biomedical MRC task.
      </p>
      <p>We evaluate these approaches on the tasks of factoid, yes/no and list
questions using BioASQ 7b challenge dataset and submit the trained models for the
BioASQ Task 8b Biomedical Semantic QA challenge. The main observations
from this work include:
1. Self Supervised de-noising approach improves the performance for all three
question types.
2. Performance of BioBERT and SciBERT is observed to be comparable.
3. Using general domain QA data, such as SQuAD and PubmedQA, for
additional ne-tuning of the pre-trained model improves performance on
biomedical QA.
4. BioSentVec can be used to supplement BioBERT/SciBERT model's
performance but doesn't perform well on its own.</p>
      <p>We describe the modeling approach that we consider as well as the
pretrained models used in Section 2, describe the proposed self-supervised de-noising
approach in Section 3, present our experimental results and analysis in Section
5, discuss related work in Section 4, and conclude in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Model</title>
      <p>We discuss here the pre-trained models considered and the QA model used for
the three types of questions.
2.1</p>
      <sec id="sec-2-1">
        <title>Pre-trained models: BioBERT and SciBERT</title>
        <p>
          We evaluate the performance of pre-trained language models- BioBERT [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]
and SciBERT [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] for our task. BioBERT and SciBERT are transformer [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]
based models. The input to these is the tokenized question concatenated with
corresponding passage (either abstract or snippet) using a separator token [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
The input is also pre xed with a special CLS token which can be used as a
sentence representation. The representation of each token in input is composed
of the concatenation of the embeddings for the token, segment, and its position.
These embeddings are then passed through multiple layers of self-attention which
yield contextualized representations for each token of the input. For factoid and
list type questions we utilize these contextualized token representations whereas
yes/no questions utilize the CLS representation from the nal layer.
        </p>
        <p>
          BioBERT [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] model was the rst BERT model [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] trained on biomedical
text using the pre-training method introduced by BERT [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. It is pre-trained
on 18B words of PubMed (from abstracts and full text articles) apart from
Wikipedia and Books corpus originally used in the BERT training. BioBERT
largely outperforms BERT and previous state-of-the-art models in a variety of
biomedical text mining tasks when pre-trained on the biomedical corpora. In
three representative biomedical NLP tasks including biomedical named entity
recognition, relation extraction, and question answering, BioBERT outperforms
most of the previous state-of-the-art models.
        </p>
        <p>
          SciBERT [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] was trained on papers from the corpus of semanticscholar.org.
The corpus size was 1.14M research papers with 3.1B tokens and uses the full text
of the papers in training, not just abstracts. SciBERT has its own vocabulary
(scivocab) that's built to best match the training corpus. The training procedure
of SciBERT is similar to BioBERT.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Question answering model</title>
        <p>Our text representations come from BioBERT or SciBERT models. There are
then passed through task-speci c layers for each QA task: yes/no, factoid and
list. The weights of the task-speci c layers as well as the BioBERT/SciBERT
weights are all ne-tuned during the training process. We discuss the model
variations for the three tasks.</p>
        <p>Yes/No: The CLS token embedding from the nal transformer layer is fed
into a fully connected layer to obtain the logit s for the binary classi cation.
The probability of a sequence being \yes" is given by:
p =</p>
        <p>1
1 + exp (c s)
where c is the representation of the [CLS] token obtained from the nal layer of
BioBERT and s is a learnable vector embedding. The cross entropy loss between
the predicted yes probability and the corresponding ground truth is used as the
loss function.</p>
        <p>Factoid/List: The nal layer has a start and end vector denoted by S and E
which are trainable parameters. We compute the probabilities for the ith token
to be the start of the answer and the jth token to be the end of the answer as:
pis =</p>
        <p>expS ti</p>
        <sec id="sec-2-2-1">
          <title>Pi expS ti</title>
          <p>;
pie =
expE ti</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>Pi expE ti</title>
          <p>where ti denotes the ith token's representation from the nal layer of
BioBERT/SciBERT. The loss is de ned by taking the mean of negative log likelihood of start
and end probabilities. For selecting a span, the score of candidate span from
token ti to token tj is then de ned as S ti + E tj
3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Leveraging Unlabeled Data for QA</title>
      <p>
        Obtaining training data for Question Answering (QA) is often time-consuming
and expensive. Most of existing QA datasets are only available for general
domains and biomedical QA datasets are often small. We consider approaches to
leverage unlabeled text to help learn better QA models. Recently, an approach
to use unlabeled text to generate (context, question, answer) tuples for training
factoid models was proposed [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. However, this approach relies on a translation
model to generate questions and good models for biomedical domain are not
readily available. Moreover it only applied to factoid and list type questions.
We consider this approach and introduce a simpler approach which we found to
work well in practice on biomedical QA tasks.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Unsupervised QA by cloze translation [13]</title>
        <p>
          There are two major components of this approach. First, a named entity
extractor detects named entities from a given context. One of the occurrence of the
entity is selected as the required answer for the context. Now to create the
question, the sentence in which that entity occurs is taken and the entity is replaced
with a MASK token. After this step, a cloze type question can be generated
for the sentence containing the MASK token. Then, based on the name entity
that were masked and the masked statement, a rule-based approach generates a
question by selecting a wh* type words (Where, When, How, What, Wh**). For
example, if the noun phrase is a number (eg :\2020"), the question type words
is most likely to be \When". Since the rule based approaches can be prone to
errors, the authors [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] proposed using a seq2seq model to transform the cloze
style question into a natural question.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Self-supervised de-noising</title>
        <p>(a) Factoid/List example</p>
        <p>(b) Yes/No example</p>
        <p>
          The above method requires a trained seq2seq model and based on
preliminary analysis we found many errors in question generation when the model was
applied to biomedical text. We thus propose here a simpler de-noising approach
that doesn't require a question generation component but still helps learning
better QA models from unlabeled data. Since QA tasks often involve questions
about named entities [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], our approach is focused on learning about mentions
of entities in context by nding incorrect entity mentions in a corrupted context.
Moreover, our approach can also help learning about yes/no type of questions
as we describe below.
        </p>
        <p>Factoid/List: The method involves corrupting a given context by randomly
replacing a biomedical entity name present in the context with another entity name
from same entity type. We then query the model with correct entity name as
the question and the answer to this question would be the incorrect entity that
it is replaced with. In the process of locating the corrupted entity location, the
model would understand the semantic meaning of the context. Figure 1a shows
an example for Factoid/List de-noising where the correct entity \Nivolumab" is
replaced by the wrong entity name \Bortezomib" in the context (left shows the
original context with all entities marked in green, and in the right we have the
corrupted context with incorrect entity in red). The correct entity name is posed
as the question and the model has to predict the location where its occurrence
was corrupted with another entity name.</p>
        <p>Yes/No: The generation of QA data is slightly di erent for factoid type of
questions and Yes/No type. In case of Yes/No, we select one biomedical entity
name present in the context. For a yes instance, we feed the correct biomedical
entity name in the question along with the unmodi ed context to the model and
the answer would be \Yes". For a no instance, we replace the biomedical entity
name in the context randomly with another biomedical entity, then we pair the
same wrong biomedical entity name as the question and feed it to the model
and the answer to this question would be a \No". Figure 1b shows the example
for yes/no type where on the left we have the correct context with the entity
name highlighted in green and on the right we have the modi ed context which
remains same for a \yes" type and changed entity name in red for \no" type.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Related Work</title>
      <p>
        Along with the fast development of the NLP area, QA in the biomedical domain
has received much attention from the research community. In BioASQ 2015,
Yenala et al [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] presented a PubMed search engine which leveraged web search
results and domain words, and a new answering ranking rule to improve the
question processing. The authors' approach relies on using the PubMed search
engine to retrieve relevant documents, and then extract the snippet based on
number of common domain words of the top 10 sentences of the retrieved
documents and the question. At the same time, Zhang et al. [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] presented a generic
retrieval model based on sequential dependence model, word embedding and
ranking model for document retrieval. The proposed approach has two
stepssplit the top-ranked documents into sentences, and apply the same approach as
Yenala et al [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] for snippets retrieval.
      </p>
      <p>
        Lee et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] have introduced KSAnswer biomedical QA system in BioASQ
2016. KSAnswer was tested in the BioASQ task 4b phase A challenge. The
model aims to retrieve candidate snippets using a cluster-based language model.
Further, it re-ranks the retrieved top-N snippets using ve independent
similarity models depending on shallow semantic analysis. SentiWordNet based lexical
resource to generate the exact answers for yes/no questions was proposed [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
in 2017 BioASQ challenge. The authors proposed a UMLS meta-thesaurus and
term frequency metrics for answering factoid and list questions whereas a
retrieval model based on UMLS concepts was used for generating ideal answers.
      </p>
      <p>
        Since biomedical QA datasets are usually small, many approaches have
focused on generating QA data from other tasks. EmrQA [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] proposed using
annotated data from other clinical task by converting them into a QA format
using question generation templates. Jin et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] introduced a novel
biomedical question answering dataset created from PubMed abstracts which involves
answering a question by yes/no/maybe. This dataset contains some expert
annotated data, unlabeled and arti cially generated data which is used to netune
BioBERT model. The authors mention that each instance is composed of
question (derived from title), context (derived from abstract), a long answer
(conclusion of abstract) and yes/no/maybe summarizing the conclusion. Since general
domain QA data is abundant, transfer learning from general domain QA data,
such as SQuAD [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], has also been found bene cial for biomedical QA [
        <xref ref-type="bibr" rid="ref12 ref23">23, 12</xref>
        ].
      </p>
      <p>
        Pre-trained language models [
        <xref ref-type="bibr" rid="ref17 ref24 ref6">6, 17, 24</xref>
        ] have shown success in learning
general purpose representations which improve performance on a number of tasks
including QA [
        <xref ref-type="bibr" rid="ref12 ref6">6, 12</xref>
        ]. Unsupervised approach to QA by using cloze statements as
questions was proposed [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] for general domain QA. SpanBERT [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] changed the
BERT training objective to a span-based objective demonstrating improvements.
BioBERT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and SciBERT [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] were introduced as BERT [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] models trained on
biomedical and scienti c text, respectively. Biomedical QA using BioBERT was
used [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] in 2019 BioASQ Task B challenge. Their model outperformed previous
state-of-the-art models.
      </p>
      <p>
        Our pre-training approach requires a model for nding mentions of named
entities in biomedical text. There are now increasingly accurate models that can
be leveraged for this purpose [
        <xref ref-type="bibr" rid="ref12 ref22 ref3 ref7">22, 7, 12, 3</xref>
        ]. Recently, some pre-training approaches
have been proposed to incorporate factual knowledge into pre-trained models [
        <xref ref-type="bibr" rid="ref16 ref29">16,
29</xref>
        ] which also require extracting such named entities from text. While these have
not been applied to biomedical domain and are not focused on QA tasks, they
show promise in incorporating factual knowledge in pre-trained models. Our QA
targeted self-supervised de-noising method has a similar motivation and helps
incorporate knowledge about biomedical named entities during pre-training.
5
5.1
      </p>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <sec id="sec-5-1">
        <title>Datasets</title>
        <p>We primarily use the BioASQ Task 8b-Phase B BioQA dataset to train our
model and participate in the challenge. To compare our results with previous
models, we train and evaluate our model on BioASQ Task 7b- Phase B BioQA
dataset. The dataset contains four main types of questions - Yes/No, Factoid,
List and Summary questions. The task 8b consists of 3243 question, answer pairs
in the training set. The task 8b test dataset is released incrementally in 5 phases
over the period of March - May 2020. Each phase has 100 test questions varying
across di erent question types. Since, we cannot have access to the test sets to
evaluate how each model we build performs, we train and evaluate our model
on BioASQ Task 7b training and golden enriched test data respectively. The
Table 1 shows the statistics of the question types in 7b/8b training and 7b test
sets. We create two variations of the dataset. In one variation we use abstract
from the documents as the context and in another version we use the snippets
provided as the context.</p>
        <p>We use additional training data to pre-train our model. We adopt techniques
to generate more training data from PubMed abstracts as discussed in the earlier
section of self-supervised de-noising. In case of Yes/No, more adversarial
examples were created by pairing random context to questions and answering them as
no type question to address class imbalance. The PubMed database has over 30
million citations for biomedical literature from MEDLINE, life science journals,
and online books.</p>
        <p>
          Further, we use other extractive question answering dataset like SQuAD v1.1
for factoid/list type questions and SQuAD 2.0 and PubmedQA for yes/no type
to train the respective model. Stanford Question Answering Dataset (SQuAD)
[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] is a reading comprehension dataset consisting of over 100,000 questions
posed by crowdworkers on a set of Wikipedia articles, where the answer to each
question is a segment of text from the corresponding reading passage which is
equivalent to a factoid answer to a question and the passage is the context.
PubmedQA [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] dataset with 1k expert-annotated QA consists of yes/no/maybe
answers to each question. All the 'maybe' type questions are removed to match
the yes/no BioASQ format. We convert all datasets to one uni ed format which
is the SQuAD dataset format where each instance has a question, context and
exact answer depending on the type of question.
SciBERT and BioBERT based on BERT-Base-Uncased model with 12-layer,
768-hidden, 16-heads, 340M parameter is used. Each of the datasets are
pretrained for varying no of epochs. For all models, SQuAD dataset is pre-trained
for 2 epochs. A batch size of 16 or 32 with maximum sequence length of 384 is
used for all the models. In case of Yes/No, model is pretrained with PubMedQA
labelled dataset for 8 epochs and de-noising data for 2 epochs. The last step
of training is carried out with BioASQ dataset for 2 to 4 epochs depending on
other datasets the model is pre-trained on. The learning rate used for yes/no
models is 5e-6 and dropout of 0.1. In case of Factoid, the learning rate used is
5e-6. The model is pretrained on de-noising data for 3 epochs and ne-tuned on
BioASQ training data for 8 epochs. For List, similar con gurations as factoid is
exercised and set a threshold of 0.42.
        </p>
        <p>Evaluation Metrics In case of factoid, we take the highest probability answer
as the exact answer. We have three evaluation metrics for factoid- Strict
Accuracy, Lenient Accuracy and MRR. Strict Accuracy evaluates the exact match of
the predicted answer. If the exact answer is present in the top 5 predictions then
we increment the lenient score.</p>
        <p>In case of list, we set a threshold of 0.42 and consider all the predictions above
this threshold as the list of answers to the question. The evaluation metrics for
list are Precision, Recall and F1 score.</p>
        <p>In case of yesno, we use the rst [CLS] from output layer and use a fully
connected layer along with dropout to obtain the logit values. The positive logit
values denote an `yes' while negative denotes a `no'. For each question, all the
logit values for all question-context are added together and if the nal value
obtained is positive then its classi ed as an `yes' otherwise as `no'. The evaluation
metrics used for the yes/no task are Accuracy, F1 score, F1 yes and F1 no scores.
5.3</p>
      </sec>
      <sec id="sec-5-2">
        <title>Models</title>
        <p>We develop di erent models for each type of questions. For all the tasks, our base
model is either BioBERT or SciBERT. We ne tune the base model using one
or more datasets chosen from SQuAD, PubMedQA, De-noising/Unsupervised
Cloze Translation(UCT), PubMED, BioASQ depending on the task. The order
in which the datasets are mentioned in the results Table 5 is the order of
netuning our base model.</p>
        <p>
          We also use BioSentVec [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] model to get the embeddings and compute
the similarity score between the question/context and predicted answers. We
add this score to the BioBERT predicted scores to make the nal predictions.
In case of yes/no, a three layer neural network is trained using the embeddings
to get the classi cation.
5.4
        </p>
      </sec>
      <sec id="sec-5-3">
        <title>Results</title>
        <p>
          In this section, we present the results of our models that are evaluated on the
previous edition of BioASQ 7b, Phase B Biomedical Semantic QA challenge test
dataset and on the recent BioASQ 8b, Phase B challenge. The results obtained
by the di erent BioBERT variations on BioASQ 7b test data can be seen in
Tables 4 and 5. A comparison of BioBERT and SciBERT are made in Tables 2
and 5. The results obtained from the leader board of BioASQ 8b challenge [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] is
shown in Table 6.
        </p>
        <p>
          Results on BioASQ 7b test sets Various experiments are performed and
performance of the models are evaluated for the task of question answering that
includes yes/no, factoid and list type of questions. The 7b test batches are used
for evaluating the model performance. The results are shown in Tables 4 and
5. We reproduced the previous winners results using our base model, BioBERT
with SQuAD dataset [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]
        </p>
        <p>The general trend observed is that adding more data tends to improve the
performance of the model. This can be clearly seen from data illustrated in the
Tables 4 and 5. Even when ne-tuned with additional non-biomedical dataset
such as SQuAD, the model is able to perform better than baseline. The use of
PubmedQA along with SQuAD datasets for ne-tuning made the Yes/No model
more robust.</p>
        <p>It is observed that training the model with unsupervised and self supervised
data before ne-tuning with BioASQ data presents a signi cant boost to the test
performance. Unsupervised data generation approach led to increase in model
performance for list and factoid. The performance boost can be seen in-spite
of the fact that the data generated by unsupervised approach was not of
particularly high quality. It can be attributed to the improvement of the model's
generalization ability with the huge amount of data. We can also note that using
the BioSentVec in the list and factoid along with BioBERT also aids the results.
For the factoid and list type question, the BioSentVec is used to generate the
similarity scores and use it to balance the power of BioBERT logit in the last
layer. The gain obtained on the testing set is consistent with our hypothesis that
the correct answer should be similar to the question semantically.</p>
        <p>It can be seen that when the model is trained with self supervised de-noising
approach it either out performed all the variations tried by signi cant margin
or matched unsupervised approach for 7b test. In all three question types, the
increase in performance can be clearly seen. In case of Yes/No type, the
performance of the model greatly improved by the de-noising the data. However, it is
noticed that having too many datasets for ne-tuning with de-noising approach
resulted in slight decrease in the performance comparatively. The key takeaway
is that self supervised approach performed well with less ne-tuning data and
trained faster with fewer epochs than other approaches.</p>
        <p>A comparison is carried out to analyse performance of BioBERT and
SciBERT models in comparable data settings and no signi cant di erence in
performance is observed. Tables 5 and 4 clearly show that there is no much di erence
in performance between SciBERT and BioBERT. In case of Yes/No with only
BioASQ training, it can be seen that the accuracy of SciBERT is higher. This
is mainly due to the large imbalance in the test set towards the positive class
("yes") and the F1 scores are almost the same for both BioBERT and SciBERT
with BioASQ training alone.</p>
        <p>
          Results on BioASQ 8b Challenge The Table 6 reports the results obtained
on the BioASQ 8b challenge which is conducted in 5 phases. The results are put
up on the leaderboard [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. We show the comparison of our model performance
with the best performing team on the leaderboard for each batch and in each
of three type of questions. The challenge ranks the performance based on the
Yes/No Accuracy, Factoid- MRR and List- F Measure metrics. The observations
made from the Tables 4 and 5 can be validated from the 8b challenge results.
        </p>
        <p>In each of the di erent phases, models with di erent con gurations are
submitted for evaluation. In case of Yes/No Question type, for the test batch 1
BioBERT model ne-tuned on BioASQ 8b training dataset is used. In case of
test batch 2, the submission is made by adding in SQuAD ne-tuning to the
BioBERT model. For the 3rd and 4th test phases, the submission is made with
ne-tuning on PubmedQA and SQuAD datasets. The 5th test phase submission
is carried out with our best model which is with de-noising method.</p>
        <p>In case of Factoid, for the test batch 1, the BioBERT model ne-tuned on
SQuAD and BioASQ 8b training data is submitted. For test batch 2, we modi ed
the 8b training data by adding a start index of the exact answer while ne-tuning
the model. The BioBERT model ne-tuned with unsupervised data is submitted
in the test batch 3 while SciBERT base model and with SQuAD is submitted
in test batch 4. The last and nal submission is made with BioBERT model
pretrained on de-noising data.</p>
        <p>In case of List, the model variations follow as mentioned in Factoid. We
submitted BioBERT ne-tuned on SQuAD and BioASQ 8b data for rst two test
batches with modi cations in computing the exact answer start for the second
batch. The BioBERT model ne-tuned with unsupervised data is submitted in
the test batch 3. BioBERT and SciBERT models ne-tuned on SQuAD and
unsupervised data are in submitted test batch 4. The 5th test phase submission
is carried out with our best model that includes training with de-noising data.</p>
        <p>Interestingly, unlike the trend observed in 7b test results 5 for self-supervised
de-noising and unsupervised approaches, pre-training with de-noising approach
gave better MRR and F-Measure for factoid and list respectively. The BioASQ
8b test batch 5 gave an MRR=0.6354 for de-noising approach while it is only
0.5604 for unsupervised approach in case of factoid. Similarly for list, we achieved
F-measure=0.4421 using de-noising data approach while it is 0.2745 for
unsupervised approach.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this work we evaluated pre-trained models, BioBERT and SciBERT, for
biomedical QA. We proposed a novel approach to pre-training, self-supervised
de-noising, which enables learning good representations for QA tasks. The
experimental results show that the approach improves the performance of the models
in all the QA tasks. One main advantage of this approach is that it is simple
and does not require expensive annotation, enabling large-scale pre-training. In
the future, it will be interesting to extend the approach to include more complex
reasoning required for QA, for example reasoning about multiple entities in
context, and including natural form questions generated either through templates
or a learned model.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>This work was supported in part by the UMass Amherst Center for Data
Science and the Center for Intelligent Information Retrieval, in part by the Chan
Zuckerberg Initiative, and in part by the National Science Foundation under
Grant No. IIS-1514053 and IIS-1763618. Any opinions, ndings and conclusions
or recommendations expressed in this material are those of the authors and do
not necessarily re ect those of the sponsor.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bioasq</surname>
          </string-name>
          <article-title>8th edition taskb challenge leaderboard,</article-title>
          <year>2020</year>
          (
          <year>2020</year>
          ), http:// participants-area.bioasq.org/results/8b/phaseB/
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Alsentzer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murphy</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boag</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weng</surname>
            ,
            <given-names>W.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naumann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McDermott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Publicly available clinical bert embeddings</article-title>
          . arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>03323</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Choudhary</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Simultaneously linking entities and extracting relations from biomedical text without mention-level supervision</article-title>
          .
          <source>In: AAAI</source>
          . pp.
          <volume>7407</volume>
          {
          <issue>7414</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Beltagy</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lo</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Scibert: A pretrained language model for scienti c text (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Biosentvec: creating sentence embeddings for biomedical texts</article-title>
          .
          <source>2019 IEEE International Conference on Healthcare Informatics (ICHI)</source>
          pp.
          <volume>1</volume>
          {
          <issue>5</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers). pp.
          <volume>4171</volume>
          {
          <issue>4186</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Greenberg</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bansal</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verga</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Marginal likelihood training of bilstm-crf for biomedical named entity recognition from disjoint label sets</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <volume>2824</volume>
          {
          <issue>2829</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dhingra</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>W.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Pubmedqa: A dataset for biomedical research question answering</article-title>
          .
          <source>In: EMNLP/IJCNLP</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Weld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.S.</given-names>
            ,
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          :
          <article-title>Spanbert: Improving pre-training by representing and predicting spans</article-title>
          . arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>10529</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Keskar</surname>
            ,
            <given-names>N.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCann</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
          </string-name>
          , R.:
          <article-title>Unifying question answering and text classi cation via span extraction</article-title>
          . arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>09286</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>H.g.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.r.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>J.K.</given-names>
          </string-name>
          :
          <article-title>KSAnswer: Question-answering system of kangwon national university and sogang university in the 2016 BioASQ challenge</article-title>
          .
          <source>In: Proceedings of the Fourth BioASQ workshop</source>
          . pp.
          <volume>45</volume>
          {
          <fpage>49</fpage>
          . Association for Computational Linguistics, Berlin, Germany (Aug
          <year>2016</year>
          ). https://doi.org/10.18653/v1/
          <fpage>W16</fpage>
          -3106, https://www.aclweb.org/ anthology/W16-3106
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>So</surname>
            ,
            <given-names>C.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
          </string-name>
          , J.:
          <article-title>Biobert: pretrained biomedical language representation model for biomedical text mining</article-title>
          . arXiv preprint arXiv:
          <year>1901</year>
          .
          <volume>08746</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Denoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riedel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Unsupervised question answering by cloze translation</article-title>
          .
          <source>In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>
          . pp.
          <volume>4896</volume>
          {
          <issue>4910</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <surname>W.:</surname>
          </string-name>
          <article-title>Neural machine reading comprehension: Methods and trends</article-title>
          .
          <source>Applied Sciences</source>
          <volume>9</volume>
          (
          <issue>18</issue>
          ),
          <volume>3698</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Pampari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peng</surname>
          </string-name>
          , J.:
          <article-title>emrqa: A large corpus for question answering on electronic medical records</article-title>
          .
          <source>In: EMNLP</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neumann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Logan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwartz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          :
          <article-title>Knowledge enhanced contextual word representations</article-title>
          .
          <source>In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLPIJCNLP)</source>
          . pp.
          <volume>43</volume>
          {
          <issue>54</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amodei</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Language models are unsupervised multitask learners</article-title>
          .
          <source>OpenAI Blog</source>
          <volume>1</volume>
          (
          <issue>8</issue>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Rajpurkar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Zhang, J.,
          <string-name>
            <surname>Lopyrev</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Squad:
          <volume>100</volume>
          ,000+
          <article-title>questions for machine comprehension of text</article-title>
          .
          <source>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing</source>
          (
          <year>2016</year>
          ). https://doi.org/10.18653/v1/d16-1264, http://dx.doi.org/10.18653/v1/
          <fpage>D16</fpage>
          -1264
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Sarrouti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>El Alaoui</surname>
            ,
            <given-names>S.O.:</given-names>
          </string-name>
          <article-title>A biomedical question answering system in bioasq 2017</article-title>
          . In: BioNLP at Association for Computational
          <source>Linguistics (ACL'17)</source>
          . pp.
          <volume>296</volume>
          {
          <issue>301</issue>
          (
          <year>2017</year>
          ). https://doi.org/10.18653/v1/
          <fpage>W17</fpage>
          -2337
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Tsatsaronis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schroeder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paliouras</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Almirantis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Androutsopoulos</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaussier</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gallinari</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Artieres</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alvers</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zschunke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , et al.:
          <article-title>Bioasq: A challenge on large-scale biomedical semantic indexing and question answering</article-title>
          .
          <source>In: 2012 AAAI Fall Symposium Series</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Vaswani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parmar</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uszkoreit</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polosukhin</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Attention is all you need</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>5998</volume>
          {
          <issue>6008</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>C.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kao</surname>
            ,
            <given-names>H.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Pubtator: a web-based text mining tool for assisting biocuration</article-title>
          .
          <source>Nucleic acids research</source>
          <volume>41</volume>
          (
          <issue>W1</issue>
          ),
          <source>W518{W522</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Wiese</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weissenborn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neves</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Neural domain adaptation for biomedical question answering</article-title>
          .
          <source>In: Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL</source>
          <year>2017</year>
          ). pp.
          <volume>281</volume>
          {
          <issue>289</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , Carbonell, J.,
          <string-name>
            <surname>Salakhutdinov</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          :
          <article-title>Xlnet: Generalized autoregressive pretraining for language understanding</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>08237</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Yenala</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamineni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shrivastava</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chinnakotla</surname>
            ,
            <given-names>M.K.</given-names>
          </string-name>
          :
          <article-title>IIITH at bioasq challange 2015 task 3b: Bio-medical question answering system</article-title>
          .
          <source>In: CLEF</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Yijia</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Biowordvec, improving biomedical word embeddings with subword information and mesh</article-title>
          .
          <source>Scienti c Data</source>
          <volume>6</volume>
          (
          <issue>12</issue>
          <year>2019</year>
          ). https://doi.org/10.1038/s41597-019-0055-0
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeong</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
          </string-name>
          , J.:
          <article-title>Pre-trained language model for biomedical question answering (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A survey on machine reading comprehension: Tasks, evaluation metrics, and benchmark datasets</article-title>
          . arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>11880</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Ernie: Enhanced language representation with informative entities</article-title>
          .
          <source>In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>
          . pp.
          <volume>1441</volume>
          {
          <issue>1451</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.W.</given-names>
            ,
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.H.</given-names>
            ,
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.H.</given-names>
            ,
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.C.</given-names>
            ,
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>A generic retrieval system for biomedical literatures: Ustb at bioasq2015 question answering task</article-title>
          .
          <source>In: CLEF</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>