<!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>Thesaurus Enhanced Extraction of Hohfeld's Relations from Spanish Labour Law</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Ontology Engineering Group, Universidad Polite ́cnica de Madrid</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Semantic Web Company</institution>
          ,
          <addr-line>Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper we describe the design of an experiment to extract Hohfeld's deontic relations from legal texts. Our approach intends to minimise the manual effort in the annotation process by expanding a set of initial annotations with the legal domain knowledge contained in thesauri represented in Semantic Web formats. With such annotations, we perform a set of iterations to train a deep learning relation extraction model. After analysing the results, we will adapt the process to work on the extraction of Hohfeld's potestative relations. We also plan to use that model to recognise relations in unseen legal sub-domains.</p>
      </abstract>
      <kwd-group>
        <kwd>Relation Extraction</kwd>
        <kwd>Thesaurus</kwd>
        <kwd>Terminology</kwd>
        <kwd>Semantic Web</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        New legal documentation is being generated daily, which implies new regulations and
laws that need to be processed and, most importantly, understood. Several works have
already tackled the difficulties in legal information processing, such as [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which
identifies five major aggravating factors: multijurisdictionality, volume, accessibility, updates
and consolidation and vagueness of legal document classification.
      </p>
      <p>
        Natural language processing tools help solving such challenges, and they can reach
great performance on many language understanding tasks [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Yet, these models
require significantly large annotated datasets and language resources to train. We found,
however, that legal language resources are scarce, mostly monolingual, and sometimes
published in close and proprietary formats. This may be one of the reasons why most
Information Extraction systems, and Relation Extraction tools specifically, do not handle
legal texts properly and, if they do, they tend to return very general results (see
Section 2). Therefore, with the aim of making legal information understandable and easier
accessible, in this paper we describe the design of an experiment to extract relations
amongst terms in legal texts. We further represent them as part of rich domain-specific
multi-lingual resources, that can be ultimately exploited for different use cases.
      </p>
      <p>This work is framed within Lynx3 project, an Innovation Action funded by the
European Union’s Horizon 2020, whose goal is to create a Knowledge Graph of legal and</p>
      <sec id="sec-1-1">
        <title>3 http://lynx-project.eu/</title>
        <p>regulatory data to ease the access to information from different jurisdictions, languages
and domains. Such a Legal Knowledge Graph (LKG) could be of a great help to comply
with current regulations, specially for non-legal-expert users.</p>
        <p>
          Amongst all legal relations the Hohfeld’s fundamental legal relations are the most
general ones [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The Hohfeld’s relations, being the highest abstraction of all
possible legal relations, may serve the basis for more detailed domain-specific legal
relations. In other words, the legal relations appearing in legal sub-domains may be seen
as sub-relation of Hohfeld’s relations. They are divided in two sets of relations:
deontic relations (Right, Duty, No-Right and Priviledge) and potestative relations (Power,
Liability, Disability and Immunity). The term “deontic” refers to a branch of the logic
that is responsible for studying the inferential relationships between normative formulas
that include the operators of permission (P), obligation (O) and prohibition (F), amongst
others [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. While deontic relations (Figure 1) are those that modify (ordinary) actions,
potestative relations modify deontic relations. In this preliminary experiment we will
put the focus on the deontic relations, leaving potestative relations for future work.
        </p>
        <p>Right
correlative</p>
        <p>Duty
opposite</p>
        <p>opposite
No-right
correlative</p>
        <p>Privilege</p>
        <p>Taking into account the nature of the deontic relations, we decided that a good
starting point would be to analyze the subdomain of labour law, that deals with rights and
duties of employers and employees. We have selected one of the most representative
texts of Spanish labour law, the Spanish Workers’ Statute4. In the next steps of this
approach we aim at generalizing the models to recognize Hohfeld’s relations in
different legal areas and in multiple languages. Since in every subarea of law, we will
find different instances of Hohfeld’s relations, we suggest anyone aiming at
Information Extraction from legal texts to start with our general models and fine-tune them
for the specific use case. As fine-tuning general requires much less training data, the
fine-tuning datasets could be created by the legal experts with little effort and would,
therefore, enable the tuning of the model to the specific task at hand.
4 https://www.boe.es/eli/es/rdlg/2015/10/23/2/con</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Since the scope of this approach is still very open, the related work revised is equally
wide. We refer the readers to [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] that exposes in detail the latest advances several
information extraction techniques, including works in Relation Extraction.
      </p>
      <p>
        Throughout the literature, we can find many relation extraction experiments based
on very different technologies. Some of them are based on Knowledge Bases, such as
[
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], that is based on Freebase (currently deprecated) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and is aimed at inferring
answers to questions in natural language. A similar work, [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], employs two
different KBs, PATTY [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] to identify DBpedia [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] predicates that allow translating natural
language questions into SPARQL queries to reason over entities. Other works employ
linguistic approaches, such as [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] that applies deep linguistic patterns to infer relations
over the English Wikipedia; and [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], that presents Falcon, a tool that identifies entities
in short texts and create relations based on KBs and linguistic patterns.
      </p>
      <p>
        Recent advances in deep learning methodologies [
        <xref ref-type="bibr" rid="ref11 ref12">12, 11</xref>
        ] have significantly
improved the state of the art results on well-established relation extraction benchmarks
such as TACRED [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] or SemEval 2010 Task 8 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. These models use the contextualised
pre-trained representation of word-pieces to obtain high quality semantic information
about different words in context. Best performing models, for example, SpanBERT [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
and REDN [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], use not only the individual embeddings of tokens, but also spans of
entities, their lengths, and aggregated embeddings of contexts to get better performance.
      </p>
      <p>Based on the analysis of works cited in the previous paragraphs, we claim that
relations between terms can be of different nature, going beyond hypernymy or synonymy.
We therefore intend to discover domain-specific relations amongst them, adding extra
information to each element, such as the superclass of the terms involved (subject and
object) and the kind of Hohfeld’s relation expressed by the predicate.
3
3.1</p>
    </sec>
    <sec id="sec-3">
      <title>Envisioned approach</title>
      <p>Corpus
As mentioned in Section 1, our study is based on the Spanish Workers’ Statute, that
is published in the Official State Gazette website5. This corpus is divided into three
main sections named as “titles”. The first title covers individual labour relations; the
second title covers the rights of collective representation and workers’ assemblies inside
companies, and the third title covers collective bargaining and collective agreements. In
total, the three sections gather 92 articles, containing approximately 50.000 tokens.</p>
      <p>With the current state of analysis we estimate the density of relations in the Spanish
labour law to be 3.65 relations per article. This number is considered a lower boundary,
since the estimation is calculated over explicit relations, i. e. those relations that can be
attributed to a particular verb in the sentence, but we also expect to retrieve suggestions
of implicit relations predicted by the model.</p>
      <p>To get an idea of the number of entities contained in the corpus, we performed
statistical terminology extraction with TBXTools6, which applies its own algorithm based</p>
      <sec id="sec-3-1">
        <title>5 https://www.boe.es/</title>
        <p>
          6 https://sourceforge.net/projects/tbxtools/files/
on the calculation of n-grams (the combination of n words appearing in the corpus) and
on the normalisation of terms [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. The list of ranked extracted terms, including
multi-word expressions, is revised manually to remove noisy results. After this
analysis, we can count with a total of 614 terms, that are considered the arguments of our
relations. These terms do not include Named Entities, so we also consider it as a lower
boundary. Both the corpus and the entity list are publicly available7 – the results of the
experiments will also be progressively uploaded.
3.2
        </p>
        <p>Methodology
In the first step a small excerpt for the legal corpus is manually annotated. We use the
well-established legal thesauri89, generated within the frame of the Lynx project, and
the manually verified terminology to produce candidates relations. Since every type
of relation of our interest has domain and range restrictions defined manually, we can
filter candidate relations by applying the restrictions. Hence, we can efficiently generate
candidate entity pairs for each relation, for instance, amongst employee and contract in
Example 1. The total size of acquired manually verified relations at this stage is in the
order of 100 samples. These annotations include both entity and relation annotations
(see Example 1), that enable the specification of the relations of interest, including
domain and range restrictions of all relation types.</p>
        <p>Example 1. Context El trabajador podra´ rescindir el acuerdo y recuperar su libertad
de trabajo en otro empleo (The worker may rescind the agreement and regain his
freedom to work in another job).</p>
        <p>Entities trabajador (worker): LegalEntity, acuerdo (agreement): LegalDocument.
Relation Type Right.</p>
        <p>Context El empresario debera´ informar por escrito al trabajador sobre las condiciones
de trabajo (The employer must inform the worker by written notification about the
working conditions).</p>
        <p>Entities empresario (employer): LegalEntity, trabajador (worker): LegalEntity.
Relation Type Duty.</p>
        <p>Context La duracio´n del contrato no podra´ ser inferior a seis meses (The duration of
the contract must not be less than six months).</p>
        <p>Entities duracio´n del contrato (duration of the contract) : LegalEntity, seis meses
(six months): Duration.</p>
        <p>Relation Type No-right.</p>
        <p>Context Asimismo, el Gobierno podra´ otorgar subvenciones, desgravaciones y otras
medidas (Likewise, the Government may grant subsidies, tax breaks and other
measures).</p>
        <p>Entities Gobierno (Government): LegalEntity, subvenciones (subsidies):</p>
        <p>LegalConcept.</p>
        <p>Relation Type Privilege.
7 https://github.com/pmchozas/term_relex
8 https://zenodo.org/record/3843561
9 http://lkg.lynx-project.eu/kos
legal
corpus
annotated</p>
        <p>data
2) manual
validation
1) relation candidate generation</p>
        <p>3) training</p>
        <p>
          At this point, we go with second step of our methodology, that is the initial training
dataset to train the Relation Extraction model – modelV0.1. For the training, we use
R-BERT [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] model. This models takes into account the aggregated entity spans as
well as the embeddings of the whole context to classify the relations. Though the model
is not reaching the best scores, it is quite competitive, robust and easy to use. Several
implementations are openly available10.
        </p>
        <p>Once the model is trained, we reach the final step, where we can use the model
to predict new relations. As the training set is still small, we expect the model to
produce many incorrect predictions. These predictions are verified manually to expend the
training set and re-train the model (see Figure 2).</p>
        <p>
          As mentioned in the introduction, the idea is to include these Hohfeld’s relations
into the knowledge graph represented in Semantic Web formats. We find several works
that tackle the representation of Hohfeld’s relations in Semantic Web formats. One of
the most well-known legal ontologies including such concepts is LegalRuleML [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], a
markup language able to represent the particularities of the legal normative rules. On
the other hand, we can find the Provision Model [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] that was extended in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], to cover
Hohfeld’s relations. Both of them include properties to represent deontic relations (see
Table 1) and can be of a great help to represent those found in this experiment.
10 for example, https://github.com/monologg/R-BERT
terminology extraction
4) manual validation
        </p>
        <p>
          legal
thesaurus
relex
model
For the evaluation of the performance of our model we will use well established
metrics such as precision (P ), recall (R) and F1 score. Let the gold standard be the correct
manually annotated data. Let the true positives (TP) be all the correctly predicted
relations; false positives (FP) – incorrectly predicted relations; false negatives (FN) – those
cases when a relation is not predicted, though it does exist in the gold standard; true
negatives (TN) – the relation is not predicted and it does not exist in the gold standard.
Then P = T PT+PF P , R = T PT+PF N and F1 = 2 PP+RR . These measures are well
established and widely used for evaluation of different classification models, for example,
on the aforementioned benchmarks TACRED [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] and SemEval 2010 Task 8 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The
best models on these datasets currently reach the scores of 74.8% F1 on TACRED11
and above 91% F1 on SemEval12.
3.4
        </p>
        <p>Envisioned use case
The use case that we propose for this experiment is based on one of the pilots of the
aforementioned Lynx project. Lynx Pilot 213, supported by Cuatrecasas14, a globally
well-known Spanish law firm, describes a platform that helps lawyers effectively
identify relevant documents related to the cases they are handling. This platform is built
on top of the Legal Knowledge Graph, which connects legal sources from different
legal orders, countries or languages in the field of labour law, enabling the retrieval of
complex information with a single query.</p>
        <p>Based on this pilot, we propose a use case that delves a little deeper into the
extraction of information: instead of identifying documents, we propose to directly identify
what are the rights and the duties of a certain employee or employer under certain
working conditions. We envision an interface, similar to OpenIE15, where the user only needs
to add a few parameters, such as the type of relation (duty, right...) and the type of agent
11 https://paperswithcode.com/sota/relation-extraction-on-tacred
accessed on April 19, 2021
12 https://paperswithcode.com/sota/relation-extraction-on-semeval-2010-task-8
accessed on April 19, 2021
13 https://lynx-project.eu/project/pilot2
14 https://www.cuatrecasas.com/
15 https://openie.allenai.org/
(employer, employee...). First, we propose this solution at the national level, but as part
of future work it is to explore whether this technique allows us to extract this type of
fine grained information between jurisdictions and languages. The ultimate aim is to
provide non legal experts with easily understandable pieces of information, avoiding
the time-consuming task of browsing through heterogeneous legal documentation. A
preliminary diagram of the user interface and architecture shown in Figure 3.</p>
        <p>User Interface: Visual + Querying
Docs</p>
        <p>Docs</p>
        <p>Store
relex
model</p>
        <p>TTrriippllee
SSttore</p>
        <p>Triples</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions and future work</title>
      <p>In this experiment, we train a model to extract instances of Hohfeld’s deontic relations
from Spanish labour law. Our methodology involves the usage of legal thesauri to
perform entity annotation in an automatic way, therefore saving manual effort. The initial
training set of relations has to be annotated manually, however we use the (inaccurate)
predictions from the preliminary versions of the trained model to prepare samples for
manual checking and, therefore, bootstrapping the training dataset. This way we
efficiently use manual effort to quickly improve the model in a few iterations.</p>
      <p>
        In the next steps of our experiment we aim at using transfer learning techniques
[
        <xref ref-type="bibr" rid="ref16 ref21">21, 16</xref>
        ] and in particular cross-lingual transfer learning [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] to generalize the model and
learn representations of Hohfeld’s relations in different legal domains and in different
languages. We aim at comparing the performance of multi-lingual [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] vs monolingual
models for the specified task. Another interesting direction is to explore the usage of
modern Language Models tuned on specific legal corpora, for example, the PatentBert
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. These models might show better performance due to its learnt understanding of
legal expressions.
      </p>
      <p>Finally, we will do an experiment of deducing the general deontic relations to
domain specific entities. We will use the most general trained deontic multilingual models
to recognize relations in unseen domains, for example, for contract analysis and
compliance checking. Afterwards, we will proceed to explore the automatic extraction of
potestative relations, covering the two sets of Hohfeldian legal concepts.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>This work has received funding from the EU’s Horizon 2020 Research and Innovation
programme through the contracts Lynx (grant agreement No. 780602) and Preˆt-a`-LLOD
(grant agreement No. 825182), and from the Spanish Ministry of Economy, Industry
and Competitiveness through the Datos4.0 contract (TIN2016-78011-C4-4-R).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Akbik</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Broß</surname>
          </string-name>
          , J.: Wanderlust:
          <article-title>Extracting semantic relations from natural language text using dependency grammar patterns</article-title>
          .
          <source>In: www workshop</source>
          . vol.
          <volume>48</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Athan</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Governatori</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmirani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paschke</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wyner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Legalruleml: Design principles and foundations</article-title>
          .
          <source>In: Reasoning Web International Summer School</source>
          . pp.
          <fpage>151</fpage>
          -
          <lpage>188</lpage>
          . Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kobilarov</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ives</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Dbpedia: A nucleus for a web of open data</article-title>
          .
          <source>In: The semantic web</source>
          , pp.
          <fpage>722</fpage>
          -
          <lpage>735</lpage>
          . Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Biagioli</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Law making environment: model based system for the formulation, research and diagnosis of legislation</article-title>
          .
          <source>Artificial Intelligence and Law</source>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Boella</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Humphreys</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossi</surname>
          </string-name>
          , P.,
          <string-name>
            <surname>van der Torre</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>Violato</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Eunomos, a legal document and knowledge management system for regulatory compliance</article-title>
          . In:
          <article-title>Information systems: crossroads for organization, management, accounting</article-title>
          and engineering, pp.
          <fpage>571</fpage>
          -
          <lpage>578</lpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bollacker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Evans</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paritosh</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sturge</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , J.:
          <article-title>Freebase: a collaboratively created graph database for structuring human knowledge</article-title>
          .
          <source>In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data</source>
          . pp.
          <fpage>1247</fpage>
          -
          <lpage>1250</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Francesconi</surname>
          </string-name>
          , E.:
          <article-title>Semantic model for legal resources: Annotation and reasoning over normative provisions</article-title>
          .
          <source>Semantic Web</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <fpage>255</fpage>
          -
          <lpage>265</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gracia</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Fa¨th,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Hartung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ionov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bosque-Gil</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          , Ver´ıssimo,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Chiarcos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Orlikowski</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Leveraging linguistic linked data for cross-lingual model transfer in the pharmaceutical domain</article-title>
          . In: Pan,
          <string-name>
            <given-names>J.Z.</given-names>
            ,
            <surname>Tamma</surname>
          </string-name>
          , V.,
          <string-name>
            <surname>d'Amato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Janowicz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seneviratne</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kagal</surname>
            ,
            <given-names>L</given-names>
          </string-name>
          . (eds.) The Semantic Web - ISWC
          <year>2020</year>
          . pp.
          <fpage>499</fpage>
          -
          <lpage>514</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hendrickx</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozareva</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nakov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Se´aghdha, D.O´ ., Pado´,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Pennacchiotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Romano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Szpakowicz</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Semeval-2010 task 8: Multi-way classification of semantic relations between pairs of nominals</article-title>
          .
          <source>In: Proceedings of the 5th International Workshop on Semantic Evaluation</source>
          . pp.
          <fpage>33</fpage>
          -
          <lpage>38</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hohfeld</surname>
            ,
            <given-names>W.N.:</given-names>
          </string-name>
          <article-title>Some fundamental legal conceptions as applied in judicial reasoning</article-title>
          .
          <source>Yale Lj</source>
          <volume>23</volume>
          ,
          <issue>16</issue>
          (
          <year>1913</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Transformer is all you need: Multimodal multitask learning with a unified transformer (</article-title>
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>Y.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
          </string-name>
          , W.Y.:
          <article-title>Deep residual learning for weakly-supervised relation extraction (</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Weld</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.S.</given-names>
            ,
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          :
          <article-title>Spanbert: Improving pre-training by representing and predicting spans</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>8</volume>
          ,
          <fpage>64</fpage>
          -
          <lpage>77</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hsiang</surname>
          </string-name>
          , J.: Patentbert:
          <article-title>Patent classification with fine-tuning a pre-trained bert model</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>02124</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Downstream model design of pre-trained language model for relation extraction task</article-title>
          . arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>03786</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Ma</surname>
            , J., Cheng,
            <given-names>J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , J.:
          <article-title>Improving air quality prediction accuracy at larger temporal resolutions using deep learning and transfer learning techniques</article-title>
          .
          <source>Atmospheric Environment</source>
          <volume>214</volume>
          ,
          <issue>116885</issue>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Martinez-Rodriguez</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez-Arevalo</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Information extraction meets the semantic web: a survey</article-title>
          .
          <source>Semantic Web (Preprint)</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>81</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Nakashole</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Patty: A taxonomy of relational patterns with semantic types</article-title>
          .
          <source>In: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning</source>
          . pp.
          <fpage>1135</fpage>
          -
          <lpage>1145</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Oliver</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Va`zquez, M.:
          <article-title>Tbxtools: a free, fast and flexible tool for automatic terminology extraction</article-title>
          .
          <source>In: Proceedings of the International Conference Recent Advances in Natural Language Processing</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Oliver</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , Va`zquez,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>A free terminology extraction suite</article-title>
          .
          <source>In: Proceedings of the Twentyninth International Conference on Translating and the Computer</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>A survey on transfer learning</article-title>
          .
          <source>IEEE Transactions on knowledge and data engineering</source>
          <volume>22</volume>
          (
          <issue>10</issue>
          ),
          <fpage>1345</fpage>
          -
          <lpage>1359</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Sakor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mulang</surname>
            ,
            <given-names>I.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shekarpour</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vidal</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Old is gold: linguistic driven approach for entity and relation linking of short text</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers). pp.
          <fpage>2336</fpage>
          -
          <lpage>2346</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mulang</surname>
            <given-names>'</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>I.O.</given-names>
            ,
            <surname>Lytra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Jaradeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.Y.</given-names>
            ,
            <surname>Sakor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Vidal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.E.</given-names>
            ,
            <surname>Lange</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Capturing knowledge in semantically-typed relational patterns to enhance relation linking</article-title>
          .
          <source>In: Proceedings of the Knowledge Capture Conference</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Von Wright</surname>
            ,
            <given-names>G.H.</given-names>
          </string-name>
          :
          <article-title>Deontic logic</article-title>
          .
          <source>Mind</source>
          (
          <year>1951</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michael</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hill</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          :
          <article-title>Glue: A multi-task benchmark and analysis platform for natural language understanding (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mayhew</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , et al.:
          <article-title>Cross-lingual ability of multilingual bert: An empirical study</article-title>
          .
          <source>arXiv preprint arXiv:1912</source>
          .
          <volume>07840</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Enriching pre-trained language model with entity information for relation classification (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reddy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Question answering on freebase via relation extraction and textual evidence</article-title>
          .
          <source>arXiv preprint arXiv:1603.00957</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angeli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
          </string-name>
          , C.D.:
          <article-title>Position-aware attention and supervised data improve slot filling</article-title>
          .
          <source>In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>35</fpage>
          -
          <lpage>45</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>