<!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>
      <journal-title-group>
        <journal-title>Workshop on Computational Humanities Research, November</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Domain and Task Adaptive Pretraining for Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Leonard Konle</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fotis Jannidis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Würzburg University</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>1</volume>
      <issue>4</issue>
      <fpage>8</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>All current state-of-the-art systems in NLP utilize transformer based language models trained on massive amounts of text. This paper discusses strategies to adapt these models to historical domains and tasks, typical for research in the Computational Humanities. Using two task-specific corpora from the same domain (literary texts from the 19th Century) and Bert [6] resp. Distilbert [22] as baselines, we can confirm results from a recent study that continuing pretraining on the domain and the task data substantially improves task performance. Training a model from scratch using Electra [5] is not competitive for our data sets.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;NLP</kwd>
        <kwd>Machine Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        knowledge) representations, which considerably improves every natural language processing
task. The usual approach supported by libraries like Huggingface [
        <xref ref-type="bibr" rid="ref25">26</xref>
        ] is to pretrain a model
from scratch on a very large corpus and finetune it on a much smaller collection for a specific
task. Huggingface also provides a collection of pretrained models in many languages that can be
ifnetuned for various standard tasks in a few lines of code. But their use in the Computational
Humanities context is hindered by the lack of historical text corpora to train them from scratch.
      </p>
      <p>There is an important diference between machine learning as it is usually done and the
kind of setup we discuss here: While we have - as usual - only labels for a small set of our
population, we have a closed set of data as our population and we have access to this set. We
do not expect our model to handle yet unseen instances, but we try to achieve the best results
for those instances we have in our corpus/population. This has consequences for our attitude
towards aspects like overfitting and forgetting.</p>
      <p>
        Our paper explores diferent setups to achieve the best results for this kind of setup.
Encouraged by the paper “Don’t stop Pretraining” [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] on domain adaptation via continued pretraining
we adopt their experimental design and apply it on two datasets exemplary for Computational
Humanities.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Domain Adaptation</title>
      <p>
        Due to the sheer mass of text data required to generate a language model, its foundation is
often a heterogeneous collection of large, publicly available domains (Newspaper, Wikipedia,
etc.). On the one hand, this results in a general language representation and is not limited to
these domains, as is confirmed by the performance of these models on other text types. On the
other hand, studies show that substantially better results are achieved if the text type of a task
has already been present in pretraining [
        <xref ref-type="bibr" rid="ref24">25</xref>
        ]. Since the generation of a new language model
enriched with texts of a domain makes neither economic nor ecological sense, the continuation
of pretraining an already existing model seems to be a promising alternative [
        <xref ref-type="bibr" rid="ref13">14</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Task Description</title>
      <sec id="sec-3-1">
        <title>3.1. Named Entity Recognition</title>
        <p>The German Corpus of Novels (DROC) [13] brings together 90 annotated fragments of
Germanlanguage novels (each containing about 200 sentences) mainly from the 19th century. While
It contains over 50,000 manually created annotations on named entities, coreference, direct
speech, as well as speakers and addressees of this direct speech, we just use the tags for named
entities and appellatives (like the ‘butcher’ or the ‘ugly’) as training data for our finetuning
step. This kind of task is used in the context of computational literary studies if all mentions
of characters are to be extracted (with the exception of pronouns), for example in the context
of character networks.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Speech Rendition</title>
        <p>
          The second task on Speech Rendition uses the labeled corpus “Redewiedergabe“ [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], a collection
of segments and full documents from literary texts, news and journal texts, all from the 19th
Century annotated with four types of speech: direct, indirect, free indirect, and reported. We
only use those segments categorized as fictional and formalized the task to a token classification
with five possible classes (including non-speech). In Computational Literary Studies it is often
important to know, whether some part of the text, for example the evaluative description of a
character, can be attributed directly in the form of direct speech or indirectly, for example in
the form of reported speech, to the narrator and therefore is reliable (if the narrator is reliable)
or to another character, and therefore tells the reader at least as much about the speaker as
about the object. On average fiction consists of 20 to 30% of direct speech; add to that the
large amount of other forms of speech rendition and it becomes clear that an astonishingly
large part of fiction is the communication of communication.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Related Research</title>
      <p>
        Domain adaptation via continued pretraining is a frequently focused subarea in NLP research
centered around BERT-like language models. The general benefit of adaptation has been
shown in diverse domains, most prominently medicine [
        <xref ref-type="bibr" rid="ref1 ref10 ref15">16, 10, 1</xref>
        ] and biology [
        <xref ref-type="bibr" rid="ref13 ref17 ref7">14, 18, 7</xref>
        ].
      </p>
      <p>
        All recent approaches on Named Entity Recognition [
        <xref ref-type="bibr" rid="ref14">15</xref>
        ] and Speech Rendition make use of
pretrained Language Models. Brunner et al. (2020) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] train a model for Speech Rendition
with custom fastText and FLAIR embeddings with an additional CRF-Layer which is superior
to a generic German BERT model. Since this paper’s objective is not about finding the best
model for this task, but to show the efect of continued language modeling, we will focus on
BERT-based approaches.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Corpora</title>
      <p>We use a freely available German BERT Model from the Huggingface modelhub trained on
the large text collection Corpus B. The texts from this collection come from various resources,
mainly webcrawls and Wikipedia. In contrast, we composed Corpus S and used just texts
that either come from the same domain as our task data (narratives) or their period (19th
century). Corpus D is a subset of Corpus S containing only texts matching both time period
and domain with our tasks. Corpus T and R are the two corpora discussed above in section
‘task description’ used to finetune models but are also listed here because they are also used
without labels for pretraining.</p>
      <p>CWoimkipmeodniaCrdauwml,pP,aErUaCBraowolksahnodpNceowrpsuCs,raOwplen Subtitles, 2350M</p>
      <sec id="sec-5-1">
        <title>Fiction and newspapers from the 19th and 20th Century 1138M 19th Century fiction 739M 19th Century fiction from the DROC Corpus [ 13] 140k 19th Century fiction from the Speech Rendition Corpus [ 2] 130k</title>
        <sec id="sec-5-1-1">
          <title>5.1. Domain Similarity</title>
          <p>
            From the history of the German language we know that though the diference between
German today and the 19th Century is not as big as compared to Early High German, there is
nevertheless a lot of systematic diferences on all levels of the language system like inflectional
morphology, verbal inflection, morphosyntax, tempus use of verbs, syntax and more [
            <xref ref-type="bibr" rid="ref18">19</xref>
            ]. In
the 19th Century, before the language crisis around 1900, the language of literature usually
followed the precepts of the middle style (genus medium), which was, however, enriched with
pathos, quotes and rhetorical decoration. Since the language crisis, on the other hand, literary
German has been difficult to describe as a common unit, but is something specific to certain
groups or individuals. At the same time, it often defines itself in a frontal position against the
everyday style [
            <xref ref-type="bibr" rid="ref19">20</xref>
            ].
          </p>
          <p>
            To gain an insight how large the diference between our general language Corpus B and
the domain specific corpora D,T and R are, we take the 10.000 most frequent words of the
task datasets (Corpus T and Corpus R) and draw samples from the domain adaptation data
and the data used to train Bert and DistilBert from scratch (Corpus D and Corpus B). The
samples hold the same number of diferent documents and the same document length as the
task datasets they are compared with. We sampled 20 times and calculated the vocabulary
overlap in the 10.000 most frequent words. This simple approach is sufficient in our binary
setting, but in other cases more distinguished measures [
            <xref ref-type="bibr" rid="ref23">24</xref>
            ] for domain similarity should be
used. The results from Table 2 confirms the assumption that Corpus T and R are more similar
to Corpus D than to Corpus B.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Methods</title>
      <p>
        We use BERT1 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] trained on german texts from diverse domains (Corpus B) as a baseline for
both tasks. In addition, we test Distilbert2 [
        <xref ref-type="bibr" rid="ref21">22</xref>
        ] based on the mentioned BERT model. This
model is expected to perform slightly worse than BERT itself but is handy due to its small
size, which results in faster computation time (pretraining and fine-tuning) and lower hardware
requirements.
      </p>
      <p>
        The setup of our experiments includes a two-step procedure, which in the first step, as
proposed by Gururangan et al. (2020) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] continues the pretraining of a model on texts of
the target domain (domain adaptive pretraining, see Fig.1), on the texts of the downstream
task itself (task adaptive pretraining), or both. In the second step, the pretrained models are
ifnetuned for two diferent tasks: Named Entity Recognition and Speech Rendition).
      </p>
      <p>
        As an alternate approach, we train the recently introduced ELECTRA [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] from scratch. We
choose ELECTRA because its pretraining task requires less time and data and it is supposed
to achieve BERT-like results. (Code available on Github3) The finetuning process is in all
setups performed over 10 epochs.
      </p>
      <sec id="sec-6-1">
        <title>6.1. Pre-Training Parameters</title>
        <p>Domain adaptive pretraining is performed by iterating 5 epochs over Corpus D with a learning
rate of 1e-4. Task adaptive pretraining is performed by iterating 50 epochs over Corpus T
with the same learning rate. For the training from scratch, we use Corpus S to train a new
ELECTRA instance. We adopt the settings of ELECTRA-small from its Github Repository4
and trained for 1.6Mio Steps with a batchsize of 64 over 20Mio examples. ELECTRA is used
as an alternate approach where all labeled data and texts from the relevant domain are used to
perform one large pretraining step. For this reason, ELECTRA is not used for task or domain
adaptations.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Results</title>
    </sec>
    <sec id="sec-8">
      <title>8. Discussion</title>
      <p>Our results show that continuing pretraining improves performance substantially and should
be integrated into machine learning tasks. Domain and task adaptation show positive efects
and even better results are achieved with a combination of both.</p>
      <p>At the moment pretraining existing models, in terms of computation efort and prediction
quality, seems to be more efective than training models from scratch. While it will not always
1Model page: https://huggingface.co/bert-base-german-dbmdz-cased
2Model page: https://huggingface.co/distilbert-base-german-cased
3Paper Repository: https://github.com/fotisj/efficient_training
4https://github.com/google-research/electra</p>
      <sec id="sec-8-1">
        <title>DROC</title>
      </sec>
      <sec id="sec-8-2">
        <title>Speech Rendition</title>
      </sec>
      <sec id="sec-8-3">
        <title>Model</title>
      </sec>
      <sec id="sec-8-4">
        <title>Bert</title>
        <p>Base F1 (std) .859 (.032)
Domain .863 (.041)
Task .882 (.039)
Task+Domain .927 (.029)</p>
      </sec>
      <sec id="sec-8-5">
        <title>Model</title>
      </sec>
      <sec id="sec-8-6">
        <title>Bert</title>
        <p>Base F1 (std) .538 (.086)
Domain .637 (.234)
Task .587 (.403)
Task+Domain .691 (.136)</p>
      </sec>
      <sec id="sec-8-7">
        <title>DistilBert</title>
        <p>.838 (.32)
.854 (.028)
.853 (.031)
.893 (.043)</p>
      </sec>
      <sec id="sec-8-8">
        <title>DistilBert</title>
        <p>.455 (.04)
.557 (.356)
.568 (.18)
.655 (.132)</p>
      </sec>
      <sec id="sec-8-9">
        <title>Electra</title>
        <p>.791 (0.03)
n.a.
n.a.
n.a.</p>
        <p>Electra
.373 (.057)
n.a.
n.a.
n.a.
be an option to perform a domain adaptation due to the lack of suitable data, task adaptation
can be performed in every setup.</p>
        <p>
          Research on distilling language models shows that it is possible to create smaller versions
of large pretrained models with minor performance loss [
          <xref ref-type="bibr" rid="ref20">21</xref>
          ]. We show that adaptation steps
can enhance those models (DistilBert) to produce results comparable to their teacher models
(BERT).
        </p>
        <p>From the perspective of traditional machine learning paradigms, 50 iterations on a small
chunk of data might seem like a dangerous case of overfitting. But in this setup, the model
cannot memorize the correct solution, but only build a better representation of the task data.
The language model is basically overfitted on the task data (see fig.2), and the finetuned
model performs well on this basis. We assume that this setup may be specifically helpful in the
context of Computational Humanities research with limited and closed data sets. A typical
danger in the application of ML in companies and similar contexts is that new data is drawn
from a diferent distribution and therefore, the performance of the model decreases or it fails.
In the context of closed data sets it is feasible to pretrain on the task data to achieve the best
performance.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>9. Future Work</title>
      <p>In our experiment, the task-specific corpus represented the collection a researcher wants to do
prediction on. Following experiments will test what happens when we enlarge this collection.
The overfitting of the language model should still be helpful for the task on a similar level, but
this probably depends on questions like the size of the collection and its similarity to the task
corpus.</p>
      <p>This paper applied a rather straightforward domain adaptation considering just one
collection of texts (Corpus D) from the same domain as the task. But in many cases, specifically,
when dealing with older texts or rare text types, there is no corpus large enough fulfilling both
the text type and the time constraint. For this reason, we will explore domain adaptation
with multiple corpora and how they should be arranged in size, training time, and order. An
adaptation of a model trained from Wikipedia to baroque poems could be done by training
on a large collection of poems and in a second step on as many baroque texts as possible or
vice-versa. Likewise promising is the idea to train a model from contemporary language back
to a certain point in literary history by pretraining on slices of 10-50 years. Such a fine-grained
selection would lead to settings with very small datasets and raises the question if these can
still be used for pretraining and the relation between performance gain and corpus size in
general.</p>
      <p>
        Another issue we came across is early stopping. When training a model from scratch
additional steps through training examples will always enhance performance with smaller efects
the longer a training continues, because the learning rate decreases. In such a setting early
stopping is used to stop the process at a point where the performance gain can no longer
justify the computational efort. In this small study, we simply adopted the number of trained
epochs from Gururangan et al. (2020) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], but the better approach would be to bind the early
stopping mechanism to performance gain at the task we actually try to adapt to. On the other
hand, this would increase training time, because it requires the execution of the whole task
training for every epoch or n steps. This would add an unpleasant complexity, especially when
considering training task hyperparameters and multiple pretraining corpora.
      </p>
      <p>
        All of these decisions need to face the fact that neural language models can forget data
they have been trained on a few steps ago. This phenomenon is referred to as catastrophic
forgetting [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and there are techniques to reduce memory loss like negative transfer [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], hard
attention [
        <xref ref-type="bibr" rid="ref22">23</xref>
        ], weight freezing [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] or tuning the learning rate decay [
        <xref ref-type="bibr" rid="ref26">27</xref>
        ], these approaches lower
forgetting in general, but show mixed results for specific datasets and need to be tested under
low resource domain adaptation settings.
      </p>
      <p>These tests should be preceded by considerations on the measurement of domain similarity,
since, in addition to hyperparameters and the amount of available text, these are crucial for
the generalization of results and best practice recommendations.</p>
      <p>The receptivity of a model plays a special role for task adaptation scenarios and needs further
research: if a model is adapted to a labeled dataset over several epochs and shows a strong
performance there, it is necessary to include the research dataset (see Discussion) with the same
intensity in the pretraining to make sure predictions there meet the expected quality. We can
outline two possible scenarios: The first and more simple approach would include the complete
research data in the task adaptation step. But if this leads to decreasing performance, because
the model is not capable to “remember” the whole dataset, we would propose to move a blocking
window over the research data, add its content to task adaptation, perform a prediction after
training and move on to the next segment. The eforts to stop forgetting in neural networks
are strongly motivated by the idea of lifelong learning models, capable of solving every task
they have been trained on no matter how many steps ago. This idea is not only relevant to
domain adaptation but also to task adaptation, which opens up a parallel field with similar
questions. Can the knowledge obtained in a NER Task on newspapers passed through domain
adaptation pretraining still help solve the same task in the new domain? And if this is the
case, does it have to be the same task or is a similar task sufficient (e.g. POS Tagging and
Dependency Parsing or Sentiment and Emotion Analysis)?</p>
      <p>Most of our measured results just difer in small numbers, a finding prevalent in machine
learning research and language model approaches in particular. To give at least some idea of
what is an efect of pretraining and what is just random fluctuation we decided to use
crossvalidation and provide standard deviation of evaluation scores. This is more reliable than
single values and prevents cherry-picking best results, but still does not solve the problem in
general.</p>
      <p>M. Krug et al. “Description of a Corpus of Character References in German Novels
DROC [Deutsches ROman Corpus]”. In: DARIAH Working Paper 27 (2018).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Alsentzer</surname>
          </string-name>
          et al. “
          <article-title>Publicly available clinical BERT embeddings”</article-title>
          . In: arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>03323</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Brunner</surname>
          </string-name>
          et al. “
          <string-name>
            <surname>Das</surname>
          </string-name>
          Redewiedergabe-Korpus.
          <article-title>Eine neue Ressource”</article-title>
          . In: DHd 2019
          <string-name>
            <given-names>Conference</given-names>
            <surname>Abstracts</surname>
          </string-name>
          .
          <year>2019</year>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>106</lpage>
          . doi: https://doi.org/10.5281/zenodo.2600812.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Brunner</surname>
          </string-name>
          et al. “
          <article-title>To BERT or not to BERT - Comparing Contextual Embeddings in a Deep Learning Architecture for the Automatic Recognition of four Types of Speech, Thought and Writing Representation”</article-title>
          .
          <source>In: Proceedings of the 5th Swiss Text Analytics Conference and the 16th Conference on Natural Language Processing</source>
          , SwissText/KONVENS 2020, Zurich, Switzerland, June 23-25,
          <year>2020</year>
          [online only]. Ed. by
          <string-name>
            <given-names>S.</given-names>
            <surname>Ebling</surname>
          </string-name>
          et al. Vol.
          <volume>2624</volume>
          . CEUR Workshop Proceedings. CEUR-WS.org,
          <year>2020</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>40</lpage>
          . url: http: //ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2624</volume>
          /paper5.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          et al. “
          <article-title>Catastrophic forgetting meets negative transfer: Batch spectral shrinkage for safe transfer learning”</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          .
          <year>2019</year>
          , pp.
          <fpage>1908</fpage>
          -
          <lpage>1918</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Clark</surname>
          </string-name>
          et al. “
          <article-title>Electra: Pre-training text encoders as discriminators rather than generators”</article-title>
          . In: arXiv preprint arXiv:
          <year>2003</year>
          .
          <volume>10555</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          et al. “
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding”</article-title>
          . In: arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          et al. “
          <article-title>Deep scaled dot-product attention based domain adaptation model for biomedical question answering”</article-title>
          .
          <source>In: Methods</source>
          <volume>173</volume>
          (
          <year>2020</year>
          ), pp.
          <fpage>69</fpage>
          -
          <lpage>74</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gururangan</surname>
          </string-name>
          et al. “
          <string-name>
            <surname>Don't Stop</surname>
          </string-name>
          <article-title>Pretraining: Adapt Language Models to Domains and Tasks”</article-title>
          . In: arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>10964</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Howard</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruder</surname>
          </string-name>
          . “
          <article-title>Universal language model fine-tuning for text classification”</article-title>
          . In: arXiv preprint arXiv:
          <year>1801</year>
          .
          <volume>06146</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hur</surname>
          </string-name>
          et al. “
          <article-title>Domain Adaptation and Instance Selection for Disease Syndrome Classification over Veterinary Clinical Notes”</article-title>
          .
          <source>In: Proceedings of the 19th SIGBioMed Workshop on Biomedical Language Processing</source>
          .
          <year>2020</year>
          , pp.
          <fpage>156</fpage>
          -
          <lpage>166</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Martin</surname>
          </string-name>
          .
          <source>Speech and Language Processing (3rd ed. Draft)</source>
          .
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kirkpatrick</surname>
          </string-name>
          et al. “
          <article-title>Overcoming catastrophic forgetting in neural networks”</article-title>
          .
          <source>In: Proceedings of the national academy of sciences 114.13</source>
          (
          <year>2017</year>
          ), pp.
          <fpage>3521</fpage>
          -
          <lpage>3526</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          et al. “
          <article-title>BioBERT: a pre-trained biomedical language representation model for biomedical text mining”</article-title>
          .
          <source>In: Bioinformatics 36.4</source>
          (
          <issue>2020</issue>
          ), pp.
          <fpage>1234</fpage>
          -
          <lpage>1240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          et al. “
          <article-title>A survey on deep learning for named entity recognition”</article-title>
          .
          <source>In: IEEE Transactions on Knowledge and Data Engineering</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lin</surname>
          </string-name>
          et al. “
          <article-title>Does BERT need domain adaptation for clinical negation detection?”</article-title>
          <source>In: Journal of the American Medical Informatics Association 27.4</source>
          (
          <issue>2020</issue>
          ), pp.
          <fpage>584</fpage>
          -
          <lpage>591</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>E. W.</given-names>
            <surname>Noreen</surname>
          </string-name>
          .
          <article-title>Computer Intensive Methods for Testing Hypothesis</article-title>
          . Wiley New York,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>N.</given-names>
            <surname>Poerner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Waltinger</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Schütze</surname>
          </string-name>
          . “
          <article-title>Inexpensive Domain Adaptation of Pretrained Language Models: A Case Study on Biomedical Named Entity Recognition”</article-title>
          . In: arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>03354</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [19]
          <string-name>
            <surname>P. von Polenz.</surname>
          </string-name>
          “
          <source>Deutsche Sprachgeschichte Bd. III 19. und 20</source>
          .
          <article-title>Jahrhundert”</article-title>
          . In: Berlin, New York,
          <year>1999</year>
          , pp.
          <fpage>338</fpage>
          -
          <lpage>390</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [20]
          <string-name>
            <surname>P. von Polenz.</surname>
          </string-name>
          “
          <source>Deutsche Sprachgeschichte Bd. III 19. und 20</source>
          .
          <article-title>Jahrhundert”</article-title>
          . In: Berlin, New York,
          <year>1999</year>
          , pp.
          <fpage>473</fpage>
          -
          <lpage>484</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>H.</given-names>
            <surname>Sajjad</surname>
          </string-name>
          et al. “
          <article-title>Poor Man's BERT: Smaller and Faster Transformer Models”</article-title>
          . In: arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>03844</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          et al. “
          <article-title>DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter”</article-title>
          . In: arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>01108</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>J.</given-names>
            <surname>Serra</surname>
          </string-name>
          et al. “
          <article-title>Overcoming catastrophic forgetting with hard attention to the task”</article-title>
          . In: arXiv preprint arXiv:
          <year>1801</year>
          .
          <volume>01423</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>V.</given-names>
            <surname>Van Asch</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Daelemans</surname>
          </string-name>
          . “
          <article-title>Using Domain Similarity for Performance Estimation”</article-title>
          .
          <source>In: Proceedings of the 2010 Workshop on Domain Adaptation for Natural Language Processing</source>
          . Uppsala, Sweden: Association for Computational Linguistics,
          <year>July 2010</year>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>36</lpage>
          . url: https://www.aclweb.org/anthology/W10-2605.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wang</surname>
          </string-name>
          et al. “
          <article-title>Superglue: A stickier benchmark for general-purpose language understanding systems”</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          .
          <year>2019</year>
          , pp.
          <fpage>3266</fpage>
          -
          <lpage>3280</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          et al. “
          <article-title>HuggingFace's Transformers: State-of-the-art Natural Language Processing”</article-title>
          . In: ArXiv (
          <year>2019</year>
          ), arXiv-
          <fpage>1910</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          et al. “
          <article-title>Forget Me Not: Reducing Catastrophic Forgetting for Domain Adaptation in Reading Comprehension”</article-title>
          . In: arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>00202</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>