<!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>Simple Ideas@TESTLINK: RElying On FiNER Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marius Micluța-Câmpeanu</string-name>
          <email>marius.micluta-campeanu@unibuc.ro</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liviu Petrișor Dinu</string-name>
          <email>liviu.p.dinu@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Mathematics and Computer Science, University of Bucharest</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Human Language Technologies Research Center, University of Bucharest</institution>
          ,
          <country country="RO">Romania</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>In this paper, we introduce an intuitive solution to extract relations using solely Named Entity Recognition (NER) models. Our approach achieves the best scores in the TESTLINK task among all other participants by a large margin, with 68.38% F1-score for Spanish and 72.65% F1-score for Basque. General purpose relation extraction methods typically require a classifier to identify the relationship type or leverage generative models. When we are only interested in extracting a single relation type, such approaches might be overly complex or costly. We show that simple methods are capable of performing relation extraction by using NER models, data augmentation and basic text processing, without an additional relation classifier.</p>
      </abstract>
      <kwd-group>
        <kwd>named entity recognition</kwd>
        <kwd>relation extraction</kwd>
        <kwd>transformers</kwd>
        <kwd>data augmentation</kwd>
        <kwd>IberLEF</kwd>
        <kwd>TESTLINK</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Medical and clinical texts have been widely studied for information extraction purposes on
English corpora [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], while other languages received little to no attention regarding dedicated
medical corpora and models. In recent years, there has been an efort to develop these kinds of
resources for languages other than English [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], but not much research has been preoccupied
with lower resource languages.
      </p>
      <sec id="sec-1-1">
        <title>1.1. Task description</title>
        <p>
          The shared TESTLINK task [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] at IberLEF 2023 [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is concerned with correlating laboratory
measurements and tests with textual mentions in clinical narratives. These relations can be
later used as building blocks for other downstream data mining tasks, for example to build
knowledge graphs [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], document treatment methods or uncover interactions between chemicals,
drugs, proteins and diseases [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>
          The TESTLINK task is based on a subset of the E3C Corpus [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], a collection of clinical cases in
multiple European languages. The annotated subset for this task contains Spanish and Basque
texts stored in a variant of the PubTator format to represent relationship information, along
with tokenized versions for each document. Relations are pairs of entity mentions between
sources and targets, where a source is a RML entity (tag for test results and measurements)
and a target is an event describing relevant aspects to the clinical history of patients, such as
symptoms. Following THYME annotations, all targets are comprised of a single token, while
sources consist of one or more tokens.
        </p>
        <p>In this paper, we present our team’s contribution to the TESTLINK task, introducing a
straightforward methodology for extracting basic relations. First, we transform the input into
an adequate internal representation and apply data augmentation. Then, we train one NER
model to predict targets, followed by training a second NER model to predict sources with the
aid of a special token for targets. Finally, we determine the final relations and apply minor
corrections in a post-processing step. This pipeline is summarized in Figure 1.</p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2. Related work</title>
        <p>
          The idea of using special tokens in discriminative transformer models to aid learning certain
patterns dates to at least the original BERT paper [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. SciBERT [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] appears to use a similar
approach using entity markers. They predict the whole relation in one step, using start and
end markers, while in our system we do not insert any end marker. BioGPT [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] formulates the
relation extraction problem as a text generation task and experiments with diferent output label
strategies. Like many generative models, BioGPT requires more compute resources, compared
to our system which uses two lightweight token classifiers.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. System description</title>
      <p>We use two NER models to predict sources and targets at the sentence level, then link the
predictions via post-processing. The first NER model called NER-target predicts all targets in a
sentence. Sentences are determined using the provided tokenizations. For each target identified
by the first model, we create a new example containing a single labeled target using a special
marker token [T].</p>
      <p>Example: albúmina sérica de 2,5 g/dl y proteinuria de 6 g/24 h.
NER-target predicts the targets albúmina and proteinuria.</p>
      <p>We generate two examples for our next NER model:
• [T] albúmina sérica de 2,5 g/dl y proteinuria de 6 g/24 h
• albúmina sérica de 2,5 g/dl y [T] proteinuria de 6 g/24 h</p>
      <p>The second model named NER-source is trained on examples containing target markers, with
labels only for source tokens. Since the added marker is a simple pattern from the model’s
perspective, the model is capable of inferring whether a sentence contains relations based on
the presence of a target marker.</p>
      <p>After sources are predicted for each sentence, we align the inferred sources and targets with
the initial raw text in order to output appropriate text spans. Predictions are ordered by the
start mention of sources since we train and evaluate at the sentence level.</p>
      <p>This simple approach turns out to be very efective for determining relations of a single type.
In the following subsections, we provide additional details regarding our system.</p>
      <sec id="sec-2-1">
        <title>2.1. Pre-processing</title>
        <p>We parse the provided annotations into an internal representation, then we serialize the results
as JSON for easier dataset loading by the training script. Given that most examples have a lot
more tokens than the limit of transformer models, we consider each sentence as an example.
To ease post-processing, we serialize the start ofset of every sentence for all examples, along
with the example id and the sentence number. For the NER-source model, we also store the
target span if that example contains a relation.</p>
        <p>First, we create IOB2 tags (inside, outside, beginning) for target entities in order to train a NER
model to predict targets from raw text. We choose to learn predicting only the targets at this
stage because they consist of a single labeled token. While typical relation extraction methods
use just one NER model to identify both sources and targets as an initial step, our approach
does not require labeling sources because they would be discarded anyway in a later stage.
Moreover, having a lower number of possible labels helps the model achieve better results.</p>
        <p>Since targets are single tokens in the training set, NER-target only needs to predict two labels:
“B-T” (begin target) and “O” (other). An example for NER-target has the following labeling:
(1) [O]Resto [O]de [B-T]parámetros [O]dentro [O]de [O]la [O]normalidad [O].</p>
        <p>The relation extraction part of the system is divided into two pipelines: one for training and
one for inference. This model receives target spans for each sentence from the train set or from
the previous model. When training, source spans are also available. All relations are represented
as source-target tuples of spans (ranges). We convert relations to IOB2 tags containing both
sources and targets. Before each target, we insert a special marker token [T]. Example 1 is
relabeled for the NER-source model in a similar fashion:
(2) [O]Resto [O]de [O][T] [O]parámetros [B-S]dentro [I-S]de [I-S]la [I-S]normalidad [O].</p>
        <p>In order to distinguish between multiple relations in the same sentence, source and target
tokens are labeled with their respective targets, ignoring tags from other relations. If multiple
sources reference one target, modeling a many-to-one relation, we do not want to add the same
target several times to our set of tags, because it would be redundant. In this case, we only add
source tokens. However, if we have a one-to many relation between sources and targets, the
same source token will be added once for each corresponding target (see example 3).</p>
        <p>This strategy allows us to unambiguously determine all separate relationships. It can be seen
as a sliding window approach, asking the NER-source model to focus only on one target at a
time. Moreover, creating additional examples for every target in sentences with multiple targets
acts as a form of data augmentation.</p>
        <p>(3) The example “estudios negativos para bacilo” has a one-to-many relation with the source
“negativos” and the targets “estudios” and “bacilo”.</p>
        <p>The NER-source model will receive two samples:
a. [O][T] [O]estudios [B-S]negativos [O]para [O]bacilo
b. [O]estudios [B-S]negativos [O]para [O][T] [O]bacilo</p>
        <p>For the second NER model, we keep IOB2 tags only for source tokens and convert target
IOB2 tags to O (outside) tags. We choose this strategy because we already have the target
embedded in every example using the special marker token [T]. Similar to the previous NER
model, having fewer labels increases model performance.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Data augmentation</title>
        <p>
          The E3C subset corpus annotated for this task contains 597 relations for Spanish and 1291
relations for Basque, excluding examples without relationships. The small number of labeled
sentences appears to be a limiting factor for our system. With the help of nlpaug library [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ],
we augment both positive and negative examples.
        </p>
        <p>We perform data augmentation using contextual word embeddings by replacing random
words and aligning the result with the original sentence in order to assign proper labels. While
it is possible to perform word insertion or deletion in this scenario, label assignment would be
more problematic due to larger ofsets. The contextual word embeddings for augmentation are
provided by pretrained models used for training.</p>
        <p>Sources, targets and the target marker are copied from the initial sentence without changes
because we cannot aford noisy labels in this task. For numeric values that are not part of
a relation, we perform small perturbations of ±2 for decimal numbers (usually age or large
quantities) and ±0.1 for real numbers (typically measurements). These numerical perturbations
are applied together with the other changes. We chose not to create separate examples for word
substitutions and numeric adjustments because we risk to add too many similar samples which
would lead to overfitting.</p>
        <p>In theory, these alterations could also be applied on labeled tokens since they should not
change the relation or sentence meaning. They were left out in the final implementation due to
corner cases involving intervals and sign changes. We intend to explore this area in future work
because we believe it might help models generalize better in extracting this kind of information.</p>
        <p>The special marker token is not included in this process and is added back afterwards. If a
sentence contains less than 10 words, it is skipped. All augmented examples with a diferent
word count than the original sentence are dropped since we cannot reliably apply any previous
labels.</p>
        <p>We experiment with values between 3 and 6 for the minimum word replacements. We choose
6 substitutions for Spanish and 4 for Basque to minimize the number of discarded samples. We
repeat the augmentation process with diferent multipliers for positive examples containing
relations (in_multiplier) and negative examples without any labels (out_multiplier). Based
on our experiments, we pick the values in Table 1 for these multipliers. We need to augment
with fewer source tokens used in relation extraction due to the fact that there are already
duplicate examples for sentences with several targets.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Entity recognition model</title>
        <p>
          Our first named entity recognition model extracts target tokens from raw text. We use the
popular HuggingFace Transformers library [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] to train a token classification model. For the
Spanish subtask, we use a RoBERTa model pretrained on biomedical and clinical texts [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ],
available as PlanTL-GOB-ES/roberta-base-biomedical-clinical-es on HuggingFace Hub.
For the Basque subtask, there are very few models pretrained specifically for Basque if we
exclude the multilingual ones. We use ixa-ehu/berteus-base-cased [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], a BERT model
trained on news articles and Basque Wikipedia.
        </p>
        <p>All models are trained for 4 epochs with default parameters: AdamW optimizer with a
learning rate of 5 −5 using linear decay and no warmup, weight decay of 1 −2, batch size of 8
samples and 10% examples reserved for validation.</p>
        <p>The inference step demands more post-processing work since transformer-based models
provided by HuggingFace employ a diferent tokenization strategy than the one available in the
TESTLINK dataset. We use spaCy [13] to align the examples prepared by HuggingFace Datasets
with the initial texts. For each predicted target, we create one relation with a dummy source
in order to apply the logic from our preprocessing step. The alignments are needed to output
proper ofsets for the target token.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Relation extraction model</title>
        <p>The previous model is tasked to determine targets. Given a specific target in a sentence, the
relation extraction model learns to predict the relevant source tokens. We process the input in
a manner that allows this step to also become a named entity recognition problem instead of a
relation classification problem.</p>
        <p>When training, we take advantage of gold labels for both sources and targets, with the
latter being converted to the special marker [T] as described earlier in section 2.1. Due to the
similarities between the two models, we apply the same training procedure presented in the
previous section with the same pretrained models.</p>
        <p>At inference, this model expects sentences to have an embedded target marker [T] for
examples that contain a relation, with the possibility to supply this marker through either gold
labels or inference of the first model. Like before, we align the processed text required by this
model with the original text. If the predicted source appears after its corresponding target, we
also have to account for the additional [T] marker and subtract its length from the predicted text
span. Finally, we perform minor corrections for of-by-one errors due to alignment mismatches
and then sort relations by the start mention of the first source token in each relation.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <p>The results of our system along with provided baselines are shown in Table 2 and Table 3. In
the Spanish subtask, we obtain an F1-score of 68.38, with a 13% improvement over the mBERT
baseline with a score of 60.57. For the Basque subtask, our method achieves an F1-score of 72.65,
while the mBERT baseline has a score of 78.56. Our results are significantly better than the
other competing systems. For completeness, we also include the results obtained locally on a
development set extracted from the provided training set.</p>
      <p>Our Spanish submission has an underlying model pretrained on medical and clinical texts,
while the Basque submission is pretrained on generic texts such as news articles. One explanation
for the better results obtained on Basque is that we have more than twice as many annotated
relations for the downstream task, which compensates the lack of a dedicated pretrained model.</p>
      <p>We perform parameter selection for the best performing model for each language using
10-fold cross-validation. The models training employ a validation of their own, meaning that
they are trained on 81% of the initial train set: 10% examples are held out for cross-validation
and 10% of the remaining 90% are reserved for validation during training.</p>
      <p>Throughout our experiments, we noticed a significant gain in performance after adding
more train samples. Given the small number of examples in the training set, even after data
augmentation, we try to use as many samples as possible. Therefore, we train the final system
on the entire train set, leaving only 10% for validation used in training. This approach allows us
to fully utilize the available examples, although it might also lead to some overfit since we do
not perform more splits.</p>
      <p>Regarding the types of errors in our system, we notice other situations besides obvious false
positives (usually acronyms, quantities or numbers) and false negatives. The training data
contains a few ambiguous instances where consecutive tokens form either one relationship or
more. Our model seems to prefer predicting more relations in these scenarios. Example of a
relation split:</p>
      <p>(4) There is one true relation: 29,5 cm x 27,5 cm x 16 cm masa</p>
      <p>The system predicts two relations: 29,5 cm x 27,5 cm masa and 16 cm masa
The reverse situation is also present, as seen in the following example:
(5) There are two true relations: &gt; 2 adenopatías and &lt; 5cm adenopatías</p>
      <p>There is only one predicted relation: &gt; 2 y &lt;5 cm adenopatías</p>
      <p>Sometimes, the text span stops in the middle of a word, which can be fixed relatively easy in
post-processing by leveraging the existing tokenization. Examples of incomplete predictions
are shown below:
(6) True relation: 4340 g/l IgM, predicted relation: 4340 g IgM</p>
      <p>True target: alfafetoproteína, predicted target: alfafe</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion and future work</title>
      <p>In this paper, we presented an alternative method for relation extraction relying solely on NER
models. We have successfully applied this method in the TESTLINK shared task at IberLEF 2023
for linking laboratory results to their respective tests and measurements.</p>
      <p>Our team achieved the first place across all competing teams in both languages. On the
Spanish dataset, we surpass the mBERT baseline score by 8 percentage points regarding F1-score,
while we come close to the mBERT baseline on Basque with less than 6 percentage points below
in F1-score, proving the efectiveness of our approach. One of the main diferences between
our solution and the provided baseline is that we used a monolingual model. We have further
applied our method in the CLinkaRT twin task [14] where we also reached the first place and
performed a few additional experiments [15].</p>
      <p>We provide the source code of our system to promote the design and use of simpler, lightweight
models (available at https://gitlab.com/marius.micluta-campeanu/testlink-clinkart-2023). For
future work, we intend to systematically analyze the system errors more thoroughly and explore
this method in a multilingual environment or with the help of machine translation. Another
unexplored path is finding the minimum amount of context necessary for better results, since
our model relied on sentence-level predictions. Finally, we are interested in further development
of medical applications based on extracted relations.
your text representation models some love: the case for Basque, in: Proceedings of the
Twelfth Language Resources and Evaluation Conference, European Language Resources
Association, Marseille, France, 2020, pp. 4781–4788. URL: https://aclanthology.org/2020.
lrec-1.588.
[13] M. Honnibal, I. Montani, S. Van Landeghem, A. Boyd, spaCy: Industrial-strength Natural</p>
      <p>Language Processing in Python (2020). doi:10.5281/zenodo.7715077.
[14] B. Altuna, G. Karunakaran, A. Lavelli, B. Magnini, M. Speranza, R. Zanoli, CLinkaRT task
overview: building links between clinical tests and their results (2023).
[15] M. Miclut,a-Câmpeanu, L. P. Dinu, Simple Ideas@CLinkaRT: LeaNER and MeaNER Relation
Extraction (2023). (to appear).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Cohan,
          <article-title>SciBERT: A pretrained language model for scientific text</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 (EMNLP-IJCNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Hong Kong, China,
          <year>2019</year>
          , pp.
          <fpage>3615</fpage>
          -
          <lpage>3620</lpage>
          . URL: https://aclanthology.org/D19-1371. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D19</fpage>
          - 1371.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C. P.</given-names>
            <surname>Carrino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Armengol-Estapé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutiérrez-Fandiño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Llop-Palao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pàmies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gonzalez-Agirre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Villegas</surname>
          </string-name>
          ,
          <article-title>Biomedical and clinical language models for Spanish: On the benefits of domain-specific pretraining in a mid-resource scenario</article-title>
          ,
          <year>2021</year>
          . arXiv:
          <volume>2109</volume>
          .
          <fpage>03570</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>B.</given-names>
            <surname>Altuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Agerri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Salas-Espejo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Saiz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zanoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Speranza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lavelli</surname>
          </string-name>
          , G. Karunakaran, Overview of TESTLINK at IberLEF 2023:
          <article-title>Linking Results to Clinical Laboratory Tests</article-title>
          and Measurements,
          <source>Procesamiento del Lenguaje Natural</source>
          <volume>71</volume>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Montes-y Gómez, Overview of IberLEF 2023: Natural Language Processing Challenges for Spanish and other Iberian Languages, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2023), co-located with the 39th Conference of the Spanish Society for Natural Language Processing (SEPLN 2023), CEURWS</article-title>
          .org,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Nicholson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Greene</surname>
          </string-name>
          ,
          <article-title>Constructing knowledge graphs and their biomedical applications</article-title>
          ,
          <source>Computational and structural biotechnology journal 18</source>
          (
          <year>2020</year>
          )
          <fpage>1414</fpage>
          -
          <lpage>1428</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          , P.-T. Lai,
          <string-name>
            <surname>C.-H. Wei</surname>
            ,
            <given-names>C. N.</given-names>
          </string-name>
          <string-name>
            <surname>Arighi</surname>
            ,
            <given-names>Z. Lu,</given-names>
          </string-name>
          <article-title>BioRED: a rich biomedical relation extraction dataset</article-title>
          ,
          <source>Briefings in Bioinformatics</source>
          <volume>23</volume>
          (
          <year>2022</year>
          )
          <article-title>bbac282</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Altuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lavelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Speranza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zanoli</surname>
          </string-name>
          ,
          <article-title>The E3C project: Collection and annotation of a multilingual corpus of clinical cases</article-title>
          , in: J.
          <string-name>
            <surname>Monti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Dell'Orletta</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Tamburini</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the Seventh Italian Conference on Computational Linguistics</source>
          , volume
          <volume>2769</volume>
          of CLiC-It, CEUR-WS, Milan Italy,
          <year>2020</year>
          , pp.
          <fpage>422</fpage>
          -
          <lpage>431</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <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>
          ,
          <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),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          - 1423.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , H. Poon, T.-Y. Liu,
          <article-title>Biogpt: generative pre-trained transformer for biomedical text generation and mining</article-title>
          ,
          <source>Briefings in Bioinformatics</source>
          <volume>23</volume>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ma</surname>
          </string-name>
          , NLP Augmentation, https://github.com/makcedward/nlpaug,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , P. von Platen, C. Ma,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Transformers:
          <article-title>State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          . URL: https://www.aclweb.org/anthology/2020.emnlp-demos.
          <volume>6</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Agerri</surname>
          </string-name>
          , I. San Vicente,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Campos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Saralegi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Soroa</surname>
          </string-name>
          , E. Agirre, Give
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>