<!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>Hybrid Classification of Audit Court Decisions using Online Context-Driven Neural Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Leticia Decker</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monica Palmirani</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Salvatore Sapienza</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vittoria Pistone</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Bologna and Scuola Normale Superiore di Pisa</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper proposes an experiment made on a portion of decisions of the Italian Audit Court (Corte dei Conti) with the aim to classify the typologies of the amounts included in the text for permitting better searchability by the judges according to the principle "follow the money". The experiment is based on the decisions modelled into the Akoma Ntoso format, one of the most popular XML standards used in LegalXML domain for representing legal knowledge. Akoma Ntoso permits semantics annotation to facilitate Natural Language Processing (NLP) and Machine Learning (ML) approaches fostering legal metadata and document structure. Therefore, it makes possible to promote cross-document analyses with massive amounts of data and correlate events and detect anomalies in diferent legal processes. We introduce a methodology to automate the pattern recognition, information extraction, and document qualification through semantics annotation to improve information retrieval by legal operators within the judicial system and outside. The methodology recognises patterns of interest (PoI) using regular expressions. A supervised ML classifier uses the semantics context of PoI to infer the attribute values of its annotation. The extracted PoI context is used to generate a dataset organized in a tree format in which each level represents an abstraction level of the PoI classification. The annotation is a tagging of the recognised pattern in the text associated with its description as attribute value. The strategy learns the vocabulary of the PoI classification linking diferent levels of a conceptual abstraction. As use-case, PoI consists of monetary amounts associated with their respective origin (attribute), facilitating the identification of common patterns in the rulings of Audit Court, within the same Region/Court and among them.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;LATEX class</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Legal Informatics</kwd>
        <kwd>Machine Learning</kwd>
        <kwd>Semantic Annotation</kwd>
        <kwd>Legal Ontology</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the 2022 Rule of Law report [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] the European Commission examines the state of the art of
the anti-corruption policies in each member state of the EU landscape1. In this report, there
is a specific note to Italy to reinforce the policies and the instruments for fighting corruption,
especially in public administration2. This paper wants to classify the amounts included within
the judgments of the Italian Audit Court for detecting the meaning under the legal point of
view of these valuable parts of the decisions. Using the classification we could create a data
analytics dashboard in the future, supporting the work of the judges to apply in a homogeneous
way similar cases.
      </p>
      <p>
        Digitization is a primordial process to improve the eficiency of data analysis, extracting
information, facilitating their access, and automating their processing through machine learning
(ML) approaches [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In particular, one of the issues of the management of legal information is
the extraction of semantic knowledge to establish topic-driven legal ontologies [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        This paper contributes to the areas of knowledge mining and information extraction, which
are laborious and error-prone tasks and can be approached through semantic annotations [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
for improving the searchability of decisions especially using the meaning of the amounts. Such
computer-understandable information is based on descriptions of resources through annotations
in diferent modes as metadata or text markup [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Applied to jurisprudence, semantic annotation
identifies legal concepts, (e.g. type damage, agents connected), in textual documents, combined
with the temporal parameters (e.g., period of time connected with the damage) and jurisdiction
(e.g., regional districts) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        This paper investigates the use of Online Learning classifiers for the legal classification of
quantities in the rulings by the Italian Audit Court, on the basis of a legal taxonomy built
on procedural and substantive public law. The methodology used is based on hybrid AI [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
Following this introduction, Section 2 presents the methodology used in this study, while Section
3 identifies related works. Some key concepts and the background of the study are presented
in Section 4. Section 5 discusses the advantages of XML-enriched documents and the use of
taxonomic trees for representing knowledge. Section 6 introduces the technical background of
Online Context-Driven Neural Networks. Section 7 details the hybrid methodology of the case
study with regard to data structuring and annotations, while analysing the dataset and metrics
used in the experiments. Section 8 presents the results and their legal significance. Section 9
concludes the paper by addressing its limitations and setting directions for further research.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>We use hybrid AI for merging semantic analysis (e.g., taxonomy, metadata from Akoma Ntoso
(AKN)) and ML approach in order to optimize the accuracy, minimise the supervision efort of the
dataset by the legal experts, and include elements of explicability for the final legal interpretation.
We used a dataset of decisions of the Italian Audit Court in the interval 2000-2015. We have
selected about 500 decisions concerning the Emilia-Romagna case-law1</p>
      <p>The methodology is the following: 1) all the decisions between 2000-2015 are transformed in
Akoma Ntoso for reusing the descriptiveness of the portions of the document (e.g., decision,
motivation, facts, temporal metadata, jurisdiction, entities); 2) three legal experts (one senior
2See the Report of the Ministry of Interior of Italy https://www.interno.gov.it/sites/default/files/2022-03/report_
reati_corruttivi_02.2022.pdf; and the European Court of Auditors statistics where Italy has the larger number of
staf in Europe devoted to the Audit Court https://op.europa.eu/webpub/eca/book-state-audit/en/#A-9
1The dataset and the code are available at https://gitlab.com/CIRSFID/ai4justice-classifier. The selection has
been mainly based on temporal elements to ensure the generalisability of the results in a significant timespan
researcher, one young researcher, one lawyer) define a taxonomy of the diferent typologies of
the amounts according to administrative law. This taxonomy is based on three axies: (i) the role
of the amount in the final decision (e.g., damage or costs for the trial), (ii) the type of harm (e.g.,
image, revenue), (iii) the source of payment (e.g., salary, pension). The taxonomy is serialized in
RDF-Turtle; 3) the paragraphs including the amounts are extracted using NER technique. This
step provides inputs for improving the taxonomy with real data (bottom approach). 4) once the
taxonomy is accurate enough, it is used by the ML tool for creating a model of classification
(62 documents, 239 samples); 5) a new dataset from Emilia-Romagna is used for the evaluation
(33 documents, 52 samples dataset); 6) two legal experts (lawyer, young reserch) manually
classify this second dataset; 7) the comparison between the ML classification and the manual
one produces the evaluation of the indexes; 8) legal analysis of the comparison results is done
by legal experts for discovering hidden information for improving the taxonomy or the model.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Related Works</title>
      <p>
        Pattern mining commonly produces a large set of recurrent patterns that may be classified
according to the semantic context in order to be interpreted properly. Information Extraction
(IE) and Semantic Annotation (SA) often appear together in this type of text-processing problem.
The medical domain [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], instructional texts [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and social media analysis [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] make use of IE
and SA to solve diferent problems in free-text data.
      </p>
      <p>
        Semantic annotation is commonly applied to legal document processing but rarely this step is
used as input for ML elaboration. A paper develops a solution to the IE automation focused on
structured knowledge, improving semantic search and ontology generation on textual databases
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The extraction system is based on NLP techniques as Part-Of-Speech tagging and Syntactic
Parsing. The information is generalised in features to identify its linguistic context. A Support
Vector Machine classifier generates a model to the SA automation using the new data. The system
is tested using legal texts, focusing on the identification of hypernym relations and definitions.
A work presents the GaiusT tool as a SA framework for textual data that generates elements
of requirements modelling, as actors, rights, and obligations [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The problem is approached
through analysis and annotation of legal documents in prescriptive natural language. GaiusT
and its later versions are web-based systems that extract processes in a semi-automate way. It is
a multi-phase framework that pre-processes the text and supports SA using existing linguistic
tools preferably [
        <xref ref-type="bibr" rid="ref13 ref6">13, 6</xref>
        ]. Still on the same topic, a paper uses Cerno to Italian legal documents.
Cerno is a lightweight framework with multilingual SA support applied to regulations in
diferent domains [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Another paper presents a system to enrich legal texts with SA in order
to index and recover legal documents. SALEM (Semantic Annotation for LEgal Management)
solution is a software developed for SA automation of (Italian) law texts, using NLP to classify
law paragraphs, and extract relevant text fragments that diferentiate semantically types of
regulatory content [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Legilocal, a software solution to help local authorities to improve the
French and European administrative acts, is presented by [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Legilocal centralises the content
management and the actor interactions, combining content management, networking, SA, and
search techniques from the drafting to acts publication. A paper approaches the semantic
recognition of logical parts of Vietnamese legal documents based on a Conditional Random
Fields implementation – a statistic ML method [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The solution is based on the identification
of linguistic features of words and part of speech, and semantic characteristics of triggers and
ontologies in a Vietnamese Business Law dataset. The solution obtains 78.12% at precision and
68.72% at recall measure. A recent work makes use of Akoma Ntoso-marked documents and a
hybrid pipeline to find correlations and patterns among derogations in European Union Law
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Preliminary Concepts</title>
      <p>In this section, we describe the main concepts to approach the presented problem – (i) Akoma
Ntoso markup language, (ii) the processing of Akoma Ntoso documents, (iii) the taxonomy of
the Audit Courts.</p>
      <sec id="sec-4-1">
        <title>4.1. Akoma Ntoso Description Markup</title>
        <p>
          The Akoma Ntoso (Architecture for Knowledge-Oriented Management of African Normative
Texts using Open Standards and Ontology) is a XML-standard of LegalDocML Technical
Committee of OASIS (Organization for the Advancement of Structured Information Standards),
promoted by the United Nations Department for Economic and Social Afairs (UNDESA) for
modelling the legal documents. Akoma Ntoso is formed by a set of XML descriptions of
parliamentary, legislative, and judiciary documents, defining legal documents in structured format,
being based on 3-level structure: (i) text, (ii) structure, and (iii) metadata [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. In (i), the original
document provides the text to its XML version; in (ii), each type of legal document is mapped in
a textual skeleton with mandatory and optional parts, keeping the trade-of between correctness
and flexibility; and in (iii), the set of information is derived from the text to simplify the data
analysis. The metadata is a preprocessing step that organise the legal information extracted
from the document since the NLP is an expensive task [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. Each Akoma Ntoso representation
is associated with just one original expression of a single work, according with the Functional
Requirements for Bibliographic Records (FRBR) model, and each document category is
associated with on just structural format even if in diferent expression types. This permits to assign
to each provision of the decision a specific identifier that is used in the ML step for inferring the
position in the document of the classified information, and so to know other important related
metadata information (e.g., time parameters).
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Audit Court Decisions in Akoma Ntoso</title>
        <p>
          Legal documents can be transcribed to Akoma Ntoso manifestations, being structured in (i)
introductory part, (ii) main body content, and (iii) conclusions. In (i), the document presents the
identification data as the document type, number,and issuing authority. Following, in (ii), it is
presented the content lies organized on background of the case (&lt;background&gt;), argumentation
of the judge (&lt;motivation&gt;), decision of the judge (&lt;decision&gt;). At the end, in (iii), the document
is concluded through the closing formulas, dates, and signatures [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Akoma Ntoso ofers also
several inline elements useful for creating rules (e.g., person-role-amount).
        </p>
        <p>
          Italian Court of Audit decisions are formalised using the type of document of AKN called
’judgement’ that is structured in: (i) &lt;meta&gt;, (ii) &lt;header&gt;, (iii) &lt;judgementBody&gt;, and (iv)
&lt;conclusions&gt; [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. In (i), metadata contain information about the type of the Court, the jurisdiction
with the region to which the court belongs (because the Italian Audit Court’s jurisdiction is
based on a regional criterion), the temporal parameters, and any other legal metadata useful for
classifying the decision (e.g., keywords). In (ii), introductory information is displayed, such as
the date, the number of the decision, the parties, the lawyers, the judges and the introductory
formulae. In (iii), the presentation of the parties’ claims, the factual background, the
motivation of the ruling, and the decision. The decision puts an end to the case by identifying the
unsuccessful party, issuing sanctions, and determining the judicial expenses. Therefore, it is
separated from the rest of the text and it is introduced by the "P.Q.M." (Per Questi Motivi, i.e.,
For These Reasons) formula. In (iv), a closing paragraph contains the signature(s) of the judge(s)
and the issuing date of the ruling. A particular role is played by the normative citations and
of other relevant case-law. The function of these citations are annotated in the metadata (e.g.,
citation in support, in overrule, etc.).
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Taxonomy of Amounts in Italian Audit Court Decisions</title>
        <p>The taxonomy of the typologies of amounts of the Italian Audit Court has the aim to describe
the role that each amount plays in the final decision of the judge according to public law.
We used four criteria: a) the role played in the procedural law of the "Code of Accounting
Justice"; b) the type of injury; c) the provenance of the sum; d) the accumulation of the amounts.
The heterogeneous typologies are in this taxonomy simplified with the goal to ofer to the
judge a new instrument of analysis of the case-law and also to perform, in the future, network
analysis of the relationships between diferent case-law. The first used criterion is based
on the teleological role of the amounts involved in the litigation: expense (Spesa) or State
treasury sum (SommaErariale). All the nomenclature used (in Italian) is based on the Code
of Accounting Justice3. The “State Treasury Sum” (SommaErariale) top-class represents the
typologies of each income or payment in the treasury cofers, including the values that are
only hypothetical because they were determined as a precautionary measure. The “Expense”
(Spesa) top-class represents the disbursement approved by the judge and charged to all parties
or, more frequently, to the losing party. The subclasses "Defense", which means defense costs,
(Difesa), and "CourtFee" (Giudizio), which means the costs for the ofices, specify the nature of
the disbursement by indicating the service that justifies it. Taking into account the competence
for matters attributed to the Audit Court by art. 103 of the Constitution and of the various
phases of the accounting process, it possible to give the sub-classes name (Compensation,
Credit, Indebtedness, Indemnity, Sanction, Withholding, Sequestered Value, JudicialAccount)
representing the sum according to the object of the dispute. The sum, for example, is classified
3See also http://www.normattiva.it/eli/stato/DECRETO_LEGISLATIVO/2016/08/26/174/CONSOLIDATED
as a "Credit" when it expresses the economic value of a credit right which is the object of
the dispute in the pension proceedings. The typology based on the source of the amount is
classified here using “Salary” (Salario), “Pension” (Pensione), “MovableProperty” (BeneMobile),
“ImmovableProperty” (BeneImmobile). It ofers a second criterion for a further specification
of the state treasury sum, which, in addition to acquiring characteristics from the transit in
the process, afects the components of such movable and immovable property in the case
of the sanction and the salary and pension in the case of withholding. This relationship is
managed using isAppliedTo. Another important class is “Compensation” (Risarcimento) which
introduces the third criterion of analysis: the typology of injury. We have "Damage" (Danno)
class, which is connected with the top-class with the relationship isRestoredBy. It expresses
the economic value of the injury sufered by the injured party, which the sum qualified as
"Compensation" intends to restore. The "Equity" and "Non-Equity" sub-classes, in compliance
with the provisions of the Italian Civil Code, characterize the damage on depending on the type
of interests harmed by the damage (e.g., property rights, personality rights, etc.). In the light of
the type of interests harmed by the damage, the jurisprudence then identified the damage from
disservice and damage to the image corresponding to the subclasses "Disservice" and "Image". It
must be emphasized that the latter classes, of jurisprudential derivation, are more subject to
modifications and interpretation. The boolean hasMultipleEnumeration expresses the fourth
criterion: the possibility that the compensation is single or cumulative or that the amount is
representative of a single compensation item or is the sum of several compensation items. By
way of example, the provision could indicate the amount of 100 as total compensation in which
30 is justified by the compensation for the damage to the image and 70 for the damage from the
disservice.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Tagging Patterns in AKN Documents</title>
      <p>In AKN context, tagging patterns evolve two steps: (1) to extract patterns of interest (PoI) from
textual data using regular expressions, and (2) identify the values of the PoI attributes. In (2),
attributes are identified through data mining using semantic contexts of PoI as input to ML
approaches. Figure 1 shows the possible values of the PoI attributes organized into a taxonomic
tree.</p>
      <sec id="sec-5-1">
        <title>5.1. Identifying Patterns</title>
        <p>In this work, PoI identifies monetary quantities (&lt;quantity&gt;) cited in a legal sentence, being
defined as
{"?:valute": ["(?:£||Euro|euro|EURO)
"?:value" : ["\\d+\\.?"],
"quantity": ["{{valute}}(?:\\s*)?{{value}}</p>
        <p>+((?:\\,\\d+))?"],
"patterns": ["{{quantity}}"]}
(?:\\.)?" ],
The &lt;quantity&gt; tag is expressed by a regular expression using JavaScript Object Notation (JSON).
The monetary values can be found in euro (€, ‘euro’, ‘EURO’, or ‘Euro’) or Italian lira (£). It
can be followed or not by a dot (‘.’), and by an undefined sequence of spaces ( ? : ∖∖* ) before
achieving the numerical value. In sequence, there is at least one numeric digit (∖∖+), followed
or not by a comma (‘,’), and at least another numerical digit (? : ∖∖, ∖∖+). The ? : operator is a
group constructor, and a symbol followed by an interrogation mark (?) informs the possibility
of reading the symbol, but not the obligation. Some &lt;quantity&gt; examples are €20.561, 83,
£.82.967, 92, and euro 888, 10. In the tagged text, e.g. €215, 10 will appear as
&lt;quantity class="Difesa"&gt; 215,10&lt;/quantity&gt;,
in which ‘class’ is the attribute of &lt;quantity&gt; that identify the money origin. The attribute
‘class’ can be associated with any of the possible classes.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Taxonomic Tree</title>
        <p>The taxonomic tree (TT) provides an abstraction control mechanism to classify PoI using
its semantic context. Figure 1-a shows the &lt;quantity&gt; taxonomy in a graph, in which the
nodes (legal concepts) are linked with diferent relationships. To make possible intermediary
classification systems, the taxonomic graph was mapped to a taxonomic tree (Fig. 2-b) in which
the parent-child nodes are linked using class-subclass relationship. With this modelling, an
element of a child node is also an element of its parent, except for when the relationship is not
diferent. Suppose a set of concepts organised using the abstract data type tree to define the PoI
taxonomy, in which the closer a concept is to the root, the more abstract its definition, and the
closer to the leaves, the more concrete its meaning. In this sense, the root is the most generalized
TT class, and a leaf is the most specific one of its branches. Each TT concept defines a possible
class of the PoI taxonomy. A data sample classified as belonging to the root class means that the
sample is poorer in semantic context information than a sample classified as belonging to a leaf
class. A tree branch is defined by the way between the root and a leaf, in which the abstraction
level of the classes decreases on the way. Data samples are mapped into the set of possible
classes  = {1, 2, . . . , , . . . , }, in which  is a TT node (and a legal concept) and  = 29
in this work. As we can see, there are two special kinds of nodes: the root, and the leaves. The
root, the unique node characterised by has no parent; the leaves, the nodes that have no children.
TT is composed by a set of legal concepts associated with the &lt;quantity&gt; PoI. Each tree level 
represents an abstraction level in which a sample can be classified, having a set of possible classes
, in which  = 0, . . . , , and  is the maximum level of the tree ( in this work,  = 5). 
is a subset of  and defines the possible classes of a classification system  associated to the
tree level . For example, 2, the second level classification system, has the {‘JudiciaryAct’,
‘StateTreasurySum’, StateTreasurySumNonLitigation, ‘StateTreasurySumLitigation’, ‘Expense’,
‘DefenseFee’, ‘CourtFee’} possible classes, as we can see in Fig. 1. For this example, each sample
classified using the 2 classification system will be associated with one class of 2. In this
work, we have 6 classification systems, {0, 1, 2, 3, 4, 5} with 1, 3, 7, 15, 27, and 29
possible classes respectively. Each legal concept can be seen as a discrete sequence of semantic
abstraction classes, from it until the root, e.g. a data sample classified as ‘Image’ is also classified
as ‘NonEquity’, ‘Compensation-Damage’, ‘StateTreasurySumLitigation’, ‘StateTreasurySum’,
and ‘JudiciaryAct’ since the ‘Image’ class is contained in the ‘NonEquity’ class that is contained
in the ‘Compensation-Damage’ class, and so on. The multi-classification system is modelled to be
a legal support tool. A &lt;quantity&gt; sample is classified in the most specific-concept classification
system (5), orbiting in all the legal concepts defined by its branch, the path formed between the
root and its most specific classification, that can be a leaf but not necessarily. The hierarchical
concepts provide an abstraction scheme that will be used by a decision-making support tool for
judges and legal analysts, helping them to analyse the &lt;quantity&gt; origins, enabling them to
identify types of money flows. In this sense, if someone needs to understand a legal process in
a more general view, the abstraction level of the information can be increased using a more
general schema moving towards 0, and if it is necessary to be more specific, the abstraction
level can be decreased, floating towards 5.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Online Context-driven Neural Networks</title>
      <p>
        Context-driven Neural Networks is a fully-supervised one-layer Neural Network (NN)
constructed incrementally from an online data stream [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Its processing units are neurons, used
to implement a NLP classification of PoI extracted from textual data. The network architecture
results from an incremental construction from the scratch. Consider that the data stream
(x, )[ℎ], ℎ = 1, .... Inputs x = [1, 2, . . . ,  , . . . , ] and output  are a word vector with
variable size and a class. To simplify the notation, let’s assume that the word vectors have the
same length . Figure 3 shows the NN architecture in which the input layer receives x[ℎ]. The
neural layer is a set of dictionaries  = { 1, . . . ,  , . . . ,  }. Each   is a dictionary of term
frequencies, in which the frequency calculus varies according to the used aggregation functions
, being the same for all neurons in a given NN. Each (x)[ℎ] is a vector in which each element
 is a content word extracted from the neighborhood of the associated &lt;quantity&gt; sample.
Content words are word classes that have semantic meaning, i.e., nouns, adjectives, adverbs,
and lexical verbs. In this work, we focused on the semantic context formed by nouns.
      </p>
      <p>In Fig. 4, the neuron   receives x and compares each  with the terms of the dictionary
  until it finds a coincidence. If  is in  ,  is used in the aggregation function . The
comparison between  and the   terms is crisp, therefore the result can be "0" if there is no
match, and "1" if  is in  . The comparison output is weighted by the frequency value  in
, generating the  aggregated output.</p>
      <p>The  output is the expression of the membership level of x in  .  is an aggregation

function that choose the best   candidate, * , to be the x class, ^ * .  is ([1, . . . , ]), in
which  is the  operator.</p>
      <sec id="sec-6-1">
        <title>6.1. Aggregation Functions</title>
        <p>The aggregation functions  are the same for a NN setting with the exception of  that is the
S-norm in all configurations.</p>
        <sec id="sec-6-1-1">
          <title>6.1.1. Term Frequency–Inverse Document Frequency</title>
          <p>
            The naive version of    metric is presented [
            <xref ref-type="bibr" rid="ref22">22</xref>
            ]. The approach is based on the calculus
of   and  in a collection of documents. In this work, a document is a   dictionary, and
its collection  = { 1, . . . ,  }, in which each   is the dictionary of the class .
          </p>
          <p>The   ranks the item  based on its importance  , on the document , i.e., the importance
of  in  
 , =
,

(1)
being , the number of occurrences of the term  in the document ; and  the total number
of items in . The  counts the number of relevant documents in the collection related to
the term ,</p>
          <p>, = 
, = 
︂[</p>
          <p>| ∈  :  ∈ |
| ∈  :  ∈ |
︂]
,
︂]
+ 1 ,
1 + | ∈  :  ∈ |</p>
          <p>︂]
+ 1 ,
and
, =</p>
          <p>︂[
being referenced as tfidf2, tfidf3, and tfidf4 in Fig. 7- 6. Each word
 in   has an associated
TFIDF value that is used as weight  in , in which  is the average value of  of  in  .
, =</p>
          <p>
            1 + | ∈  :  ∈ |
︂]
in which  is the collection of documents with | | = , the number of known classes, and
1 + | ∈  :  ∈ | indicates the number of documents in which the term  appears at least
once.    is the result of the multiplication of the terms. The higher the  , and the
,, the higher the importance of the term  in  , i.e., the term  must be frequent in a
small number of documents  in  to be ranked as important [
            <xref ref-type="bibr" rid="ref23">23</xref>
            ].
          </p>
          <p>In this work, it is used 3 variations of the presented  formula
︂[
(6)
(7)
6.1.2. P-Norm
P-norm is defined as
= P-Norm.
6.1.3. S-norm
maximum operator,
||w|| = ⎝
⎛ 
∑︁ | |⎠
=0
⎞ 
1
in which  = {1, 2, 3, 4} in this work, being referenced as 1-norm, 2-norm, 3-norm, and 4-norm
in Fig. 7- 6. Each word  in   has an associated frequency as  , that is used as weight  in
S-norms () are commutative, associative and monotone operators. The used S-norm is the
(w) =
=0,..., ,</p>
          <p>max
that is used as weight  in  = S-norm.
being referenced as max in Fig. 7- 6. Each word  in   has an associated frequency as  ,</p>
        </sec>
        <sec id="sec-6-1-2">
          <title>6.1.4. Online Context-driven Neural Network Algorithm</title>
          <p>In lines 1-3, the accuracy vector  is initialized, the level tree  and the aggregation function 
are read, and the neural network  is created. In lines 4-13, there is the [ℎ] stream classification:
in the line 9,  receives [ℎ] and returns the estimated class ^* . The  is updated with the new
information (x, )[ℎ] in the line 10. The online accuracy  is calculated in line 11 according to
Eq. (8).</p>
          <p>Online Learning: Context-Driven NN Classifier</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Dataset Analysis and Metrics</title>
      <p>This section describes the data gathering process, the annotation, the datasets and the metrics
used to report results.</p>
      <sec id="sec-7-1">
        <title>7.1. About the dataset</title>
        <p>The dataset is composed of information extracted from legal rulings of the Italian Court of Audit
from 2000-2015 of the Emilia-Romagna region with 584 samples in total, 327 judgments. Rulings
are presented as Akoma Ntoso-formatted documents, from which are extracted monetary values
from the textual data of their ‘Decision’ parts. The dataset is organized into the columns
&lt;filename&gt;, &lt;quantity&gt;, &lt;Decision_Part&gt;, &lt;Semantic_Context&gt;, and &lt;Class_Expert&gt;, in which:
• &lt;filename&gt;: the name of the file of the legal sentence,
• &lt;quantity&gt;: the extracted monetary quantity,
• &lt;Decision_Part&gt;: the text from which the &lt;quantity&gt; sample was extracted,
• &lt;Semantic_Context&gt;: a list of words, a maximum of 20 words apart from &lt;quantity&gt;,
extracted from the &lt;Decision_Part&gt; text, characterizing semantically &lt;quantity&gt;, and
• &lt;Class_Expert&gt;: one of the classes described in the taxonomy that is associated with
&lt;quantity&gt;.</p>
        <p>Considering the (x, )[ℎ] stream, &lt;Semantic_Context&gt; is x and &lt;Class_Expert&gt; is .</p>
      </sec>
      <sec id="sec-7-2">
        <title>7.2. Annotation</title>
        <p>
          One legal expert annotated the 584 samples by identifying the correct class at the lowest possible
level of abstraction, i.e., by preferring a more specific class over a broader one, when possible.
Such possibility is ofered solely by the context, as detailed by the decision. Following the
methodology used in other works, e.g., [
          <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
          ], the annotator did not follow criteria (e.g., case
law, interpretation by scholars) when labelling the instances other than a) the textual wording
of the decision, and b) the description of the classes.
        </p>
      </sec>
      <sec id="sec-7-3">
        <title>7.3. Dataset Analysis</title>
        <p>The data distribution is shown in Fig. 5-a. The y-axes shows the class name and the x-axes, the
number of samples. The partial data distribution (PDD) considers the amount of samples of
each class and, on the other hand, the total data distribution (TDD) takes into account PDD
added to the recursive sum of all its children samples. Figure 5-b shows the distribution of the
quantity of samples through the set of classes, informing how many classes have the amount of
samples into a given range. For example, it is considered ranges with widths of 10 samples, i.e.,
from 0 to 10, from 11 to 20, and so on. As it is possible to see, the problem is an unbalancing
classification in which 18 from 29 classes have until 10 samples. In Fig. 5-c, it is shown how
the size of the semantic-context list is distributed through the dataset, approaching roughly a
Gaussian distribution.</p>
        <p>The data distribution makes it dificult to classify data with high accuracy because it is
available a highly unbalanced small data. To improve the classification quality, it is proposed a
multi-classification scheme in which each tree level represents a possible classification problem.
Based on the fact that an element of a subclass is also an element of its super class, the
classification system is composed by 6 classification problems with 1, 3, 7, 15, 27 and 29-classes, in which
it is available 584 samples distributed over the possible classes in each one of the problems.</p>
      </sec>
      <sec id="sec-7-4">
        <title>7.4. Metrics</title>
        <p>
          Online classification accuracy,  ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ], is obtained from
() =
ℎ − 1 () +
ℎ
in which  = 1 if ^[ℎ] = [ℎ] (right estimation); ^[ℎ] and [ℎ] are the estimate and actual
classes, i.e., the automatic classification and the expert classification respectively. Otherwise,
 = 0 (wrong class estimation) [26] [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. The execution time is given in seconds using a
MacBook Air(M1, 2020), macOS Version 12.6, chip Apple M1, 16GB of memory.
        </p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>8. Experimental Results</title>
      <sec id="sec-8-1">
        <title>8.1. Technical Evaluation</title>
        <p>We evaluated the Context-driven NN considering 584 &lt;quantity&gt; samples. We considered
9 diferent aggregation functions, 2 algorithm versions, and 6 classification systems, i.e., 108
combinations of hyperparameters. Each combination was repeated 20 times, being executed 2160
simulations in total. Table 1 shows the values of the hyperparameters used in the simulations.
In the aggregation functions,  , tfidf and p-norm have 4 variations each one.</p>
        <p>As a side efect of the Pigeonhole principle, increasing the number of possible classes,
decreases the method accuracy as shown in Fig. 6-(a) and Fig. 7-(a,b). The probability  () to
choose the correct class by chance is 1 , in which  is the number of possible classes, and for
the 1, 3, 7, 15, 27, and 29-classes problems, the probability will be 1, 0.33, 0.14, 0.06, 0.037, and
0.034 respectively, and their () rate is in the order of 1, 2.51, 5.57, 10.67, 14.95, and 16.51.
As we can see, when increasing the number of possible classes, the impact of chance on the
classification becomes smaller. Since the taxonomy is structured as classes and sub-classes, the
probability of misclassification among the classes of the same branch is bigger than between
diferent branches. As we have data extracted from free-style text, the juridical terms used to
describe a &lt;quantity&gt; sample can vary greatly, contaminating x with words with no semantic
importance to identify the correct class or with words that are useful to identify other possible
classes. Table 2 abstracts the results of the simulations considering our best performance using
tfidf3 with 99.5% of confidence. The accuracy of the ofline algorithm version (94.18%, 61.53%) is
slightly higher than the online one (89.87%, 57.02%). It is easy to understand the results if we
see Fig. 6-b which describes the behaviour of the accuracy on-the-fly for the online NN version.
In the beginning of the learning process, the accuracy is unstable, tending to converge to the
method accuracy over time. The ofline NN has a training phase which includes the beginning
of the learning process. In this way, it is expected that the testing phase has better accuracy
than the training phase in this case.</p>
        <p>If we compare Fig. 6-a and Fig. 7-(a,b), it is possible to see that the confidence interval,
expressed by the grey area around the lines, is slightly narrower in Fig. 6-a than in Fig. 7-(a,b)
since the online version uses the samples used by the training and testing phases together.
Figure 6-b shows the online accuracy of 3-classes and 29-classes problems, providing the
asymptotic limits to the accuracy of all classification systems. Figures 6-7 present a similar
behaviour of the accuracy of the classification systems, being unquestionable the superiority of
the results related to the TFIDF aggregation functions family, the unique approach exclusively
NLP.</p>
      </sec>
      <sec id="sec-8-2">
        <title>8.2. Legal Evaluation</title>
        <p>Following the methodology, we analysed the most frequent errors from a legal point to check
whether the taxonomy was tailored to the text under scrutiny or whether adaptations were
needed. The analysis was carried out on each experiment with similar results. For reasons
of brevity, the following detailed assessment only concerns the experiment with the lowest
accuracy. Fig. 8 shows the 7 most frequent errors for the 29-class experiment and their relative
number of misclassification, which account for more than 50% of the total number of errors. In
the most frequent error, the algorithm classifies "Expense" instead of "CourtFee". Therefore, it
is unable to go from a parent class to a child class. The reasons underlying this error may be
linked to the absence of clear linguistic formulae that identify the costs in Court in their general
meaning with respect to the costs referred to in the decision. Reading the misclassified cases,
two problems are detected: 1) quantities and judicial expenses are mentioned consecutively in
the decision, thus the linguistic formulae influence the classification negatively; 2) the formula
"spese compensate" ("compensated expenses”) significantly afects the classifier. The taxonomy
could be refined - in the future - by adding a boolean specification on the compensated expenses.
With regards to the second and third most common errors, it can be observed that the classifiers
chose a "child" ("Equity") node rather than a "parent". One possible explanation of this recurrent
mistake is that the classifiers associate some linguistic patterns to the "child" class that are
hidden from the annotator, who opted for a more abstract term. However, it has to be noted
that misclassifications occur on subclasses that have some degree of connection to the right
class. The same kind of misclassification can be observed for the fourth, fifth and seventh most
frequent cases, but these are more likely to be justified by the lack of specific data. The sixth
case is similar to the first one, and can be explained by the presence of the word "pensionistico"
("about retirement/pension") in the sentence, which might trigger the wrong case. However,
the context did not allow the annotator to define the quantity as related to the pensions.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>9. Final remarks</title>
      <p>In this study, Online Context-Driven Neural Networks were tested in classifying quantities
from decisions of the Audit Court, also in comparison with ofline algorithms, in combination
with TF-IDF aggregation functions. From the legal evaluation of the experiment, it emerges that
the class "CourtFee" is particularly problematic due to its frequency (5th most represented class
overall, 1st as initial class) and the lack of a clearly-identifiable linguistic pattern to be associated
with this class. This is a rather expected result given the correlation between these two factors.
In further studies, a refinement of the ontology could identify some implicit instances of this
class. Similarly, expanding the taxonomy with regard to other forms of judicial expenses,
including the compensated ones, could be helpful in increasing the mapping of the quantities to
be labelled. Finally, a cross-validation that includes other regions and other courts could be a
viable and valuable avenue for further research. In any case the proposed technique is quite
promising for classifying the amount using a taxonomy and so to improve the categorization of
the diferent decisions also on the basis of the role plaid by the quantities in relation of the type
of damage. In particular it is possible to make complex query like "give me all the decisions
where the quantity of the damage is &gt; X, concerning ’Disservice’ AND where the CourtFee
is &gt;Y". Additionally the Online Context-Driven Neural Networks permits to adequate the ML
model dynamically according with the evolving of the language of the decisions in relation of
the jurisdiction (e.g., diferent regional language) or due to the historical period (e.g., diferent
terminology) and the legislative changes.</p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgements</title>
      <p>This work was supported by the ER4JUSTICE - NEXT GENERATION initiative (CUP E44I20000270002)
for the eficiency of the judicial system, funded by Regione Emilia-Romagna and coordinated
by Fondazione CRUI.
Press, 2019, pp. 205–210.
[26] L. Decker, D. Leite, D. Bonacorsi, Explainable log parsing and online interval granular
classification from streams of words, in: 2022 IEEE International Conference on Fuzzy
Systems (FUZZ-IEEE), IEEE, Padua, Italy, 2022, pp. 1–8. doi:10.1109/FUZZ-IEEE55066.
2022.9882710.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>E. COMMISSION</surname>
          </string-name>
          ,
          <year>2022</year>
          <article-title>Rule of Law Report, COMMUNICATION FROM THE COMMISSION TO THE EUROPEAN PARLIAMENT, THE COUNCIL, THE EUROPEAN ECONOMIC AND SOCIAL COMMITTEE AND THE COMMITTEE OF THE REGIONS 2022 Rule of Law Report The rule of law situation in the European Union</article-title>
          ,
          <source>Technical Report, EUROPEAN COMMISSION</source>
          ,
          <year>2022</year>
          . (See also https://eur-lex.europa.eu/legal-content/EN/ALL/?uri=CELEX: 52022DC0500).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K. D.</given-names>
            <surname>Ashley</surname>
          </string-name>
          ,
          <article-title>Artificial intelligence and legal analytics: new tools for law practice in the digital age</article-title>
          , Cambridge University Press,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G.</given-names>
            <surname>Boella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Caro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Robaldo</surname>
          </string-name>
          ,
          <article-title>Learning from syntax generalizations for automatic semantic annotation</article-title>
          ,
          <source>Journal of Intel. Info. Sys</source>
          .
          <volume>43</volume>
          (
          <year>2014</year>
          )
          <fpage>231</fpage>
          -
          <lpage>246</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kiyavitskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Cordy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          ,
          <article-title>Text mining through semi automatic semantic annotation</article-title>
          , in: U. Reimer, D. Karagiannis (Eds.),
          <source>Practical Aspects of Knowledge Management</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2006</year>
          , pp.
          <fpage>143</fpage>
          -
          <lpage>154</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Oren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Scerri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Handschuh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sintek</surname>
          </string-name>
          , What are semantic annotations,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mich</surname>
          </string-name>
          ,
          <source>J. Mylopoulos, Gaiust</source>
          <volume>2</volume>
          .
          <article-title>0: Evolution of a framework for annotating legal documents</article-title>
          ,
          <source>in: Metadata and Semantic Research</source>
          , MTSR
          <year>2016</year>
          , volume
          <volume>672</volume>
          of Communications in Computer and Information Science,
          <year>2016</year>
          , pp.
          <fpage>43</fpage>
          -
          <lpage>54</lpage>
          . 10th International Conference on Metadata and Semantics Research (MTSR), Gottingen, Germany, nov
          <volume>22</volume>
          -
          <fpage>25</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tabet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Boley</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Paschke,
          <article-title>LegalRuleML: XML-Based Rules and Norms</article-title>
          .,
          <source>RuleML America</source>
          <volume>7018</volume>
          (
          <year>2011</year>
          )
          <fpage>298</fpage>
          -
          <lpage>312</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liga</surname>
          </string-name>
          ,
          <article-title>Derogations analysis of european legislation through hybrid ai approach</article-title>
          ,
          <source>in: Electronic Government and the Information Systems Perspective: 11th International Conference, EGOVIS 2022</source>
          , Vienna, Austria,
          <source>August 22-24</source>
          ,
          <year>2022</year>
          , Proceedings, Springer,
          <year>2022</year>
          , pp.
          <fpage>123</fpage>
          -
          <lpage>137</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Esuli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Marcheggiani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sebastiani</surname>
          </string-name>
          ,
          <article-title>An enhanced crfs-based system for information extraction from radiology reports</article-title>
          ,
          <source>Journal of Biomedical Informatics</source>
          <volume>46</volume>
          (
          <year>2013</year>
          )
          <fpage>425</fpage>
          -
          <lpage>435</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Nabizadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kolossa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Heckmann</surname>
          </string-name>
          ,
          <string-name>
            <surname>Myfixit:</surname>
          </string-name>
          <article-title>An annotated dataset, annotation tool, and baseline methods for information extraction from repair manuals</article-title>
          ,
          <source>in: Proceedings of the 12th Int. Conf. on Language Resources and Evaluation (LREC</source>
          <year>2020</year>
          ),
          <year>2020</year>
          , pp.
          <fpage>2120</fpage>
          -
          <lpage>2128</lpage>
          . Marseille, France, may
          <volume>11</volume>
          -
          <fpage>16</fpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Tocoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ozturkmenoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alpkocak</surname>
          </string-name>
          ,
          <article-title>Emotion analysis from turkish tweets using deep neural networks</article-title>
          ,
          <source>IEEE Access 7</source>
          (
          <year>2019</year>
          )
          <fpage>183061</fpage>
          -
          <lpage>183069</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kiyavitskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Cordy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          ,
          <article-title>Gaiust: supporting the extraction of rights and obligations for regulatory compliance</article-title>
          ,
          <source>Requirements Engineering</source>
          <volume>20</volume>
          (
          <year>2015</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Cordy</surname>
          </string-name>
          ,
          <article-title>Applying gaiust for extracting requirements from legal documents</article-title>
          ,
          <source>in: 2013 6th Int. Workshop on Requirements Engineering and Law (RELAW)</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>65</fpage>
          -
          <lpage>68</lpage>
          . Rio de Janeiro, Brazil, jun
          <volume>16</volume>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>N.</given-names>
            <surname>Zeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kiyavitskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Cordy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mylopoulos</surname>
          </string-name>
          ,
          <article-title>Annotating regulations using cerno: an application to italian documents extended abstract</article-title>
          ,
          <source>in: ARES 2008: Proceedings of the 3rd Int. Conf. on Availability, Security and Reliability</source>
          ,
          <year>2008</year>
          , pp.
          <volume>1437</volume>
          +. Barcelona, Spain, mar
          <volume>04</volume>
          -
          <fpage>07</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bartolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lenci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montemagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pirrelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Soria</surname>
          </string-name>
          ,
          <article-title>Automatic classification and analysis of provisions in italian legal texts: A case study</article-title>
          , in: R.
          <string-name>
            <surname>Meersman</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Tari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Corsaro</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Herrero</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Perez</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Radenkovic</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Robles</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Santoro</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Albani</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Turowski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Jarrar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Gangemi</surname>
            , E. Duval,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Spyns</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Palinginis (Eds.),
          <source>On the Move to Meaningful Internet Systems</source>
          <year>2004</year>
          :
          <article-title>OTM 2004 Workshops</article-title>
          , Proceedings, volume
          <volume>3292</volume>
          of Lecture Notes in Computer Science,
          <year>2004</year>
          , pp.
          <fpage>593</fpage>
          -
          <lpage>604</lpage>
          . On the Move Confederated International Workshop and Conference, Agia Napa, Cyprus, oct
          <volume>25</volume>
          -
          <fpage>29</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Amardeilh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bourcier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cherfi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Dubail</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garnier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Guillemin-Lanne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mimouni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nazarenko</surname>
          </string-name>
          , E. Paul, S. Salotti,
          <string-name>
            <given-names>M.</given-names>
            <surname>Seizou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Szulman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zargayouna</surname>
          </string-name>
          ,
          <article-title>The legilocal project: the local law simply shared</article-title>
          ,
          <source>in: Legal Knowledge and Information Systems</source>
          , volume
          <volume>259</volume>
          <source>of Frontiers in Artificial Intelligence and Applications</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>11</fpage>
          -
          <lpage>14</lpage>
          .
          <source>26th Int. Conf. on Legal Knowledge and Information Systems (Jurix)</source>
          , Bologna, ITALY, dec
          <volume>11</volume>
          -
          <fpage>13</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Son</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. B.</given-names>
            <surname>Quoc</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. T. P.</given-names>
            <surname>Duyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. L.</given-names>
            <surname>Minh</surname>
          </string-name>
          ,
          <article-title>Recognizing logical parts in vietnamese legal texts using conditional random fields</article-title>
          , in: B.
          <string-name>
            <surname>Thi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Drogoul</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Kuonen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Tran</surname>
          </string-name>
          , N. ThaiNghe (Eds.),
          <source>2015 IEEE RIVF Int. Conf. on Computing &amp; Communication Technologies</source>
          , Innovation, and
          <article-title>Vision for the Future (RIVF</article-title>
          ),
          <year>2015</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
          <string-name>
            <given-names>Can</given-names>
            <surname>Tho</surname>
          </string-name>
          , Vietnam, jan
          <volume>25</volume>
          -
          <fpage>28</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <surname>Legislative</surname>
            <given-names>XML</given-names>
          </string-name>
          :
          <article-title>Principles and Technical Tools, ERMES Servizi Editoriali Integrati S</article-title>
          .r.l.,
          <year>2012</year>
          , pp.
          <fpage>53</fpage>
          -
          <lpage>80</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>F.</given-names>
            <surname>Giubaldo</surname>
          </string-name>
          ,
          <article-title>Uno strumento di supporto all'analisi e visualizzazione di dati strutturati nel contesto giuridico</article-title>
          ,
          <source>Master's thesis</source>
          , University of Bologna,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ceci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <article-title>Ontology framework for judgment modelling, in: AI Approaches to the Complexity of Legal Systems. Models and Ethical Challenges for Legal Systems, Legal Language and Legal Ontologies, Argumentation</article-title>
          and Software Agents: International Workshop AICOL-III,
          <article-title>Held as Part of the 25th IVR Congress</article-title>
          ,
          <source>Frankfurt am Main, Germany, August 15-16</source>
          ,
          <year>2011</year>
          .
          <source>Revised Selected Papers 3</source>
          , Springer,
          <year>2012</year>
          , pp.
          <fpage>116</fpage>
          -
          <lpage>130</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>L.</given-names>
            <surname>Decker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bonacorsi</surname>
          </string-name>
          ,
          <article-title>Comparison of evolving granular classifiers applied to anomaly detection for predictive maintenance in computing centers</article-title>
          ,
          <source>in: IEEE Conf. on Evolving and Adaptive Intel. Sys. (EAIS)</source>
          , IEEE, Bari, Italy,
          <year>2020</year>
          , p.
          <fpage>8p</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>F.</given-names>
            <surname>Minarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Decker</surname>
          </string-name>
          ,
          <article-title>Time-series anomaly detection applied to log-based diagnostic system using unsupervised machine learning approach</article-title>
          ,
          <source>in: Proc. of the 27th Conf. of Open Innovations Association (FRUCT)</source>
          ,
          <source>FRUCT Oy</source>
          , Trento, Italy,
          <year>2020</year>
          , pp.
          <fpage>343</fpage>
          -
          <lpage>348</lpage>
          . doi:
          <volume>10</volume>
          .5281/zenodo.4026500.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L.</given-names>
            <surname>Decker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Minarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Tisbeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bonacorsi</surname>
          </string-name>
          ,
          <article-title>Unsupervised learning and online anomaly detection: An on-condition log-based maintenance system</article-title>
          ,
          <source>Int. Journal of Embedded and Real-Time Comm. Syst</source>
          .
          <volume>13</volume>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sovrano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Distefano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Vitali</surname>
          </string-name>
          ,
          <article-title>A dataset for evaluating legal question answering on private international law</article-title>
          ,
          <source>in: Proceedings of the Eighteenth International Conference on Artificial Intelligence and Law</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>230</fpage>
          -
          <lpage>234</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M.</given-names>
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Bincoletto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Leone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sovrano</surname>
          </string-name>
          ,
          <article-title>Pronto ontology refinement through open knowledge extraction</article-title>
          ,
          <source>in: Legal Knowledge and Information Systems</source>
          , IOS
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>