<!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 Tumor Named Entity Recognition Model Based on Pre-trained Language Model and Attention Mechanism</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xin Tao</string-name>
          <email>taoxinwy@126.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Renyuan Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xiaobing Zhou</string-name>
          <email>zhouxb@ynu.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Information Science and Engineering, Yunnan University</institution>
          ,
          <addr-line>Kunming 650091</addr-line>
          ,
          <country country="CN">P.R. China</country>
        </aff>
      </contrib-group>
      <fpage>447</fpage>
      <lpage>457</lpage>
      <abstract>
        <p>Named entity recognition is to recognize the mention of a certain thing or concept in a text in natural language processing, and it is the basis of many natural language processing tasks such as relation extraction, event extraction, knowledge graph, machine translation, and question answering systems. This paper describes the solution of CANTEMIST's named entity recognition subtask. The core idea of the method is to process it as a sequence labeling task and uses a neural sequence model to solve it. We use a pre-trained language model for semantic feature embedding, a recurrent neural network for semantic inference, and a label-based attention mechanism to predict the output. In the final test, our F1 score is 0.719.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;name entity recognition</kwd>
        <kwd>clinic records</kwd>
        <kwd>multi-head attention mechanism</kwd>
        <kwd>deep learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>At present, cancer has become one of the major diseases endangering human health. About
9 million people die of cancer every year in the world. It is very urgent to find an efective
treatment, but medical resources are dificult to meet the needs in the face of a large number
of patients. In a large number of individual clinical records of cancer patients, extracting
information and knowledge from them can provide help for curing cancer patients. However, in
the face of these free-text clinical records produced by professional doctors, eficient extraction
of information and knowledge is a very challenging task. Natural language processing(NLP)
technology is a very efective method to process individual clinical records. It can extract
information from unstructured or semi-structured data to form structured data for further
research.</p>
      <p>
        The Cantemist [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] task provides a well-annotated data set in which experts annotated
tumorrelated information in the unstructured clinical records of cancer patients. High-quality
annotation data is very helpful for developing NLP systems. The task includes three types of
subtasks:
      </p>
      <p>1. CANTEMIST-NER: finding mentions of tumor morphology in oncology cases.
2. CANTEMIST-NORM: recognition and mapping to concept identifiers from ICD-O-3.
3. CANTEMIST-CODING: oncology clinical coding (multi-label classification) assigning</p>
      <p>ICD-O-3 codes to clinical case documents.</p>
      <p>Our team participates in the CANTEMIST-NER subtask. Named entity recognition(NER) is
the basis of NLP tasks such as relation extraction, event extraction, knowledge graph, machine
translation, and question answering systems. This subtask is aimed to identify related entity
in tumor morphology. A tumor refers to the growth or formation of new abnormal tissues.
The tissue and cell types that make up the morphology usually determine the expected growth
rate, the severity of the disease, and the recommended type of treatment. We deal with NER
using a neural sequence model that combines a pre-training language model with a multi-head
attention mechanism, and our model achieves good result in the final evaluation.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        NER of clinical text is a very popular research direction, and the categories of recognized named
entities are also very large, such as disease, patient, symptom, drug, body state, etc. At present,
there are four research methods: rule-based method, dictionary-based method, traditional
machine learning method, and deep learning method. The rule-based method [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] mainly relies
on the heuristic rules customized by experts. Its advantages are good efect and fast speed.
However, due to the limitations of various forms of rules and expert experience, it is impossible
to list all the rules. Therefore, the scope of application of the rule-based method is limited and
cannot be generalized. In the dictionary-based method [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a medical dictionary database is
used to match entities in text, which is similar to the rule-based method. The disadvantage
is that the dictionary needs to be updated in time to ensure the recognition of new entities.
The traditional machine learning approach takes the NER task as a sequence labeling task and
ifnds the most reasonable label sequence by modeling the sentence sequence. Common models
of traditional machine learning are HHM [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]and CRF [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The performance of this method
depends very much on feature engineering.
      </p>
      <p>
        Thanks to the growth of computing resources, deep learning becomes a competitive method
to solve NLP problems. The deep learning method also regards the NER task as a sequence
labeling task, which can avoid complex feature engineering compared with traditional machine
learning method. For biomedical NER tasks, various deep learning models have achieved a
pleasing performance. There are two main aspects worth paying attention to: The first aspect
is how to improve the reasoning ability of the model. For example, the Bi-LSTM-CRF [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]
model can efectively learn the mutual constraints between tags by using CRF as the output
layer of the model, thereby improving model performance. The second aspect is to use the
large-scale corpus to train language models to obtain better semantic representation, to improve
their semantic expression ability. BioBert [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is a domain-specific language representation
model trained on a large-scale biomedical corpus. It achieves state-of-the-art performance on
biomedical data sets. Our core idea also refers to these two aspects to build models.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>
        In this section, we describe the methods used in the task. Our model is a neural sequence labeling
model, which consists of a semantic representation module, semantic reasoning module, and
output module. As shown in Figure 1: the semantic embedding module of the model is a
pre-train language model similar to BERT [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]; the bidirectional GRU [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is used for semantic
reasoning in the semantic reasoning module; the final output module is based on the attention
mechanism [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>3.1. Task and Dataset Description</title>
        <p>The goal of the CANTEMIST-NER task is to automatically find tumor morphology mentions in
the clinical records of tumor patients. The specific form is to find the corresponding character
ofsets of tumor morphology mentions in the given UTF-8 plain text medical document. The
entire corpus contains a total of 5982 medical documents, of which 1301 are annotated and
4681 are unannotated. Experts annotate some medical documents by referring to the labeling
guidelines that contain rules for annotating morphological tumors in Spanish tumor clinical
cases and map these annotations to CIEO-3. All entities associated with tumor morphology are
labeled MORBOLOGIA_NEOPLASI type, which include the tumor name, anatomical location,
histological morphology, and other information. The distribution of the corpus is shown in
Table 1.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Semantic Representation Module</title>
        <p>
          Semantic representation plays a very important role in the NLP system. Good representational
engineering can efectively improve the performance of the system. We choose BETO [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], a
pre-trained language model based on Transformer architecture, as the semantic representation
module. BETO is a BERT model trained on large Spanish corpus. BETO is trained with the
Dynamic Masking technique [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] and Whole-word Masking technique and is an improvement
over BERT. And BETO has 12 encoder layers of the transformer with 16 attention-heads, using
1024 as hidden size, and 110M parameters in total. Given a word sequence { 1,  2, … ,   }, it
is embedded as a high-dimensional semantic vector after passing through the BETO model
{  ,  2 , ...,   }.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Semantic Reasoning Module</title>
        <p>In the semantic reasoning module, we use a Recurrent Neural Networks (RNNs) to extract
more advanced semantic features. The advantage of RNNs is that it can capture longer distance
dependence when processing sequence information, compared with Convolutional Neural
Networks (CNNs) and Deep Neural Networks (DNNs). Gated Recurrent Neural Networks (GRU)
and Long Short-Term Memory (LSTM) are two variants of RNN, and both GRU and LSTM
are proposed to solve the problem of gradient disappearance or explosion in backpropagation.
However, compared with LSTM, GRU can reduce the amount of computation while achieving
the same efect.</p>
        <p>The multi-layer GRU stack is used to further extract semantic information from the
se{  ;  2 ; ...;  
mantic representation module. For a sentence, the embedded semantic representation  =
 } of the sentence is obtained after the semantic representation module. Then the
embedded semantic representation is fed into the stacked bidirectional GRU layer to obtain a
Finally, the two hidden states are concatenated as the final sentence representation.
sequence of forward hidden states {ℎ⃗1; ℎ⃗2; ...; ℎ⃗ } and backward hidden states {ℎ1; ℎ2; ...; ℎ }.
←
←
←
ℎ = [ℎ⃗ , ℎ ]</p>
        <p>←
 = {ℎ1; ℎ2; ...; ℎ }</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Output Module</title>
        <p>
          During the label decoding phase, we use a hierarchically-refined label attention network [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]
that explicitly utilizes label embedding and captures potential long-term label dependencies by
giving each word an incremental refinement of the label distribution. Label attention network
learns the interaction between semantic representation space and labels representation space
through multi-head attention mechanism [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
tation space. The embedding vector of each label  
is:
Firstly, the given set of candidate labels
        </p>
        <p>= { 1,  2, ...,  | |} are embedded in the label
represen  =  (  )
The representation space of the label is to randomly initialize the embedded vector of each label,
matrix form of the standard attention mechanism is as follows:
where  is to map each label to the representation space by looking up the table.</p>
        <p>Key-value pairs are used to calculate the distribution of attention  in the multi-head attention.
The sentences output by the semantic reasoning module represent ℎ as the query vector, and
the key  
vector and value  
vector are label embedded vector   , namely   =   =  
 . The
  = 
 =</p>
        <p>(,  , 
max(  √ )

) = 
where 
∈ ℝ
 × ,</p>
        <p>∈ ℝ ×| |. And  and ℎ are the sentence length and the hidden state size of
GRU respectively, and the embedding dimension of the label representation feature must equal
to ℎ. The | | is the total number of labels. Compared with the standard attention mechanism,
the interaction of the multi-head attention mechanism can efectively infer multiple potential
label distributions in parallel. The forward propagation of multi-head attention is as follows:
  = 
ℎ  = 
(ℎ
1, ℎ
(   , 
2, ...ℎ
   , 
 ) +  

  )
that can be learned in training.  is the number of parallel heads.
where    ∈ ℝ  × ,</p>
        <p>∈ ℝ  × , and    ∈ ℝ  × are a parametric matrix of linear transformation</p>
        <p>If it is not the last layer of the label attention network, the hidden state of the GRU and the
output of attention are connected as the final output:
 = [  ,   ]
The last layer of label attention network directly outputs the weight matrix in the attention
mechanism as label prediction:
where  ̂</p>
        <p>represents the probability that the  -ℎ word is the  -ℎ label, and  ̂  represents the
predictive label of the  -ℎ word in the sentence.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>This section introduces the experimental of the model, mainly including data preprocessing,
experimental setting, and error analysis.</p>
      <sec id="sec-4-1">
        <title>4.1. Data Preprocessing</title>
        <p>In the data preprocessing stage, we divide the text according to the sentence level and word
level. Then, according to the annotation file, all the sentences are labeled in the format of
BIO. After getting the labeling sequence of each sentence, we clean the sentence. Specific
operations include deleting all punctuation marks and special characters; replacing numbers
with "Cifra"; deleting single-word sentences (mainly subtitles). As shown in Figure 2, the
sentence distribution after preprocessing is counted to provide a reference for the model’s
sentence length hyperparameter setting. As can be seen from Figure 2, most sentences are less
than 80 in length. Considering the Bert model, a masked language model is used for training. In
the masked language model, 15% of the words are divided into several unknown words, and
the unknown words are predicted by other words in the sentence. In the semantic embedding
module of our model, the hyperparameter of sentence length is set to 100 to reduce the noise
caused by excessive zero paddings.</p>
        <p>This task is the same evaluation as most NER tasks, using the F1 score as an evaluation
metric. Because this task only defines one type of entity, there is no data imbalance problem.
The micro-average F1 score can be used to efectively evaluate the system performance. The
calculation formula is as follows:</p>
        <p>− 
( ) =
( ) =
 
 
( 1) = 2
 
 
+  
+  
 × 
 +</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Results</title>
        <p>According to Section 3.4, if the label attention network has only one layer, it is equivalent to
using the Softmax layer. So we compare the performance of the label attention network with
diferent layers. When the number of layers of the label attention network is set to 1, 2, 3, 4,
and the results on the development set are shown in Table 2. We find that the performance
of the development set can be improved, as the number of layers of the tag attention network
increases. However, when the number of layers is increased to 4, the result is not improved.
Besides, the embedded dimension of the label or the hidden state size of the GRU also afects
the performance of the model.</p>
        <p>To compare the efect of the label attention network, we conduct experiments with BERT’s
token classification model as a comparison. BertForTokenClassification 1 is a fine-tuning method
of the BERT model in downstream tasks, and it has obtained an F1 score of 0.924 on the
CoNLL2003 named entity recognition data set. It uses BERT as the semantic embedding and then uses
the fully connected layer as the output model. We replace the semantic embedding module
as the semantic embedding of BertForTokenClassification, to keep the semantic embedding
1https://huggingface.co/transformers/model_doc/bert.html#bertfortokenclassification
the same. The comparison between the results our model and of BertForTokenClassification is
shown in Table 3.</p>
        <p>We also fine-tune the other hyperparameters of the model, and Table 4 shows all the
hyperparameters of the model submitted to the final evaluation results. And the F1 score of the
result on the test set is 0.719. Our experimental implementation is based on the PyTorch [15]
framework and the transformers package [16] is used to get the pre-trained language model. In
the data preprocessing stage, the Spacy [17] is used for tokenization and tagging.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Error Analysis</title>
        <p>We analyze the error of the final submission result, and there are two main errors: the wrong
recognition of the entity boundary and the missed recognition of the entity. For the first type of
error, as shown in Figure 3, the true annotation is "infiltración de médula ósea ", but the model
recognizes two sub-parts "infiltración de " and "ósea". We believe that the model may not be able
to learn the semantic dependency information of long entities because the average entity length
in the training set is 2.30. Therefore, when recognizing such long entities, the model tends to
recognize them as multiple short entities, resulting in the precision of 0.716. Regarding the
second error, we believe that the model’s ability to model sentence semantics is insuficient and
cannot fully recognize entities. This also results in a low recall, with a final recall of 0.721.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>We develop an automated system based on the Cantimist dataset to efectively identify cancer
entities in clinical texts. The system consists of three parts: the semantic embedding module,
the semantic reasoning module, and the output module. In the semantic embedding module,
BEOT, a BERT model trained in Spanish, embeds the text information into a high-dimensional
semantic space and obtains the semantic representation of the text. In the semantic reasoning
module, a bidirectional GRU that can capture long-distance dependencies is used to model
sentences in the forward and backward directions. In the output module, a label-based
multihead attention mechanism is used to infer the constraint relationship between labels. We select
the best hyperparameters through tuning experiments and obtain good results compared with
the baseline in the final evaluation.</p>
      <p>However, our model still has a lot of room for improvement. There are some defects in the
model’s ability to model sentence semantics, such as some entities missing and entity boundary
error. Our future work is mainly to solve the problem of model modeling of sentence semantics.
It may be that this data set is a professional text about tumor morphology and BEOT is trained
on ordinary corpus. The model we proposed is not able to model sentence semantics well. In
the next work, we will try to use graph neural networks to model text semantics to have better
results in the recognition of long entities.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was supported by the Natural Science Foundations of China under Grant 61463050.
[15] A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison,</p>
      <p>L. Antiga, A. Lerer, Automatic diferentiation in pytorch (2017).
[16] T. Wolf, L. Debut, V. Sanh, J. Chaumond, C. Delangue, A. Moi, P. Cistac, T. Rault, R. Louf,
M. Funtowicz, J. Brew, Huggingface’s transformers: State-of-the-art natural language
processing, ArXiv abs/1910.03771 (2019).
[17] M. Honnibal, I. Montani, spacy 2: Natural language understanding with bloom embeddings,
convolutional neural networks and incremental parsing, To appear 7 (2017).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Miranda-Escalada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Farré</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krallinger</surname>
          </string-name>
          ,
          <article-title>Named entity recognition, concept normalization and clinical coding: Overview of the cantemist track for cancer text mining in spanish, corpus, guidelines, methods and results</article-title>
          ,
          <source>in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF</source>
          <year>2020</year>
          ),
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Savova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Murphy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. G.</given-names>
            <surname>Chute</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. J.</given-names>
            <surname>Kullo</surname>
          </string-name>
          ,
          <article-title>Discovering peripheral arterial disease cases from radiology notes using natural language processing</article-title>
          ,
          <source>in: AMIA Annual Symposium Proceedings</source>
          , volume
          <volume>2010</volume>
          , American Medical Informatics Association,
          <year>2010</year>
          , p.
          <fpage>722</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          , W.-S. Han,
          <article-title>Developing a hybrid dictionary-based bio-entity recognition technique, BMC medical informatics and decision making 15 (</article-title>
          <year>2015</year>
          )
          <article-title>S9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Named entity recognition in biomedical texts using an hmm model</article-title>
          ,
          <source>in: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications</source>
          (NLPBA/BioNLP),
          <year>2004</year>
          , pp.
          <fpage>87</fpage>
          -
          <lpage>90</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ratinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>Design challenges and misconceptions in named entity recognition</article-title>
          ,
          <source>in: Proceedings of the Thirteenth Conference on Computational Natural Language Learning (CoNLL-2009)</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Bidirectional lstm-crf models for sequence tagging</article-title>
          ,
          <source>arXiv preprint arXiv:1508</source>
          .
          <year>01991</year>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ma</surname>
          </string-name>
          , E. Hovy,
          <article-title>End-to-end sequence labeling via bi-directional lstm-cnns-crf</article-title>
          ,
          <source>arXiv preprint arXiv:1603.01354</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>So</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Biobert: a pre-trained biomedical language representation model for biomedical text mining</article-title>
          ,
          <source>Bioinformatics</source>
          <volume>36</volume>
          (
          <year>2020</year>
          )
          <fpage>1234</fpage>
          -
          <lpage>1240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gulcehre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>Empirical evaluation of gated recurrent neural networks on sequence modeling</article-title>
          ,
          <source>arXiv preprint arXiv:1412.3555</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: Advances in neural information processing systems</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cañete</surname>
          </string-name>
          , G. Chaperon,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fuentes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pérez</surname>
          </string-name>
          ,
          <article-title>Spanish pre-trained bert model and evaluation data</article-title>
          , in: to appear
          <source>in PML4DC at ICLR</source>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          , arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>11692</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Hierarchically-refined label attention network for sequence labeling</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>08676</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>