<!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>A Dataset of Contractual Events in Court Decisions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Guilherme Paulino-Passos</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ken Satoh</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesca Toni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computing, Imperial College London</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Principles of Informatics Research Division, National Institute of Informatics</institution>
          ,
          <addr-line>Tokyo</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The promise of automation of legal reasoning is developing technology that reduces human time required for legal tasks or that improves human performance on such tasks. In order to do so, different methods and systems based on logic programming were developed. However, in order to apply such methods on legal data, it is necessary to provide an interface between human users and the legal reasoning system, and the most natural interface in the legal domain is natural language, in particular, written text. In order to perform reasoning in written text using logic programming methods, it is then necessary to map expressions in text to atoms and predicates in the formal language, a task referred generally as information extraction. In this work, we propose a new dataset for the task of information extraction, in particular event extraction, in court decisions, focusing on contracts. Our dataset captures contractual relations and events that affect them in some way, such as negotiations preceding a (possible) contract, the execution of a contract, or its termination. We conducted text annotation with law students and graduates, resulting in a dataset with 207 documents, 3934 sentences, 4440 entities, and 1794 events. We describe here this resource, the annotation process, its evaluation with inter-annotator agreement metrics, and discuss challenges during the development of this resource and for the future.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Contract Law</kwd>
        <kwd>Information Extraction</kwd>
        <kwd>Language Resource</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The promise of automation of legal reasoning is developing technology that reduces human time
required for legal tasks or that improves human performance on such tasks. In order to do so,
different methods and systems based on logic programming were developed since the beginning
of the field of AI and Law [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], as well as more recently [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. However, in order to apply
such methods on legal data, it is necessary to provide an interface between human users and the
legal reasoning system, and the most natural interface in the legal domain is natural language, in
particular, written text. In order to perform reasoning in written text using logic programming
methods, it is then necessary to map terms and expressions in text to entities and predicates in the
formal language, a task referred generally as information extraction [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. Thus, the identification
of legally relevant events and facts from textual descriptions is an important intermediate task for
automatic legal reasoning from raw text.
      </p>
      <p>
        More concretely, PROLEG [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is a logic-programming-based system able to reason about
contracts, inferring, for instance, their validity, based on events regarding such contracts. In order
to apply PROLEG to cases in text, a framework called ContractFrames was developed [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
This framework applies a rule-based method for extraction of relations and events to be used in
PROLEG. However, this methodology was not evaluated on real data and expects a more limited
form of sentences.
      </p>
      <p>Here we propose a new dataset1 on legal relations and events about contracts in court decisions.
We envisage that this resource will allow for both performance evaluation directly for information
extraction and as a source for supervised learning training for the automatic analysis of legal text.
Thus we aim on moving the previous ContractFrames work to naturally occurring text. This
dataset enables the subtasks of named entity recognition (NER) and event extraction.</p>
      <p>
        Our new dataset is concerned with the task of event extraction in court decisions, focusing
on contracts (see Figure 1 for an example of annotated paragraph). It captures contracts (such
as sales contracts, labour contract, and rental agreements), represented by trigger expressions
in the text from which one can infer their existence. It also captures events that modify those
contracts in some way, such as negotiations preceding a (possible) contract, the execution of a
contract, or its termination (in other words, what is more specifically called “contract events” in
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]). The entities that participate in the contract or perform the contract events are also annotated.
In a logic programming representation such as PROLEG, the extracted entities correspond to
terms (including the contract itself, which is reified), while the entity types, relations, and events
correspond to predicates [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>The paper is organised as follows. In Section 2, we present the methodology, chosen criteria,
and guidelines for annotation. In Section 3 we discuss evaluation methodology and achieved
outcomes of the annotation, including main challenges faced, and we illustrate disagreements
between annotators. In Section 4 we discuss previous work on the annotation of events, and
ifnally in Section 5 we discuss future work and conclusions.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Dataset Development</title>
      <p>
        Choice and Overview of Corpus. We build our annotation on top of the U.S. Caselaw
Dataset [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], a large dataset of high court decisions from different U.S. jurisdictions. In particular,
our annotation is done on the Louisiana jurisdiction, and thus our cases consist of cases from
Supreme Court of Louisiana and the Louisiana Court of Appeals. This decision is motivated
by an aspect from the domain: Louisiana is a mixed jurisdiction, mixing aspects of civil law
and common law, and has a special position of being a jurisdiction with a civil code in English.
Although this is not crucial for the contract event extraction task, we believe work on this data
would allow easier transfer to civil law jurisdictions. The documents were selected in batches,
each randomly sampled from all Louisiana cases from Caselaw.
      </p>
      <p>
        Annotation Methodology. For annotation, we had 6 law school students or graduates. They
were selected from students from Europe and Japan, with fluency in English. They were asked
1Available at: https://doi.org/10.5281/zenodo.8098312
natural_person(employee1).
legal_person(employer1).
other_contract(employment1).
manifestation_fact(execution(employment1), negative, employee1,
employer2, Date).
to read the annotation guidelines, containing several examples of annotations, and annotate
by themselves full, previously unseen opinions. We conducted the annotation using the brat
annotation tool2 [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. We chose brat because it is a well-used open source web-based annotation
tool, suitable for the annotation of entities, events and relations. We used the first rounds of
annotation to iteratively improve our initial guidelines, based on the annotators’ feedback. For
most rounds, annotators were asked to annotate the same documents, initially to compare and
achieve a shared understanding of the guidelines, but also to have a sizeable dataset for which
one can measure appropriately the hardness of the task and reasonable disagreements.
Annotation Guidelines. We describe here the final guidelines. They are presented in the
form of main principles and more detailed instructions for entities, relations, and events, and for
the tagsets. Our main principles underpinning the guidelines are:
1. The annotation is guided by an interpretation which is sensible for a general legal specialist,
regardless of jurisdiction.
2. Only annotate entities which participate in an event or occur in a sentence in which there is
a Contract or a ContractEvent.
3. Any relations (including event participation) must only be between entities or events in the
same sentence, or in neighbouring sentences.
4. When choosing the type of an entity, relation, or event, choose the most specific one that
can be inferred from the text.
5. Specifically for pronouns, only annotate one when it is a part of a relation or event.
6. For every pronoun, if you can find (in the same or neighbouring sentence) the entity it
refers to, you must add the same_reference relation.
7. Only annotate events, entities and relations to which you can associate an actual expression
in the text.
8. Annotate as many events, entities and relations as possible, following the above guidelines.
      </p>
      <p>
        The first principle is a practical one, as it aims to liberate the annotator from worrying or spend
time researching details from U.S. law. The second is motivated by the fact that our goal is finding
contracts, not giving a full event annotation for every sentence in the dataset. The third principle
aims to balance between unbound relation or argument annotation in the same document and
providing some continuity and connection between sentences. The next instruction is important
for the way the tagset is organised. Both entities and events are organised hierarchically, allowing
some granularity for the annotation, as can be seen in Figure 3a. Event types were based on
the Contract Workflow Ontology in the ContractFrames work [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. If an annotator is unsure
whether the term “defendant” in a case refers to a human being (thus, Natural_person) or
perhaps a company (which would be a Legal_person), then the annotator should use the
more general Person. This raises important issues for evaluation, that we discuss in Section 3.
      </p>
      <p>As for principles 5 and 6, the inventory of relations between entities is very limited, since the
focus of annotation is on events and their arguments. Most important is the same_reference
relation, for co-reference. Since relations between entities in neighbouring sentences must be
annotated, this is useful for tracking an entity. In addition, in our guidelines pronouns are to be
annotated only if they are part of a relation or event, but every annotated pronoun must be linked
to another entity by the same_reference relation, if there is co-referring entity in the same
sentence or in a neighbouring sentence. Overlaps were allowed, and might be important when
a single word or expression is the expression of both the contract and a contract event, or of a
contract and one of its participating entities, such as in Figure 2.</p>
      <p>
        Finally, the last two principles, 7 and 8, are instantiations of text-bound annotation principle
and event-centred annotation, described in previous event annotation literature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Principle
7 means that annotation requires to be bound to the text, in a way that the text itself provides
clear evidence for the event being annotated. That is, every event annotation requires a trigger
expression from which one can infer that, in that context, that expression is evidence for the event.
This restricts annotation to sentences with clear indication of the event, forbidding annotators to
annotate without textual evidence, even if an annotator could expect the existence of a contract
in a specific scenario, based on their background knowledge. Principle 8 means that one should
read the text searching for as many events as possible, within the bound of the previous rule, but
possibly including multiple events per sentence, or events indirectly mentioned (but which can be
associated to a textual expression).
      </p>
      <p>There are elements which are not fully determined by the guidelines, since they might depend
on what the annotator considers to be enough evidence of the contract or a description of the
entity, and thus annotators were allowed some discretion. For instance, our guidelines do not
specify whether to include or not modifiers of a noun as objects of a contract, such as in Figure
2, where in the example “house” is tagged as an entity, but an annotator could have annotated
the entire “house at the countryside” span as the same entity. We compare the impacts of the
resulting disagreements on the next section.</p>
      <p>
        An important aspect is of factuality annotation [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. Factuality annotation follows the
tags from [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], seen in Table 1. Factuality is whether the mentioned event is presented by a
source as a true event, that is, something that has happened, or as something different, such as
a possible but uncertain event, a denied occurrence, or as a hypothetical scenario. Factuality
may be analysed with respect to different sources: for instance, the author of the text may be
reporting what another person said, and thus two different analyses are to consider the view from
the author and to consider the view from the reported person. In our case, we only consider the
author source, asking the annotator to evaluate whether the mentioned event indeed happened
according to the report of the judge.
      </p>
      <p>Lastly, for documents in which no contract or contract event was found, we asked annotators
to annotate expressions which they found to be suggestive that the document will not contain
contracts to annotate, using a special Relevant_span tag, as in Figure 4. It was not mandatory
to annotate such a span for decisions without contracts. Annotators were instructed to use it only
if they found an expression to make the existence of a contract in that document very unlikely.
Notice that even an opinion which is not mainly concerned about contract law can still mention
contracts, so should still be annotated. We envisage the Relevant_span tag as a sort of
explanation for the lack of annotation in a document.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset Analysis</title>
      <p>The dataset has in total 207 unique documents, for a total of 3934 sentences and 300684 tokens.
We report general statistics (totals and averages) of annotations in Table 2. Many of the documents
have annotations from multiple annotators, and thus we show total countings including this
multiplicity, total over documents averaging over annotators, and averages over annotators and
documents.</p>
      <p>(c)</p>
      <p>(a)</p>
      <p>
        Note that a substantial number of 94 documents out of the 207 have zero annotations (after
analysis by annotators). Many of them have no real substantial text, and are mostly procedural
considerations, although some of them do have content, but no annotator has found anything to be
tagged. We have included them nonetheless for annotation in order to have the annotators make
the judgement call on whether each of these documents is substantial or not. Since this carries
information originated by the annotators, we include these documents with zero annotations in our
dataset. Nevertheless, depending on the usage it might be advisable to exclude such documents.
Inter-annotator agreement measures. We measured inter-annotator agreement (IAA) in
different ways, based on previous literature on event annotation [
        <xref ref-type="bibr" rid="ref13 ref14 ref5">13, 14, 5</xref>
        ]. For the purposes of
the evaluation below, we are considering event triggers as entities, drawing no distinction between
them and regular entities (that is, entities of type Thing, or one of its subtypes), unless otherwise
specified. Furthermore, event arguments are the only relations evaluated in the metrics below.
      </p>
      <p>
        Our metrics are based on the F1 score. Essentially this means that for a pair of annotators,
we first consider annotations of one of then as the reference and calculate recall of the other
annotation with respect to it, then roles are inverted, recall is again calculated, and finally we use
the harmonic mean of those two values [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. This way, F1 can be interpreted as how well one
annotation predicts the other, where which one is the gold standard does not matter. Since the
number of negative cases is very high, and the labels are not mutually exclusive, Cohen’s kappa
is not appropriate [
        <xref ref-type="bibr" rid="ref15 ref5">5, 15</xref>
        ]. An important aspect of the F1 score is that it can be used to handle
sublabels more appropriately: if label L2 is a sublabel of label L1, annotator A has tagged a span
as L1, and annotator B has tagged the same span as L2, then the sublabel information can be
used to consider that, while annotator A has missed regarding B’s annotation as the gold standard,
annotator B annotated it correctly since L2 implies L1. We use this principle for all entity metrics.
      </p>
      <p>Thus the main metrics we use are:
• for entities, evaluate
– by text, character-by-character: for each character which is part of an entity for
annotator A, check whether it is also part of an entity for annotator B;
– by entity, strictly: for each entity, it is considered matched only by an entity with text
spans have an exact match;
– by entity, relaxed: for each entity, it is considered matched by an entity with any
overlapping text;
• for relations, first find a match for each entity; if there are no matches for either entity,
this is considered a miss; then, check whether for the matched entities there is a matching
relation; entities are matched “optimistically”: an entity is considered a match if it has at
least some character overlap, it is the entity with maximum character overlap, and it is
either a subtype or a supertype of the original type.</p>
      <p>
        We evaluate those metrics by considering every pair of annotators, calculating a metric for
this pair over the entire dataset, restricted to the documents which have been considered by both
annotators, and then evaluating agreement between every possible pair according to the metric
and averaging the results by pair of annotators [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>Results. We present our agreement results in Table 3. As expected, the character-based
evaluation is the stricter metric, since unmatched entities with longer spans have more weight
than a matched entity with a shorter span (which are typically easier to agree on), while in
the entity-based metrics, they count as a single mistake. For entities and contracts in general,
agreement has been moderate, ranging from 40% to 60%, depending on the metric. However,
annotations for ContractEvent show weaker agreement. This is partly due to some pairs of
annotators having very few documents in common, biasing some results. This, coupled with the
low number of ContractEvents, pushes down the average over annotators. Restricting to
annotator pairs with more documents in common have agreement metrics between 27% and 46%.
Disagreement analysis. Some disagreements can be attributed to annotators missing
information in the sentence. In Figure 5a, we can see as the first annotator did not specify the theme
(in order words, the object) of the contract. Some contracts seem to have been missed by some
annotators, on occasion.</p>
      <p>Guidelines require annotation of every entity in a sentence with an event, even if the entity
itself does not participate in an event, but it was hard to make annotators follow this instruction
consistently. This instruction is intended for improving agreement so that, even if annotators
disagree on what are the entities participating in the event, at least one can verify that both agree
on the existence of the same entities. However, frequently annotators miss such non-participating
entities . This can be seen in Figure 5a: the second occurrence of the word “defendant” is not
annotated by anyone. Although this was raised in meetings with the annotators, it is still a
frequent source of disagreement in the data.</p>
      <p>Another source of disagreement is the difference in what was included in the annotation for
entities or event triggers. Annotators made different choices on when to include modifiers as
parts of the entities. A simple but occurring example is in Figure 5b, where the determiner “the”
was included by one annotator and omitted by the other. While this was discussed in iterations
with annotators, this was not strictly defined in the guidelines, since some modifiers might be
deemed necessary for specifying the entity, or as necessary for triggering an event, and thus this
was open to annotator discretion. Figure 5c shows a less trivial example, involving coreferences.</p>
      <p>Finally, a form of disagreement particularly severe for ContractEvents is that sometimes
annotators agreed on the mention of a Contract, but disagreed on whether the trigger itself
also meant a ContractEvent or not. That is, whether the sentence describes a change in the
dynamic of the contract, or if it is just an evidence for the contractual relationship. This occurs in
Figure 5d.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Related Work</title>
      <p>
        Events have been a recent topic of research in AI&amp;Law, including a dataset of annotated events
in court decisions [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] also presenting. Their work consists of 30 decisions of the European Court
of Human Rights (ECHR) with time-related events annotated. Their work is motivated by the
goal of automatically generating timelines from text. While motivated by ContractFrames
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], our work, in contrast, is based on decisions from the Supreme Court of Louisiana and the
(a) Second annotator did not include a Theme for the occurring contract as the first annotator did.
(b) Disagreement regarding whether to include the determiner “the” in the entity. There is also a
disagreement on whether the annotated contract is a Purchase-contract or an Other-contract,
likely by a mistake by the second annotator.
(c) Both annotators have considered that the word “attorney” is a trigger for a Contract, since the
sentence states that “Charles C. Coffee” is an attorney for “Barriere”, but disagreed on how to annotate
the Natural_person entity. Notice that we allow annotations to overlap.
(d) One annotator understood the word “agreement” only as a mention of a (possible) contract, while the
other as an Agreement event with underspecified factuality. Our understanding of the guidelines is
that the second way is preferred, but this factuality makes it a subtle case.
      </p>
      <p>Louisiana Court of Appeals, and we are focused on the goal of finding contractual relations and
events that affect those relations, as distinguished from other facts or legal events. Even though
the life cycle of events is relevant for annotation, the focus is not on capturing every event in the
text and their temporal order. This information is more sparse, and thus we are able to present a
dataset with more documents.</p>
      <p>
        Works on annotation and automatic extraction of events have received significant attention for
more than a decade by the bioinformatics community [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], being also the topic of shared tasks in
that field [
        <xref ref-type="bibr" rid="ref14 ref16">14, 16</xref>
        ]. Bioinformatics also faces the challenges of being a technical domain, being
knowledge-intensive and requiring specialist annotation.
      </p>
      <p>
        More generally, information extraction is an important topic in AI&amp;Law, such as for ontology
population [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. A shared task from SemEval-2023 contains tasks on detecting entities relevant to
the procedure, such as case number, petitioner, and cited statutes, on Indian legal decisions [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
There are also open software available for some usual tasks such as parsing document structure,
extracting named entities, and structured information such as citations [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ], although for
some specific settings and jurisdictions.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion and Future Work</title>
      <p>In this work we present a new dataset for contracts and events related to their workflows in case
text. We contribute with the resource itself, and present the used methodology, the guidelines that
resulted in the dataset, and our quantitative (inter-annotator agreement) and qualitative evaluations
of the dataset, discussing reasons for the disagreements.</p>
      <p>
        We leave for future work the analysis of performance of state-of-the-art NLP methods on
this dataset. Recent state-of-the-art performances have been dominated by large contextualised
language models such as BERT [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], available in the form of pre-trained models, along with
variants [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ], as well as in-domain models, pre-trained in legal text [
        <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
        ]. Such models have
been deployed for the information extraction task, such as in the biomedical domain [
        <xref ref-type="bibr" rid="ref26 ref27">26, 27, 28</xref>
        ],
but also in law [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] (although [29] reports an information extract in which BiLSTMs outperform
BERT models). Thus an evaluation of the performance of BERT models on this dataset would be
a natural next step.
      </p>
      <p>
        Since this work was motivated by [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], an important future work is evaluating their rule-based
system on this new dataset, and comparing that performance to a machine-learning-based system,
with respect to the extraction of events. Another possible comparison is at the reasoning level,
that is, to connect a system trained on this dataset to automatically parse events from text to
a reasoning system such as PROLEG [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], allowing a comparison with [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] at the downstream
reasoning task instead of at the event extraction task.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>Guilherme Paulino-Passos would like to thank the National Institute of Informatics, Tokyo,
Japan, for supporting his visit to Japan that made this work possible, as well as Capes (Brazil,
Ph.D. Scholarship 88881.174481/2018-01). Francesca Toni also acknowledges support from
the European Research Council (ERC) under the European Union’s Horizon 2020 research and
innovation programme (grant agreement No.101020934, ADIX), as well as support from J.P.
Morgan and the Royal Academy of Engineering, UK, under the Research Chairs and Senior
Research Fellowships scheme. Ken Satoh acknowledges support by JSPS KAKENHI Grant
Number, JP22H00543 and JST, AIP Trilateral AI Research, Grant Number JPMJCR20G4. All
authors would also like to thank the annotators who participated in this project: Arisa Ishikawa,
Ayça Aysoy, Mihiro Ikeda, Ryohei Yoshida, Tom Lenters, Yasuaki Mori, Yuki Omata, Yuto Mori.
We also thank anonymous reviewers for their feedback on earlier drafts of this work.
for biomedical relation extraction, in: Proceedings of the 20th Workshop on Biomedical
Language Processing, Association for Computational Linguistics, Online, 2021, pp. 1–10.
doi:10.18653/v1/2021.bionlp-1.1.
[28] P.-T. Lai, Z. Lu, BERT-GT: cross-sentence n-ary relation extraction with BERT and Graph
Transformer, Bioinformatics 36 (2021) 5678–5685. doi:10.1093/bioinformatics/
btaa1087.
[29] I. Chalkidis, M. Fergadiotis, P. Malakasiotis, I. Androutsopoulos, Neural Contract Element
Extraction Revisited: Letters from Sesame Street, 2021. arXiv:2101.04355v2.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Sergot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sadri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Kowalski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kriwaczek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hammond</surname>
          </string-name>
          , H. T. Cory,
          <article-title>The British Nationality Act as a logic program</article-title>
          ,
          <source>Commun. ACM</source>
          <volume>29</volume>
          (
          <year>1986</year>
          )
          <fpage>370</fpage>
          -
          <lpage>386</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. J. M.</given-names>
            <surname>Bench-Capon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. O.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Routen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Sergot</surname>
          </string-name>
          ,
          <article-title>Logic programming for large scale applications in law: A formalisation of supplementary benefit legislation</article-title>
          ,
          <source>in: Proceedings of the First International Conference on Artificial Intelligence and Law</source>
          , ICAIL '
          <fpage>87</fpage>
          , Boston, MA, USA, May
          <volume>27</volume>
          -29,
          <year>1987</year>
          , ACM,
          <year>1987</year>
          , pp.
          <fpage>190</fpage>
          -
          <lpage>198</lpage>
          . URL: https: //doi.org/10.1145/41735.41757. doi:
          <volume>10</volume>
          .1145/41735.41757.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Satoh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Asai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kogawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kubota</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nakamura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Nishigai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shirakawa</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Takano, PROLEG: an implementation of the presupposed ultimate fact theory of Japanese civil code by PROLOG technology</article-title>
          , in: T.
          <string-name>
            <surname>Onoda</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Bekki</surname>
          </string-name>
          , E.
          <source>McCready (Eds.)</source>
          , New Frontiers in
          <string-name>
            <given-names>AI</given-names>
            ,
            <surname>JSAI-isAI</surname>
          </string-name>
          <string-name>
            <surname>Workshops</surname>
          </string-name>
          , volume
          <volume>6797</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2010</year>
          , pp.
          <fpage>153</fpage>
          -
          <lpage>164</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -25655-4\_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Morris</surname>
          </string-name>
          ,
          <article-title>Spreadsheets for Legal Reasoning: The Continued Promise of Declarative Logic Programming in Law, Master's thesis, Faculty of Law</article-title>
          and Department of Computing Science, University of Alberta,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Thompson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Iqbal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>McNaught</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          ,
          <article-title>Construction of an annotated corpus to support biomedical information extraction</article-title>
          ,
          <source>BMC Bioinformatics 10</source>
          (
          <year>2009</year>
          ). doi:
          <volume>10</volume>
          .1186/
          <fpage>1471</fpage>
          -2105-10-349.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.</given-names>
            <surname>Filtz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Navas-Loro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polleres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kirrane</surname>
          </string-name>
          ,
          <article-title>Events matter: Extraction of events from court decisions</article-title>
          , in: S. Villata,
          <string-name>
            <given-names>J.</given-names>
            <surname>Harasta</surname>
          </string-name>
          , P. Kremen (Eds.),
          <source>Legal Knowledge and Information Systems - JURIX</source>
          <year>2020</year>
          , volume
          <volume>334</volume>
          of
          <article-title>Frontiers in AI and Applications</article-title>
          , IOS Press,
          <year>2020</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>42</lpage>
          . doi:
          <volume>10</volume>
          .3233/FAIA200847.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Navas-Loro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Satoh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Rodríguez-Doncel</surname>
          </string-name>
          ,
          <article-title>Contractframes: Bridging the gap between natural language and logics in contract law</article-title>
          , in: K. Kojima,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sakamoto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Mineshima</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          Satoh (Eds.), New Frontiers in AI, Springer International Publishing,
          <year>2019</year>
          , pp.
          <fpage>101</fpage>
          -
          <lpage>114</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Caselaw</surname>
            <given-names>access project</given-names>
          </string-name>
          ,
          <year>2018</year>
          . URL: https://case.law.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Stenetorp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pyysalo</surname>
          </string-name>
          , G. Topic´,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ohta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          , J. Tsujii,
          <article-title>brat: a web-based tool for NLP-assisted text annotation</article-title>
          ,
          <source>in: Proceedings of the Demonstrations Session at EACL</source>
          <year>2012</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Avignon, France,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ohta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tsujii</surname>
          </string-name>
          ,
          <article-title>Corpus annotation for mining biomedical events from literature</article-title>
          ,
          <source>BMC Bioinform</source>
          .
          <volume>9</volume>
          (
          <year>2008</year>
          ). doi:
          <volume>10</volume>
          .1186/
          <fpage>1471</fpage>
          -2105-9-10.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Saurí</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pustejovsky</surname>
          </string-name>
          ,
          <article-title>Factbank: a corpus annotated with event factuality</article-title>
          ,
          <source>Lang. Resour. Evaluation</source>
          <volume>43</volume>
          (
          <year>2009</year>
          )
          <fpage>227</fpage>
          -
          <lpage>268</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10579-009-9089-9.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Saurí</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pustejovsky</surname>
          </string-name>
          ,
          <article-title>Are you sure that this happened? assessing the factuality degree of events in text</article-title>
          ,
          <source>Comput. Linguistics</source>
          <volume>38</volume>
          (
          <year>2012</year>
          )
          <fpage>261</fpage>
          -
          <lpage>299</lpage>
          . doi:
          <volume>10</volume>
          .1162/COLI\_a\ _
          <volume>00096</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kulick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mott</surname>
          </string-name>
          ,
          <article-title>Inter-annotator agreement for ere annotation</article-title>
          ,
          <source>Proceedings of the Second Workshop on EVENTS: Definition</source>
          , Detection, Coreference, and
          <string-name>
            <surname>Representation</surname>
          </string-name>
          (
          <year>2014</year>
          ). doi:
          <volume>10</volume>
          .3115/v1/w14-
          <fpage>2904</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>J.-D. Kim</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Ohta</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Pyysalo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Kano</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Tsujii</surname>
          </string-name>
          ,
          <article-title>Overview of bionlp'09 shared task on event extraction</article-title>
          ,
          <source>Proceedings of the Workshop on BioNLP Shared Task - BioNLP '09</source>
          (
          <year>2009</year>
          ). doi:
          <volume>10</volume>
          .3115/1572340.1572342.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Hripcsak</surname>
          </string-name>
          ,
          <article-title>Agreement, the f-measure, and reliability in information retrieval</article-title>
          ,
          <source>Journal of the American Medical Informatics Association</source>
          <volume>12</volume>
          (
          <year>2005</year>
          )
          <fpage>296</fpage>
          -
          <lpage>298</lpage>
          . doi:
          <volume>10</volume>
          .1197/jamia. m1733.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>J.-D. Kim</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Colic</surname>
            ,
            <given-names>S. H.</given-names>
          </string-name>
          <string-name>
            <surname>Beak</surname>
            ,
            <given-names>Y. H.</given-names>
          </string-name>
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Song, Refactoring the genia event extraction shared task toward a general framework for ie-driven kb development</article-title>
          ,
          <source>Proceedings of the 4th BioNLP Shared Task Workshop</source>
          (
          <year>2016</year>
          ). doi:
          <volume>10</volume>
          .18653/v1/w16-
          <fpage>3003</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Robaldo</surname>
          </string-name>
          , L. di
          <string-name>
            <surname>Caro</surname>
            ,
            <given-names>L. A.</given-names>
          </string-name>
          <string-name>
            <surname>Alemany</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Palminari</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Villata</surname>
          </string-name>
          ,
          <source>Deliverable D2</source>
          .
          <article-title>4: Ontology population: connecting legal text to ontology concepts and instances</article-title>
          ,
          <source>Technical Report, Mining and Reasoning with Legal Texts (MIREL)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A.</given-names>
            <surname>Modi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kalamkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Karn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tiwari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Tanikella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Malhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <article-title>Semeval 2023 task 6: Legaleval - understanding legal texts</article-title>
          ,
          <source>CoRR abs/2304</source>
          .09548 (
          <year>2023</year>
          ). URL: https://doi.org/10.48550/arXiv.2304.09548. doi:
          <volume>10</volume>
          .48550/arXiv.2304.09548. arXiv:
          <volume>2304</volume>
          .
          <fpage>09548</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bommarito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Katz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Detterman</surname>
          </string-name>
          ,
          <article-title>Lexnlp: Natural language processing and information extraction for legal and regulatory texts</article-title>
          ,
          <source>InfoSciRN: Legal Informatics (Topic)</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>ICLR</surname>
            &amp;
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blackstone</surname>
            <given-names>library</given-names>
          </string-name>
          , ???? URL: https://research.iclr.co.uk/blackstone.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          ,
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>
          , in: J.
          <string-name>
            <surname>Burstein</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Doran</surname>
          </string-name>
          , T. Solorio (Eds.),
          <source>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/n19-
          <fpage>1423</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized BERT pretraining approach</article-title>
          , CoRR abs/
          <year>1907</year>
          .11692 (
          <year>2019</year>
          ). arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Goodman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gimpel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , R. Soricut,
          <string-name>
            <surname>ALBERT:</surname>
          </string-name>
          <article-title>A lite BERT for self-supervised learning of language representations</article-title>
          ,
          <source>in: 8th International Conference on Learning Representations, ICLR</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. R.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Henderson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <article-title>When does pretraining help?</article-title>
          ,
          <source>Proceedings of the Eighteenth International Conference on Artificial Intelligence and Law</source>
          (
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .1145/3462757.3466088.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>I.</given-names>
            <surname>Chalkidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fergadiotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Malakasiotis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Aletras</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Androutsopoulos</surname>
          </string-name>
          ,
          <article-title>Legal-bert: The muppets straight out of law school, Findings of the Association for Computational Linguistics: EMNLP (</article-title>
          <year>2020</year>
          ). doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .findings-emnlp.
          <volume>261</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>So</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Biobert: a pre-trained biomedical language representation model for biomedical text mining</article-title>
          ,
          <source>Bioinformatics</source>
          (
          <year>2019</year>
          ). doi:
          <volume>10</volume>
          .1093/bioinformatics/btz682.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>P.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Vijay-Shanker</surname>
          </string-name>
          ,
          <article-title>Improving BERT model using contrastive learning</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>