<!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>Robust Named Entity Recognition and Linking on Historical Multilingual Documents?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Elvys Linh</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>s Pont</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luis Adrián Cabrera-Diego</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>G. Mor</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicolas Sidère</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antoin</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of La Rochelle</institution>
          ,
          <addr-line>L3i, F-17000, La Rochelle, France https://</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Toulouse, IRIT, UMR 5505 CNRS</institution>
          ,
          <addr-line>F-31000, Toulouse</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper summarizes the participation of the L3i laboratory of the University of La Rochelle in the Identifying Historical People, Places, and other Entities (HIPE) evaluation campaign of CLEF 2020. Our participation relies on two neural models, one for named entity recognition and classification (NERC) and another one for entity linking (EL). We carefully pre-processed inputs to mitigate its flaws, notably in terms of segmentation. Our submitted runs cover all languages (English, French, and German) and sub-tasks proposed in the lab: NERC, endto-end EL, and EL-only. Our submissions obtained top performance in 50 out of the 52 scoreboards proposed by the lab organizers. In further detail, out of 70 runs submitted by 13 participants, our approaches obtained the best score for all metrics in all three languages both for NERC and for end-to-end EL. It also obtained the best score for all metrics in French and German for EL-only.</p>
      </abstract>
      <kwd-group>
        <kwd>Information Extraction tity Linking</kwd>
        <kwd>Named Entity Recognition</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        EnIdentifying historical people, places and other entities is a key task in the
automatic understanding of historical newspapers. However, the use of electronic
Copyright c 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0). CLEF 2020, 22-25
September 2020, Thessaloniki, Greece.
? This work has been supported by the European Union’s Horizon 2020 research and
innovation program under grants 770299 (NewsEye) and 825153 (Embeddia).
formats for storing text content is relatively new in comparison to the origins
of newspapers. For instance, in Europe, the first newspapers appeared at the
beginning of the 17th century [25]. Electronic text files started to be widely
used since the adoption of operating systems such as MS-DOS in the 1980s [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Thus, in the absence of electronic versions of historical newspapers, a common
strategy is to recognize the text from digital images of newspapers using optical
character recognition (OCR) techniques. In this context, the HIPE 2020 lab at
CLEF presented an evaluation campaign with the goal of assessing the recent
advances in two major NLP tasks, named entity recognition and classification
(NERC) and entity linking (EL), in the context of historical newspapers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
This paper presents the participation of the Laboratoire Informatique, Image et
Interaction (L3i laboratory) at the University of La Rochelle at CLEF HIPE
2020. We developed two new models for NERC and EL. Despite the fact that
both models are based on neural networks, there are strong differences between
them. Our NERC model is mainly based on the transformer architecture [24]
while our EL model is based on a BiLSTM architecture [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Our main
contributions are three-fold: (1) we propose a pre-processing strategy to mitigate the
characteristics of input documents, (2) we extend a transformer-based model for
NERC, and (3) we adapt an EL model to a multilingual context. Official results
of our participation show the effectiveness of our models over the CLEF HIPE
2020 benchmark.
      </p>
      <p>The remaining of the paper is organized as follows: Section 2 presents the
task and the used corpus. Section 3 presents the global architecture of our
participation, Section 4.1 presents the pre-processing strategy, while Sections 4 and
5 present individually our NERC and EL systems respectively.
2</p>
    </sec>
    <sec id="sec-2">
      <title>HIPE Corpus and HIPE Evaluation</title>
      <p>
        The HIPE corpus [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] is a collection of digitized documents covering three different
languages: English, French, and German. The documents come from archives
of several Swiss, Luxembourgish, and American newspapers. The dataset was
annotated according to the HIPE annotation guidelines [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] which derived from
the Quaero3 annotation guide.
      </p>
      <p>
        The corpus uses the IOB format with hierarchical information and, provides
training, development, and test datasets for each language, except for English.
In the case of the latter, the organizers provided only partitions for development
and test. In Table 1, we present the statistics regarding the number of named
entities found in each dataset. See [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for a more detailed description of the HIPE
dataset.
      </p>
      <p>
        Regarding the HIPE evaluation, it consists in assessing both tasks, NERC
and EL, in terms of Precision (P), Recall (R), and F-measure (F1) at macro
and micro levels [
        <xref ref-type="bibr" rid="ref3">14, 3</xref>
        ]. Two evaluation scenarios are considered: strict (exact
boundary matching) and relaxed (fuzzy boundary matching).
3 Quaero guidelines:
http://www.quaero.org/media/files/bibliographie/quaero-guideannotation-2011
In Figure 1, we present the global architecture of our end-to-end NERC-EL
model composed of three elements. The first one is a pre-processing module,
which reformats the input provided by the organizers. The second element is the
NERC module, where we predict the named entities for each language, English,
French, and German. The third element is the EL module, where we
disambiguate the named entities, and we link them to the Wikidata.
      </p>
      <p>CAMEMBERT-LARGE
Transformerlayer
Transformerlayer</p>
      <p>CRF Multitask</p>
      <p>Transformerlayer
Transformerlayer</p>
      <p>CRF Multitask</p>
      <p>ENGLISH
BERT-Multilingual</p>
      <p>CRF Multitask</p>
      <p>Format
Reconstruction</p>
      <p>Wikipedia
Extractpages
andlinks
eTmrabinedednitnitgys Copm(ep|mu)te</p>
      <p>EL
GERMAN</p>
      <p>FRENCH</p>
      <p>ENGLISH
OCRcorrectionof
mentions
ELmodel
Kolitsasetal.</p>
    </sec>
    <sec id="sec-3">
      <title>Named Entity Recognition and Classification (NERC)</title>
      <p>
        In CLEF HIPE 2020, the NERC task consists in the recognition and
classification of entities, such as people and locations, within historical multilingual
newspapers. According to the organizers [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], it is composed of two sub-tasks
with different levels of difficulty:
– Sub-task 1.1 - NERC coarse-grained: the identification and categorization
of entity mentions according to high-level entity types, Person, Location,
Organization, Product, and Time.
– Sub-task 1.2 - NERC fine-grained: the recognition and classification of entity
mentions at different levels, finer-grained entity types and nested entities, up
to one level of depth. It also consists in detecting the components belonging
to an entity mention, such as its function, title, honorifics, and name.
      </p>
      <p>
        Due to the complexity and characteristics of both coarse-grained and
finegrained NERC sub-tasks, we propose the use of a hierarchical, multitask learning
approach consisting in a fine-tuned encoder based on Bidirectional Encoder
Representations from Transformers (BERT) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Our approach includes the use of a
stack of Transformer [24] blocks on top of the BERT model for the French and
German languages. The multitask prediction layer consists of six separate
conditional random field (CRF) layers. The architecture of the model is presented
in Figure 2.
      </p>
      <p>CAMEMBERT-LARGE
Transformerlayer
Transformerlayer</p>
      <p>CRF Multitask</p>
      <p>Transformerlayer
Transformerlayer</p>
      <p>CRF Multitask</p>
      <p>ENGLISH
BERT-Multilingual</p>
      <p>CRF Multitask</p>
      <p>Format
Reconstruction</p>
      <p>Positional
Encoding</p>
      <p>F
R
C</p>
      <p>Fine-tuned Language Model</p>
      <p>Transformer Layer
The                                   First                             Lady . .       </p>
      <p>           
Multi-Head Attention</p>
      <p>Add &amp; Normalize
Feed Forward Feed Forward Feed Forward</p>
      <p>Add &amp; Normalize
O                                 B-PERS                       I-PERS           
(a) NERC architecture for all the languages,(b) Detailed model proposed for each
lanincluding the pre-processing step. guage.</p>
      <p>
        We decided to use BERT not only because it is easy to fine-tune, but it has
also proved to be one of the most performing technologies in multiple NLP tasks
[
        <xref ref-type="bibr" rid="ref1 ref12">1, 12, 20</xref>
        ]. However, while BERT had a major impact in the NLP community,
its ability to handle noisy inputs is still an open question [23] or at least
requires the addition of complementary methods [16, 19]. More specifically, the
built-in tokenizer used by BERT first performs simple white-space tokenization,
then applies a Byte Pair Encoding (BPE) based WordPiece tokenization [27]. A
word can be split into character n-grams (e.g. “compatibility” ! “com”, “##pa”,
“##ti”, “##bility”), where “##” is a special symbol for representing the
presence of a sub-word that was recognized. Between the types of OCR errors that
can be encountered, the character insertion modification has the minimum
influence [23], because the tokenization at the sub-word level of BERT would not
change much in some cases, such as “practically” ! “practicaally”, but the
substitution and deletion errors can hurt the performance of the tokenizer the most
due to the generation of uncommon samples, as such as “professionalism” !
“pr9fessi9nalism”. Thus, these new noisy tokens could influence the performance
of BERT-based models4.
      </p>
      <p>The added layers consist in a stack of Transformer blocks (Transformer
encoders). As proposed in [24], this model is a deep learning architecture based
on multi-head attention mechanisms with sinusoidal position embeddings 5. It is
composed of a stack of identical layers. Each layer has two sub-layers. The first is
a multi-head self-attention mechanism, and the second is a simple, position-wise
fully connected feed-forward network. A residual connection is around each of
the two sub-layers, followed by layer normalization. All sub-layers in the model,
as well as the embedding layers, produce outputs of dimension 512.
4.1</p>
      <sec id="sec-3-1">
        <title>Data Pre-processing</title>
        <p>The HIPE dataset has three different levels of segmentation: article-level,
linelevel, and newspaper-level. Figure 3 shows an example of the segmentation
proposed in the HIPE dataset.</p>
        <p>Since BERT is able to consume only a limited context of tokens (512) and a
line-level context would have been too short to grasp, we segment the articles at
sentence level. We reconstructed the original text, including hyphenated words,
using the miscellaneous annotated column that indicates if a word is split into
two or more text lines. Then, the reconstructed text was passed through Freeling
4.1 [18] which determined the boundaries of each sentence.6
4.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Parameters</title>
        <p>
          For the German NERC, we chose as a pre-trained model the
bert-base-germaneuropeana. This BERT model was trained using the open-source corpus
Euro4 To increase the chances for misspelled, non-canonical, or new words to be recognized,
we enrich the vocabulary of the tokenizer with these tokens, while allowing not only
the BERT encoder but also the added Transformer layers to learn them from scratch.
5 In our implementation, we used learned absolute positional embeddings [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] instead,
as suggested by [26]. [24] found that both versions produced nearly identical results.
6 It should be noted, that the segmentation using Freeling was not flawless. For
instance, certain abbreviations were unknown by the tool. Thus, in some cases, Freeling
oversegmented the sentences. Nonetheless, these errors were ignored.
peana newspapers7 [17]. It has been used in other NERC systems for
contemporary and historical German texts [22, 21]. Moreover, it has shown an
improvement with respect to other NERC systems.
        </p>
        <p>
          For the French NERC, we relied on a pre-trained CamemBERT [15] model,
specifically on the large version, camembert-large. Unlike BERT, this French
version makes use of a whole-word masking and SentencePiece tokenization [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
Additionally, for camembert-large, we found that fine-tuning was sometimes
unstable on small datasets, so we ran several random restarts and selected the best
model on the development set.
        </p>
        <p>For the English NERC, since no training data was provided, we tackled the
task with two approaches. The first one was to train the NERC using the English
CoNLL 2003 dataset and the bert-large-cased model. The second approach
was to use the German and French training data and the pre-trained multilingual
BERT model, bert-base-multilingual-cased.</p>
        <p>We denote the number of layers (i.e., Transformer blocks) as L, the hidden
size as H, and the number of self-attention heads as A. bert-base has L=12,
H=768, A=12, bert-large and camembert-large, L=24, H=1024, A=16. In all the
cases, the top Transformer blocks have L=1 for 1 Transf and L=2 for 2 Transf,
H=128, A=12, chosen empirically.</p>
        <p>
          The BERT-based encoders are fine-tuned on the task during training. For
training, we followed the selection of parameters presented in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. We found
that a 2 10 5 learning rate and a mini-batch of dimension 4 for German and
English, and 2 for French, provide the most stable and consistent convergence
across all experiments as evaluated on the development set.
4.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Experiments</title>
        <p>The experiments consider two configurations of our previously described model.
The first one consists in using only the BERT encoder along with the CRF layers.
The second configuration adds the Transformer blocks to the BERT encoder and
the CRF layers. In Table 2, we present these experiments per language.
– RUN1: for German, French, and English, the models consist in only the
finetuning BERT and the CRF layers, with the difference that, for English, we
use the CoNLL dataset, and the fine-tuned BERT encoder is the English
bert-large-cased
– RUN2: for German and French, the models consist in only the fine-tuning
BERT, two stacked Transformer blocks, and the CRF layers, while for
English, the model is bert-large-cased
– RUN3: for English, the model is the one used in RUN1, with the difference
that the training data consists of the French and German training data, and
the fine-tuned BERT encoder is bert-base-multilingual-cased
7 http://www.europeana-newspapers.eu/
RUN1
RUN2
RUN3
From the results in Table 2, we can see the evidence that the BERT-based models
with n Transf achieve, for both German and French languages, higher fuzzy and
strict performance values than the stand-alone BERT model.</p>
        <p>For a more qualitative analysis, we examine the number of unrecognized
words by the pre-trained BERT-based models that were added to the specific
tokenizers (WordPiece for BERT and SentencePiece for CamemBERT).
Following this observation, we notice that there is a tendency of performance increase
of around 1 percentage F1 points for the n Transf models (RUN2 for German
and French). In Table 3, the highest values for all the coarse and fine metrics
are presented.</p>
        <p>In the case of English, when comparing RUN1 and RUN2, where the CoNLL
2003 dataset was used for training, with RUN3, where only HIPE German and
French datasets were used, we notice that the F1 values are usually degraded by
the use of modern datasets in the training process.</p>
        <p>In summary, the methods that performed the best for the NERC task were
the BERT-based models with n stacked Transformers for German and French.
For English, the transfer learning from these two languages was clearly better
than the models trained on modern English data.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Entity Linking (EL)</title>
      <p>Regarding EL, in CLEF HIPE 2020, the task consists in the disambiguation of
named entities using two settings:
– End-to-end EL: We do not have prior knowledge of the named entities. Thus,
we rely on the information obtained from the NERC system.
– EL-only: We have access to the ground-truth regarding named entities, i.e.</p>
      <p>types and boundaries.</p>
      <p>In both settings, it is necessary to take into account literal and metonymic
senses. Furthermore, all the disambiguated named entities have to be linked to
the Wikidata knowledge base (KB).</p>
      <p>
        Our EL system is the composition and improvement of two EL approaches
(Figure 4). First, we make use of the methodology proposed by [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to create
entity embeddings. Second, we utilize the EL architecture proposed by [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] to
disambiguate the candidates. We have modified both EL approaches to support
the multilingual aspect of the CLEF HIPE 2020 task.
      </p>
      <p>
        More precisely, our approach consists of the following four steps which will
be elaborated in the subsequent sections:
1. Building resources: the setup of a knowledge base per language.
2. Entity embeddings: the creation of entity feature representations based
on the model proposed by [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
3. Entity disambiguation: the main end-to-end EL model [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
4. Candidates filtering: the post-processing step where several filtering
techniques are proposed and studied.
GERMAN
      </p>
      <p>FRENCH</p>
      <p>ENGLISH
OCR correction of
mentions
EL model
Kolitsas et al.
We build a KB for English, French, and German, in order to have a richer KB
following these steps:
– Retrieve the last language version of the Wikipedia dump.
– Extract titles and ids of Wikipedia pages.
– Extract list of disambiguation pages and redirection pages.
– Calculate the probability entity-map p(ejm) that analyzes how an entity e
is related to a mention m based on the number of times that mention refers
to that entity.
5.2</p>
      <sec id="sec-4-1">
        <title>Entity Embeddings</title>
        <p>
          We also build a dataset to train entity embeddings for each language, in which
case, we use the methodology proposed by [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. First, we generate two conditional
probability distributions per language: the positive distribution, which is a
probability approximation based on word-entity co-occurrence counts (i.e. which words
appear in the context of an entity) and the negative one, which was calculated
by randomly sampling context windows that were unrelated to a specific
entity. Both probability distributions were used for word embeddings alignment
with respect to an entity embedding. The positive distribution is expected to
approach the embeddings of the co-occurring words with the embedding vector
of the entity. While the negative probability distribution is used to distance the
embeddings of words that are not related to an entity.
5.3
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Entity Disambiguation</title>
        <p>
          For the entity disambiguation, our model is based on Kolitsas et al.’s work [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ],
an end-to-end EL model that jointly performs entity linking and entity
disambiguation. Besides the simplicity of the model brought by the joint-learning,
the model also takes advantage of the fact that it does not require complex
engineered features.
        </p>
        <p>First, for recognizing all entity mentions in a document, Kolitsas et al.
proposed an empirical probabilistic entity-map8 p(ejm) to analyze each span m and
select top entities e that might be referred by this mention in p(ejm).</p>
        <p>
          The end-to-end EL model starts by encoding every token in the text input by
concatenating word and character embeddings that are fed into a Bidirectional
Long Short Term Memory (BiLSTM) network. This representation is used to
project mentions of this document into a shared dimensional space with the
same size as the entity embeddings. These embeddings are fixed continuous entity
representations generated separately, namely in the same manner as presented
in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], and aforementioned in Section 5.2.
        </p>
        <p>
          For analyzing long context dependencies of mentions, the authors used the
attention model proposed by [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] that produces one context embedding per
men8 Calculated from the Wikipedia corpora for each language.
tion based on informative context words that are related to at least one of the
candidate entities. Next, the local score for each mention is determined by the
combination of the log p(ejm), the similarity between the analyzed mention and
each candidate entity embeddings, and the long-range context attention for the
target mention. Finally, a top layer in the neural network promotes the
coherence among disambiguated entities inside the same document. Additionally, we
provide the five best candidate entities for a mention based on the probability
entity-map p(ejm).
5.4
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>Candidates Filtering</title>
        <p>To improve the accuracy of the candidates provided by the EL system, we created
a filtering tool based on heuristics and the DBpedia hierarchical structure [13].</p>
        <p>Specifically, we used the DBpedia structure to manually specify subsets that
represented each named entity type. For instance, the entity type location was
associated with categories such as “dbo:Location” and “dbo:Settlement”.</p>
        <p>These categories were used to determine whether a candidate provided by the
EL system had to be positioned at the bottom of the rankings. In other words,
candidates that according to DBpedia did not belong to the named entity type
were positioned at the bottom of the ranking.9 For those candidates matching
the named entity type10, we extracted their name in the language of analysis.
This name was compared with the entity entry using Fuzzy Wuzzy Weighted
Ratio11. The most similar candidate to the entity entry was considered to be the
most suitable candidate and was positioned at the top.</p>
        <p>In the case of person-type entities, we requested to DBpedia their date of
birth and extract the year if it was possible.12 Then, we compared the extracted
year of birth with the newspaper publication year, which was provided by the
organizers, plus ten years more. If the person entity was born ten years after the
publication of the newspaper, we removed completely the candidate.</p>
        <p>Furthermore, we created a heuristic that consisted in adding NIL as the last
possible candidate. This was done for each named entity unless the EL system
proposed candidates with a type different from the named entity one. In this last
case, a NIL was inserted between the different types of candidates. For example,
if the location “Paris, France” had four candidates entries of type LOC, PERS,
LOC, the filter would sort them as LOC, LOC, NIL, PERS. When the EL system
proposed only candidates that were different from the named entity type, the
filter would position on first place a NIL. These heuristics were based on the
idea that if the EL system could not provide a candidate of the same type to the
named entity, we might be dealing with an entity without an entry in Wikidata.</p>
        <p>For RUN3 in the EL-only task, which will be described in Section 5.5, we
proposed as well a filter based on DBpedia along with Wikidata. The reason is
9 This included candidates that could not be found in DBpedia as well.
10 In the case the literal and metonymic entities types were discordant, we considered
both types as possible.
11 github.com/seatgeek/fuzzywuzzy
12 Certain person-type entities, such as music bands, do not have a date of birth.
that the former indexes only a subset of the latter. Thus, to improve the filter,
we decided to use Wikidata as a backup knowledge base.</p>
        <p>
          To access DBpedia13 and Wikidata14, we utilized their respective SPARQL
Endpoint query service.
Both entity embeddings and the end-to-end EL method used the pre-trained
multilingual MUSE15 word embeddings of size 300 for all languages in the dataset.
We chose the size of 50 for the character embeddings. The German and French
models were trained on the HIPE split (Table 1. As the HIPE dataset does not
contain training data for English, we trained our English model on the AIDA
dataset [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>In order to overcome or reduce OCR problems, we analyzed several mention
variations in order to improve the matching with candidates within the
probability entity-map. More precisely, we analyze the following variations:
concatenation, lowercase, no punctuation, and the Levenshtein distance between a mention
and all candidate mentions within the probability table. In the metonymic sense,
the approach used was to annotate the corpus consisted in copying the
candidates used for the literal sense.</p>
        <p>
          We implemented three configurations of our EL approach for the EL-only
task:
13 wiki.dbpedia.org/public-sparql-endpoint
14 query.wikidata.org
15 https://github.com/facebookresearch/MUSE
– RUN1: for German, French, and English, the output is composed of the
candidate entities proposed by [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
– RUN2: for German, French, and English, the output is composed of the five
most frequent candidate entities related to a mention.
– RUN3: for German, French, and English, the output is composed of the
candidate entities proposed by [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and the ten most frequent candidate
entities related to a mention. For this run, the filter used not only information
from DBpedia but also from Wikidata as indicated in Section 5.4.
        </p>
        <p>We also made three configurations of our end-to-end NERC-EL architecture
to recognize and disambiguate entities:
– RUN1: for German, French, and English, the output is composed of entities
of NERC RUN1 and the disambiguation method of EL RUN1.
– RUN2: for German, French, and English, the output is composed of entities
of NERC RUN2 and the disambiguation method of EL RUN1.
– RUN3: for German and French, the output is composed of entities of NERC
RUN1 and the disambiguation method of EL RUN2. For English, the output
is composed of entities of NERC RUN3 and the disambiguation method of
EL RUN1.</p>
        <p>All runs analyze the mention variations and use the filter to select the best
five candidate entities among all selected candidate entities by each run.
For the EL without prior knowledge of mention types and boundaries, our EL
approach depends on the performance of our NERC system to recognize and
classify the type of entities in historical documents. The results on all the languages
are presented in Table 4. While RUN1 achieved the best results for metonymic,
RUN3 outperformed the other configurations on the literal analysis.</p>
        <p>For EL with prior knowledge of mention types and boundaries, our system
has access to the ground-truth of NERC entities, i.e. correct span and NERC
type for all mentions. Table 5 shows the results. As expected, our EL system
achieved better results with the ground-truth information (improvement up to
0:09 and 0:31 in the F1 values for literal and metonymic, respectively). All runs
achieved similar results for all languages, with the RUN1 being slightly superior
to the other runs for literal and metonymic analysis.</p>
        <p>The use of the filter based on DBpedia and Wikidata reduced the performance
of the EL system in English and French. This might be due to the increment of
noise, such as names of disambiguation pages.16 Our filter analyses all candidate
entities for each mention to order the list of candidates based on their NERC
types and names. Since RUN1 and RUN2 provide up to five candidate entities
for each mention, these runs are more likely than RUN3 to provide a NIL entry
for a mention. For RUN3, the filtering process has a higher probability to find a
candidate of the same named entity type as the mention and disambiguates this
mention to a less frequent candidate entity in a KB.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>For the participation of our team (L3i) to the HIPE lab at CLEF 2020, we
proposed two neural-based methods for the tasks of NERC and EL. We
conclude, for NERC, that the proposed models generally performed well, and that
the stacked transformer-based model with a BERT fine-tuned model and
additional transformer layers better learned the characteristics of the HIPE historical
dataset.</p>
      <p>For EL, our neural model combined with the filtering process analyzed the
historical mentions and disambiguated them to the Wikidata KB. Combining
information from Wikipedia, Wikidata, and DBpedia allowed a thorough
analysis of the characteristics of the entities and helped our method to correctly
disambiguate mentions in historical documents.
16 DBpedia does not index disambiguation pages.
[13] Lehmann, J., Isele, R., Jakob, M., Jentzsch, A., Kontokostas, D., Mendes,
P.N., Hellmann, S., Morsey, M., Kleef, P.v., Auer, S., Bizer, C.: DBpedia
- a large-scale, multilingual knowledge base extracted from wikipedia 6(2),
167–195. https://doi.org/10.3233/SW-140134
[14] Makhoul, J., Kubala, F., Schwartz, R., Weischedel, R., et al.: Performance
measures for information extraction. In: Proceedings of DARPA broadcast
news workshop. pp. 249–252. Herndon, VA (1999)
[15] Martin, L., Muller, B., Suárez, P.J.O., Dupont, Y., Romary, L., de la
Clergerie, É.V., Seddah, D., Sagot, B.: Camembert: a tasty french language
model. arXiv preprint arXiv:1911.03894 (2019)
[16] Muller, B., Sagot, B., Seddah, D.: Enhancing bert for lexical normalization.</p>
      <p>In: Proceedings of the 5th Workshop on Noisy User-generated Text
(WNUT 2019). pp. 297–306 (2019)
[17] Neudecker, C.: An open corpus for named entity recognition in historic
newspapers. In: Proceedings of the Tenth International Conference on
Language Resources and Evaluation (LREC’16). pp. 4348–4352. European
Language Resources Association (ELRA), Portorož, Slovenia (May 2016),
https://www.aclweb.org/anthology/L16-1689
[18] Padró, L., Stanilovsky, E.: FreeLing 3.0: Towards Wider Multilinguality.</p>
      <p>In: Calzolari, N., Choukri, K., Declerck, T., Doğan, M.U., Maegaard, B.,
Mariani, J., Moreno, A., Odijk, J., Piperidis, S. (eds.) Proceedings of the
Eight International Conference on Language Resources and Evaluation
(LREC’12). pp. 2473–2479. ELRA, Istanbul, Turkey (May 2012)
[19] Pruthi, D., Dhingra, B., Lipton, Z.C.: Combating adversarial misspellings
with robust word recognition. In: 57th Annual Meeting of the Association
for Computational Linguistics (ACL 2019). pp. 5582–5591. Florence, Italy
(2019)
[20] Radford, A., Narasimhan, K., Salimans, T., Sutskever, I.: Improving
language understanding by generative pre-training (2018)
[21] Riedl, M., Padó, S.: A named entity recognition shootout for german. In:
Proceedings of the 56th Annual Meeting of the Association for
Computational Linguistics (Volume 2: Short Papers). pp. 120–125 (2018)
[22] Schweter, S., Baiter, J.: Towards robust named entity recognition for historic
german. arXiv preprint arXiv:1906.07592 (2019)
[23] Sun, L., Hashimoto, K., Yin, W., Asai, A., Li, J., Yu, P., Xiong, C.:
Advbert: Bert is not robust on misspellings! generating nature adversarial
samples on bert. arXiv preprint arXiv:2003.04985 (2020)
[24] Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N.,
Kaiser, Ł., Polosukhin, I.: Attention is all you need. In: Advances in neural
information processing systems. pp. 5998–6008 (2017)
[25] Weber, J.: Strassburg, 1605: The origins of the newspaper in europe.
German history 24(3), 387–412 (2006)
[26] Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac,
P., Rault, T., Louf, R., Funtowicz, M., Brew, J.: Huggingface’s
transformers: State-of-the-art natural language processing. ArXiv abs/1910.03771
(2019)
[27] Wu, Y., Schuster, M., Chen, Z., Le, Q.V., Norouzi, M., Macherey, W.,
Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al.: Google’s neural
machine translation system: Bridging the gap between human and machine
translation. arXiv preprint arXiv:1609.08144 (2016)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          : 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</source>
          . pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Duncan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Advanced</surname>
            <given-names>MS-DOS</given-names>
          </string-name>
          <string-name>
            <surname>Programming</surname>
          </string-name>
          . Microsoft Press Redmond, WA (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Ehrmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanello</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bircher</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clematide</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Introducing the CLEF 2020 HIPE shared task: Named entity recognition and linking on historical newspapers</article-title>
          . In: Jose,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Yilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Magalhães</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Castells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.J.</given-names>
            ,
            <surname>Martins</surname>
          </string-name>
          ,
          <string-name>
            <surname>F</surname>
          </string-name>
          . (eds.)
          <article-title>Advances in information retrieval</article-title>
          . pp.
          <fpage>524</fpage>
          -
          <lpage>532</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Ehrmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanello</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clematide</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ströbel</surname>
            ,
            <given-names>P.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Language resources for historical newspapers: the impresso collection</article-title>
          .
          <source>In: Proceedings of The 12th Language Resources and Evaluation Conference</source>
          . pp.
          <fpage>958</fpage>
          -
          <lpage>968</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Ehrmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanello</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flückiger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clematide</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Extended Overview of CLEF HIPE 2020: Named Entity Processing on Historical Newspapers</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.) CLEF 2020 Working Notes. Working Notes of CLEF 2020 -
          <article-title>Conference and Labs of the Evaluation Forum. CEUR-WS (</article-title>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Ehrmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanello</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flückiger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clematide</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Impresso named entity annotation guidelines (version 2.2</article-title>
          .0). https://doi.org/10.5281/zenodo.3604227 (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Ganea</surname>
            ,
            <given-names>O.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Deep joint entity disambiguation with local neural attention</article-title>
          .
          <source>In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>2619</fpage>
          -
          <lpage>2629</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Gehring</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auli</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grangier</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yarats</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dauphin</surname>
            ,
            <given-names>Y.N.</given-names>
          </string-name>
          :
          <article-title>Convolutional sequence to sequence learning</article-title>
          .
          <source>arXiv preprint arXiv:1705.03122</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Hoffart</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yosef</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bordino</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fürstenau</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pinkal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spaniol</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taneva</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thater</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>Robust disambiguation of named entities in text</article-title>
          .
          <source>In: Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>782</fpage>
          -
          <lpage>792</lpage>
          . Edinburgh, Scotland, UK. (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Kolitsas</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganea</surname>
            ,
            <given-names>O.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>End-to-end neural entity linking</article-title>
          .
          <source>In: Proceedings of the 22nd Conference on Computational Natural Language Learning</source>
          . pp.
          <fpage>519</fpage>
          -
          <lpage>529</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Kudo</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Richardson</surname>
          </string-name>
          , J.:
          <article-title>Sentencepiece: A simple and language independent subword tokenizer and detokenizer for neural text processing</article-title>
          . arXiv preprint arXiv:
          <year>1808</year>
          .
          <volume>06226</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Lample</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Conneau</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Cross-lingual language model pretraining</article-title>
          . arXiv preprint arXiv:
          <year>1901</year>
          .
          <volume>07291</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>