<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Data Augmentation for Robust Character Detection in Fantasy Novels</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Arthur Amalvy</string-name>
          <email>arthur.amalvy@univ-avignon.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vincent Labatut</string-name>
          <email>vincent.labatut@univ-avignon.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Richard Dufour</string-name>
          <email>richard.dufour@univ-nantes.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratoire d'Informatique d'Avignon (LIA), Avignon University</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Laboratoire des Sciences du Numérique de Nantes (LS2N), Nantes University</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <fpage>23</fpage>
      <lpage>32</lpage>
      <abstract>
        <p>Named Entity Recognition (NER) is a low-level task often used as a foundation for solving higher level NLP problems. In the context of character detection in novels, NER false negatives can be an issue as they possibly imply missing certain characters or relationships completely. In this article, we demonstrate that applying a straightforward data augmentation technique allows training a model achieving higher recall, at the cost of a certain amount of precision regarding ambiguous entities. We show that this decrease in precision can be mitigated by giving the model more local context, which resolves some of the ambiguities.</p>
      </abstract>
      <kwd-group>
        <kwd>data augmentation</kwd>
        <kwd>named entity recognition</kwd>
        <kwd>character detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>The Character Detection task is concerned with detecting which characters appear in a text, and
where. We decompose it in two subtasks:
• Named Entity Recognition (NER), whose goal is to find character occurrences in a text.
• Named Entity Disambiguation (NED), which maps character occurrences to their
respective normalized character form.</p>
      <p>
        The result of the character detection task can be used to solve other higher-level problems.
Since its output can afect the performance of other tasks relying on it, such as character network
extraction [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], its degree of success is of importance.
      </p>
      <p>
        Dekker et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] perform a study where they evaluate several NER models for the purpose of
extracting character networks from literary texts. According to their results, performance varies
greatly across novels, ranging from great to pretty low. These authors find that quite a few of
the false negatives produced by the evaluated models stem from two specific types of names:
word names (names that are also regular words, such as Valor or Mercy) and apostrophed
names (such as Rand al'Thor). Replacing them with regular names allows for better detection,
nEvelop-O
CEUR
showing that the issue regarding these names is linked to their form and not to their surrounding
context.
      </p>
      <p>
        We suspect that these shortcomings come from the datasets used to train the NER systems
assessed by Dekker et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Indeed, NER systems are usually trained on the main publicly
available datasets (such as Ontonotes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], CoNLL-2003 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or WikiGold [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]), which come from
a few domains (news, web...). Among these mainstream datasets, none contain texts of the
literary domain1, and annotating new datasets is costly. This means applying of-the-shelf NER
systems to literary texts sufers from these systems integrating knowledge specific only to their
training data.
      </p>
      <p>More precisely, there may be a mismatch in style between typical person names from the
training dataset and from literary texts. This is particularly the case in the fantasy genre, where
character names can have very unusual styles depending on the setting.</p>
      <p>
        In order to try and fix this issue, we showcase the application of a specific data augmentation
technique, mention replacement [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], to inject new character names in the training dataset. Using
this technique, we demonstrate performance improvements for the NER task on a dataset of
texts from the fantasy genre. We release our code and data, that can be used to reproduce our
results, under a free license2.
      </p>
      <p>The rest of this article is organized as follows: first, Section 2 provides a few examples of
related data augmentation works. Then, in Section 3, we present mention replacement and the
experiments we perform to assess its ability to resolve the name mismatch issue we highlighted.
We discuss the results of these experiments in Section 4, and perform further analysis to shed
light on the precision decrease we observe when using mention replacement. Finally, we
conclude with some perspectives regarding NER performance in literary texts.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Data Augmentation and Cross-Domain NER</title>
      <p>
        Generally speaking, data augmentation is the generation of new synthetic training examples.
Data augmentation techniques can be used to address data scarcity problems, or to increase the
diversity of the training dataset to reduce overfitting. While these techniques are ubiquitous in
image processing [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], they are less commonly explored in natural language processing [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and
even less for NER [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        A few techniques have been used to try and fix the domain discrepancy between training
and testing datasets. Ding et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] train a language model to generate new examples by
directly including NER tags in the generated text. Chen et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] train a neural architecture
to transform examples from the training domain to examples closer to the test domain. Very
recently, Yang et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] propose FactMix, a two-step data augmentation process performing
mention replacement followed by masked token replacement. However, as far as we know,
previous works are not specifically concerned with literary texts or the mismatch in person
names between domains.
1While the Litbank dataset [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] specifically contains only literary texts, its annotations concern nested NER, an
arguably harder task.
2https://github.com/CompNet/ddaugNER
Rabinovitch is winding up his terms as ambassador
      </p>
      <p>B-PER O O O O O O O</p>
      <p>mention replacement</p>
    </sec>
    <sec id="sec-4">
      <title>3. Method</title>
      <p>In this section, we first describe mention replacement and how we apply it to texts of the
fantasy genre. We then introduce the datasets we use to assess the performance of this data
augmentation technique. Finally, we describe the specific setting of the experiment we carry to
evaluate its performance, including the model we used and its training parameters.</p>
      <sec id="sec-4-1">
        <title>3.1. Mention Replacement</title>
        <p>
          Dai and Adel [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] survey a few simple data augmentation schemes for NER, including mention
replacement. It consists in generating new examples by replacing tokens from an entity mention
found in the training dataset by tokens from another entity of the same type. Figure 2 shows an
example of this process. Based on the same principle, we propose to randomly replace training
entities with ones from a list of fantasy names to increase the training dataset coverage of this
type of names. If the same entity mention is present multiple times in a training example, we
replace every occurrence with the same fantasy mention when performing augmentation to
avoid inconsistencies. We hope that injecting typical fantasy names into the training dataset
using mention replacement will allow the model to better detect them.
        </p>
        <p>To perform mention replacement, we compose a list of replacement entities that do not
come directly from the evaluation dataset. We scrap the entirety of the names from The Elder
Scrolls series of video games that are mentioned on the Unoficial Elder Scrolls Pages , a wiki
dedicated to The Elder Scrolls universe3. In total, we retrieve 22,748 first names, 4,879 last
names, 647 sufixes and 37 prefixes. We combine these to form new mentions: when performing
mention replacement, we randomly compose a new mention by first sampling from a set of valid
forms ([first name]+[last name], [prefix]+[first name]+[last name], ...). We weight
this sampling by a rough approximation of each form’s frequency. When a form has been
selected, we uniformly sample a name part for each of the form’s elements.</p>
        <p>Since we are interested in knowing the impact of the number of generated examples, we
compare the performance of models trained with diferent augmentation rates. We define the
augmentation rate as the ratio of examples generated over the dataset size, so an augmentation
rate of 1 would mean generating as many examples as there are examples in the dataset.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Datasets</title>
        <p>
          Training Dataset We train our model on a modified version of CoNLL-2003 [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], which is
one of the best known and used NER dataset. CoNLL-2003 is composed of 14,041 sentences
from news articles. Our modifications consist in including honorifics as part of entities to be
consistent with our evaluation dataset (see below). The training dataset contains annotations
for four classes: persons (PER), organizations (ORG), locations (LOC) and miscellaneous (MISC).
Despite restricting ourselves to character detection (PER class), we keep annotations for every
class since we observe that training the model with all classes increases the performance of
NER.
        </p>
        <p>
          Evaluation dataset We use a corrected version of the subset of fantasy novels from the dataset
of Dekker et al. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], where only persons entities (PER) are annotated. We found the dataset
had to be corrected because we noticed a number of encoding, tokenization and annotation
issues. We fixed the encoding and tokenization issues manually. In order to consistently correct
annotation errors, we designed an annotation guide and applied a semi-automated correction
process. It consists of 3 steps:
1. We apply a number of simple heuristics to identify obvious errors:
• When a span is not annotated as a person occurrence, but it appears in the list of character
names for the book, it might be a false negative.
• When a span is annotated as a person occurrence, but it does not appear in this list, it
might be a false positive.
• When a span is annotated as a person occurrence, but the first letter of all of its tokens is
not capitalized, it might be a false positive.
        </p>
        <p>Each time one of these heuristics recommends an annotation change, we manually check if it
is correct before accepting it.
2. We then consider the diferences between the existing annotations and the predictions of a</p>
        <p>
          BERT model [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] fine-tuned for the NER task, and manually reconcile them.
3. Finally, we manually correct the few remaining errors that we could detect.
        </p>
        <p>
          The dataset consists of the first chapter of 17 novels. Together, these chapters are composed
of 5,518 sentences and contain 360 unique person names. Inspired by Taillé et al. [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], we report
in Table 1 the name overlap between our evaluation dataset and:
• The train portion of the CoNLL-2003 [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ];
• Our list of names from The Elder Scrolls, used for mention replacement.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Experiment</title>
        <p>
          We fine-tune a BERT model [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] with an added classification head on our training dataset,
and report its performance on our evaluation dataset depending on the augmentation rate. In
order to obtain stable results, we report the mean of the results from 10 fine-tuning runs for
each augmentation rate that we test. Models without augmentations are trained for two full
epochs, while we adjust the number of training steps for models with augmentation so that they
learn on the same number of examples as models without augmentation. We use a learning
rate of 2 ⋅ 10−5 [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], and we initialize each model with the bert-base-cased checkpoint of the
transformers library [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. At inference time, each model predicts NER tags separately for each
sentence, and we do not provide it with any additional context. Since the evaluation dataset only
contains annotations for the PER class, we simply discard predictions made for other classes.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Results</title>
      <p>
        Results can be seen in Figure 2. We report performance according to the CoNLL-2003
guidelines [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and using the Python seqeval library [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. We observe a notable increase in recall
using augmentation, while precision decreases. The recall increase can be attributed to the
model picking up on more unusual character names, as Table 2 shows.
      </p>
      <p>To try to understand the decrease in precision when using data augmentation, we perform
some additional experiments. Based on our manual investigation of the false positives, we
formulate two hypotheses that we want to test:
ℎ1 Adding more examples with PER entities modifies the class distribution in the dataset,
progressively leading to a situation of class imbalance where these entities are way more
frequent than those of the other classes (LOC, ORG and MISC). As we observe that removing
other entity classes from the training dataset is detrimental to PER detection performance
(possibly because having more classes means the model is better at distinguishing between
them), we suppose that class imbalance can be detrimental as well.
precision
recall</p>
      <p>F1
0:96
0:94
0:92
0:90
0:88
0:86
0:0
0:2</p>
      <p>0:4 0:6
Augmentation rate
0:8
1:0</p>
      <sec id="sec-5-1">
        <title>4.1. Class Imbalance</title>
        <p>To check if the decrease in precision is due to class imbalance, we test two diferent methods to
inject names in the training dataset that should not sufer from the class imbalance problem:
• Upsample and balance: After adding newly generated examples to the dataset, we copy
some of the original examples and add them to the dataset to restore the original class
distribution.
Upsample and Balance
Replace
0:96
0:94
0:92
0:90
0:88
0:86
0:0
precision
0:2</p>
        <p>recall
0:4 0:6
Augmentation rate</p>
        <p>F1
0:8
1:0
0:0
precision
0:2</p>
        <p>recall
0:4 0:6
Augmentation rate</p>
        <p>F1
0:8
1:0</p>
        <p>• Replace: Instead of adding newly generated examples to the dataset, we substitute them
for the original training samples.</p>
        <p>Figure 3 shows the performance of a model trained on a dataset modified with the above
augmentation methods. The upsample and balance strategy still increases recall, but does not
ifx the precision issue. Meanwhile, the replace strategy still makes precision decrease, and
also generally decreases performance for an augmentation rate greater than 20%.</p>
        <p>As none of these two methods are able to fix the precision issue, we conclude that class
imbalance is not a plausible cause of precision decreasing.</p>
      </sec>
      <sec id="sec-5-2">
        <title>4.2. Name Variety and Ambiguous Occurrences</title>
        <p>In order to check ℎ2, we analyze the diference in false positives between a model trained with
augmentation and a model trained without it. As errors can vary between runs, we perform
three training runs for each model and keep the false positives that are consistent between the
runs. We then observe the set of false positives of the model trained with augmentation that
are not present in the set of false positives of the model trained without augmentation. This
allows us to analyze errors that are specific to our augmentation scheme.</p>
        <p>We manually find that for 62% (58/93) of these false positives, the model attributes a PER label
to some tokens even though the context alone is not suficient to know the correct label of the
entity, such as in the following example from Elantris:</p>
        <p>Raoden stood, and as he did, his eyes fell on Elantris again.</p>
        <p>Here, the model correctly predicts that Elantris is a named entity, but gives it the class PER
while Elantris is actually a city (which corresponds to the LOC class). Of course, predicting
the correct class of Elantris in this example would only be a matter of luck even for a perfect
model, as the given context alone is not suficient.</p>
        <p>Overall, this result shows a bias towards the PER class, that was introduced by increasing the
variety of possible names at training time.
0:95
0:90
0:85
0:80
0:75
0:94
0:950</p>
        <p>Raoden stood, and as he did, his eyes fell on Elantris again.</p>
        <p>Resting in the great city's shadow, Kae seemed like an insignificant
village by comparison.</p>
        <p>We define a context size of  as giving the model the  sentences that precede the considered
sentence, as well as the  sentences that follow it.</p>
        <p>Figure 4 shows the efect of giving more context to models trained with augmentation ( The
Elder Scrolls) or without it (Noaug). As can be seen, context is beneficial to both models,
steadily increasing F1-score. Precision increases a lot for the model trained with augmentation,
as previously ambiguous entities are now correctly labeled. Using our previously described
method for error analysis, we find that only 48% (30/63) of the entities found in false positives
are deemed ambiguous for a context size of 1. Meanwhile, the recall augmentation for the Noaug
model can be attributed to it predicting PER entities in previously ambiguous cases. While
adding more context results in greater recall for the Noaug model, it still never surpasses the
recall of the The Elder Scrolls model.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>We demonstrated the usage of a simple data augmentation technique to better detect fantasy
names when performing named entity recognition. While this technique greatly increases
model recall, precision decreases as the model sometimes does not have enough information to
predict the correct class of some entities. We showed that this issue can be mitigated by giving
the model more local information. However, for the same context size, our technique always
results in greater recall but lower precision. In the context of character detection, we argue that
this trade is beneficial: while false positives can be filtered after performing NER (automatically
or manually), false negatives are not easily recovered. We also note that increasing NER context
has a positive impact on recall in general.</p>
      <p>Further work might investigate the role of context in NER. While we showed that it can be
used to disambiguate some mentions, we were only interested in the local context in this paper.
Nevertheless, necessary disambiguation information is not always present near the processed
sentence, and might exist in more remote parts of the novel.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Labatut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Bost</surname>
          </string-name>
          ,
          <article-title>Extraction and analysis of fictional character networks : A survey</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>52</volume>
          (
          <year>2019</year>
          )
          <article-title>89</article-title>
          . doi:
          <volume>10</volume>
          .1145/3344548.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Dekker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. van Erp</surname>
          </string-name>
          ,
          <article-title>Evaluating named entity recognition tools for extracting social networks from novels</article-title>
          ,
          <source>PeerJ Computer Science</source>
          <volume>5</volume>
          (
          <year>2019</year>
          )
          <article-title>e189</article-title>
          . doi:
          <volume>10</volume>
          .7717/ peerj- cs.189.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Weischedel</surname>
          </string-name>
          , E. Hovy,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marcus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Belvin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pradhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ramshaw</surname>
          </string-name>
          , N. Xue,
          <article-title>OntoNotes: A large training corpus for enhanced processing</article-title>
          ,
          <year>2011</year>
          . URL: https://www.cs. cmu.edu/~hovy/papers/09OntoNotes-GALEbook.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. F.</given-names>
            <surname>Tjong Kim Sang</surname>
          </string-name>
          , F. De Meulder,
          <article-title>Introduction to the CoNLL-2003 shared task: Language-independent named entity recognition</article-title>
          ,
          <source>in: 7th Conference on Natural Language Learning</source>
          ,
          <year>2003</year>
          , pp.
          <fpage>142</fpage>
          -
          <lpage>147</lpage>
          . URL: https://aclanthology.org/W03-0419.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Balasuriya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ringland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nothman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Murphy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Curran</surname>
          </string-name>
          ,
          <article-title>Named entity recognition in Wikipedia</article-title>
          ,
          <source>in: Workshop on The People's Web Meets NLP: Collaboratively Constructed Semantic Resources</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>18</lpage>
          . URL: https://aclanthology.org/W09-3302.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Bamman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Popat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <article-title>An annotated dataset of literary entities, in: Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , volume
          <volume>1</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>2138</fpage>
          -
          <lpage>2144</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          - 1220.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>X.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Adel</surname>
          </string-name>
          ,
          <article-title>An analysis of simple data augmentation for named entity recognition</article-title>
          ,
          <source>in: International Conference on Computational Linguistics</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3861</fpage>
          -
          <lpage>3867</lpage>
          . doi:
          <volume>10</volume>
          . 18653/v1/
          <year>2020</year>
          .coling- main.343.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C.</given-names>
            <surname>Shorten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. M.</given-names>
            <surname>Khoshgoftaar</surname>
          </string-name>
          ,
          <article-title>A survey on image data augmentation for deep learning</article-title>
          ,
          <source>Journal of Big Data</source>
          <volume>6</volume>
          (
          <year>2019</year>
          )
          <article-title>60</article-title>
          . doi:
          <volume>10</volume>
          .1186/s40537- 019- 0197- 0.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Gangal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chandar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vosoughi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mitamura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Hovy</surname>
          </string-name>
          ,
          <article-title>A survey of data augmentation approaches for NLP, in: Findings of the Association for Computational Linguistics: ACL-IJCNLP</article-title>
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>968</fpage>
          -
          <lpage>988</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .findings- acl. 84.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ding</surname>
          </string-name>
          , L. Liu,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kruengkrai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Joty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Si</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Miao, DAGA: Data augmentation with a generation approach for low-resource tagging tasks</article-title>
          ,
          <source>in: Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>6045</fpage>
          -
          <lpage>6057</lpage>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <year>2020</year>
          .emnlp- main.488.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Aguilar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Neves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Solorio</surname>
          </string-name>
          ,
          <article-title>Data augmentation for cross-domain named entity recognition</article-title>
          ,
          <source>in: Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>5346</fpage>
          -
          <lpage>5356</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .emnlp- main.434.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Factmix:
          <article-title>Using a few labeled in-domain examples to generalize to cross-domain named entity recognition, arXiv cs</article-title>
          .CL (
          <year>2022</year>
          )
          <volume>2208</volume>
          .11464. doi:
          <volume>10</volume>
          .48550/ARXIV.2208.11464.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</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, in: Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , volume
          <volume>1</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B.</given-names>
            <surname>Taillé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Guigue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gallinari</surname>
          </string-name>
          ,
          <article-title>Contextualized embeddings in named-entity recognition: An empirical study on generalization</article-title>
          ,
          <source>in: Advances in Information Retrieval</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>383</fpage>
          -
          <lpage>391</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -45442-5_
          <fpage>48</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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. Le</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: Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <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="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nakayama</surname>
          </string-name>
          ,
          <article-title>seqeval: A python framework for sequence labeling evaluation, 2018</article-title>
          . URL: https://github.com/chakki-works/seqeval.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>