<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Augmented Reading and Similar Case Matching: from Legal Domain Experts&apos; Modus Operandi to a Computational Pipeline</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Rachele</forename><surname>Mignone</surname></persName>
							<email>rachele.mignone@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ivan</forename><surname>Spada</surname></persName>
							<email>ivan.spada@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Chiara</forename><surname>Bonfanti</surname></persName>
							<email>chiara.bonfanti@edu.unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Michele</forename><surname>Colombino</surname></persName>
							<email>michele.colombino@edu.unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Giorgia</forename><surname>Iacobellis</surname></persName>
							<email>giorgia.iacobellis@edu.unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marius</forename><surname>Laurentiu</surname><genName>Jr</genName></persName>
							<email>laurentiu.zaharia@edu.unito.it</email>
						</author>
						<author>
							<persName><surname>Zaharia</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marianna</forename><surname>Molinari</surname></persName>
							<email>marianna.molinari@unito.it</email>
							<affiliation key="aff1">
								<orgName type="department">Law Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Lungo Dora Siena 100/A</addrLine>
									<postCode>10154</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Susanna</forename><surname>Marta</surname></persName>
							<email>susanna.marta@unito.it</email>
							<affiliation key="aff1">
								<orgName type="department">Law Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Lungo Dora Siena 100/A</addrLine>
									<postCode>10154</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ilaria</forename><forename type="middle">Angela</forename><surname>Amantea</surname></persName>
							<email>ilariaangela.amantea@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Emilio</forename><surname>Sulis</surname></persName>
							<email>emilio.sulis@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Luigi</forename><forename type="middle">Di</forename><surname>Caro</surname></persName>
							<email>luigi.dicaro@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Guido</forename><surname>Boella</surname></persName>
							<email>guido.boella@unito.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Turin</orgName>
								<address>
									<addrLine>Via Pessinetto 12</addrLine>
									<postCode>10149</postCode>
									<settlement>Torino</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<address>
									<postCode>2023</postCode>
									<settlement>Sherbrooke</settlement>
									<region>Québec</region>
									<country key="CA">Canada</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Augmented Reading and Similar Case Matching: from Legal Domain Experts&apos; Modus Operandi to a Computational Pipeline</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">D5E47032402889A7FECD23F71BDFA9E8</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:27+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Augmented reading</term>
					<term>Similar Case Matching</term>
					<term>Explainability</term>
					<term>Information extraction</term>
					<term>Legal case study</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The increasing backlog in processing legal cases in the Courts pushes toward the implementation of solutions that can reduce the workload and thus the time to complete cases. Searching for similar judgments is a relevant task that enables consultation of related legal proceedings. This paper proposes to automate the search process by developing a pipeline inspired by the modus operandi of legal domain experts. The pipeline includes an augmented reading of judgments for the purpose of semantically analyzing texts taking into account the context given by their classification, decisions and citations. The results are interpretable by legal domain experts, while the similarity case-matching output is underpinned by the information extracted from the relevant documents. The paper addresses a case study based on Italian national laws.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>The length of trials and the disposal of the backlog are two of the main challenges of many juridical systems. This is mainly due to the disproportion between the number of cases and the number of judges and resources assigned to juridical offices.</p><p>In order to lighten the workload of the magistrate, our proposal is to shorten reading and researching times by providing a methodology to facilitate the reading of legal documents by efficiently extracting and exploiting the knowledge embedded in the judgments.</p><p>Nevertheless, the full exploitation of juridical documents via efficient automatic information extraction allows us to perform Similar Case Matching and further speed up the magistrates' research process <ref type="bibr" target="#b0">[1]</ref> as we prove by investigating a case study based on Italian legal judgments.</p><p>This work describes a pipeline for the augmented reading of legal documents which results in a tool for the detection of the judgment's relevant content, in order to facilitate the use of juridical databases, extracting information that goes far beyond the document's metadata and keywords, allowing for a more in-depth understanding of the document and for advanced functionalities such as pairwise similarity comparison of juridical documents.</p><p>After a brief legal (Section 2) and technical (Section 3) contextualization, we present the specific case study by thoroughly analyzing the domain experts' modus operandi when reading and comparing legal documents (Section 4). Subsequently, we propose a pipeline for the augmented reading of legal judgments (Section 5) followed by its evaluation in terms of time efficiency and Similar Case Matching (Section 6).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Legal Background</head><p>The idea of creating a computerized database of case law had been around since the 1960s <ref type="bibr" target="#b1">[2]</ref>. Its implementation has gradually been refined in parallel with the development of information technology. The creation of such a system involved the goal of combining information technology and law to facilitate the knowledge and use of the latter. Nowadays a database of a legal management system can be functional to the objectives of greater productivity, the raising of quality, transparency, and dialogue with the territory.</p><p>In particular, the case-law databases, from a means of knowledge and information, are a tool to organize judicial offices and implement their efficiency. The concept embraces the traditional collections of judgments, which are used as research and support tools; but it can also be referred to those statistical surveys aimed at recognizing the flows of litigation, e.g. the analysis of controversies, having a given object (and sub-object), defined by a specific office; the outcome of the judgment; to what extent appeals are successful or rejected (in relation to the matter of the proceedings).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Definitions</head><p>We introduce some definitions for the understanding of the technical details contained in the article.</p><p>• Legal judgment: authoritative decision given by a court or tribunal, including a decree, order, decision, or writ of execution. • Judicial grade/ Instance: reference degree of the issuing judicial office (Court of First Instance or Court of Second Instance -Appeal). • Section (i.e. Sezione): a distinct group of Judges, specialized in a given area of law (Labour Law, Family Law, Criminal Law, etc), within a larger body of them, which constitutes the Judicial Office taken into account.</p><p>• Legal institute: set of rules dealing with a particular legal relationship, or facts.</p><p>• Topic: the matter of a legal institute or of a section of a legal institute.</p><p>• Citations: normative and case-law references.</p><p>• Normative: Rules, especially rules of behavior.</p><p>• Case law: Judicial decisions resolved by courts using the concrete facts of a case.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Related Work</head><p>Reading and comparing textual documents are cross-domain tasks. The task of Similar Case Matching can be tackled with different technologies. Many early contributions focus on a text-based similarity measure (i.e. TF-IDF-based similarity measures <ref type="bibr" target="#b2">[3]</ref>) which, alone, fail to convey the semantic meaning of a legal text. Other techniques rely on the extraction of citations within the documents to compute a similarity score. In particular, these citationbased approaches can be further divided into two sub-categories: mere citation analysis <ref type="bibr" target="#b3">[4]</ref> and citation-graph analysis <ref type="bibr" target="#b4">[5]</ref> which allows the use of graph-based deep learning techniques such as GNNs <ref type="bibr" target="#b5">[6]</ref>. Nevertheless, text-based and graph-based techniques have been combined, achieving sub-optimal performances <ref type="bibr" target="#b6">[7]</ref>.</p><p>Many contributions refer to the analysis of scientific papers, which share a lot of characteristics with legal documents. Firstly, both classes of documents can be described as semi-structured: the structure of first-and second-instance judgments, as well as the IMRaD format of scientific papers, suggest a standard that is often disregarded or misinterpreted. For this reason, both domains present difficulties in dealing with discourse changes within the document. They are conceptually segmented into ordered paragraphs describing the information (preamble, introduction, specific case, reasons and procedures) leading to the decision in a legal judgment or to the paper's conclusions. Moreover, they contain citations that interconnect legislation and case-law or scientific papers as appropriate. In particular, scientific papers have interconnections that determine their contextualization in the literature. In the case of the smart citation index scite <ref type="bibr" target="#b7">[8]</ref>, papers were analyzed from multiple perspectives in order to determine the interconnection between documents and the context. In particular, their work focuses on extracting citations and determining the semantic context given by how and where they are cited in the document. In addition, it is pointed out that there may be different types of citations that need to be treated differently in defining the context around citations and that may change in importance and meaning over time.</p><p>Another important aspect is the transparency and interpretability of the results. The pipeline framework <ref type="bibr" target="#b8">[9]</ref> focuses on the extraction of feature sentences for the purpose of providing interpretability to Similar Case Matching. Extracting them through Deep Learning technologies can make the output difficult to interpret for non-AI experts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Legal Judgments Reading and Comparison: a Case Study</head><p>In order to elaborate our methodology, we focus on a case study based on Italian judgments of first-and second-instance followed by generalization proposals to extend our pipeline to other legal systems and to documents written in other languages. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Data</head><p>The dataset used for these experiments was retrieved from a public online platform [10] for the consultation of Italian legal documents. The collection is a sample downloaded from the platform that contains legal judgments (i.e. Sentenze) of the first and second instance from the labor section (i.e. Sezione Lavoro), each entry is described with the following attributes: filename, Court of jurisdiction, section (i.e. Sezione), labels (i.e. Voci), judgment identifier (Code and Year), NRG (Code and Year, with which each case is associated) and type (first-or second-instance). Sezione and Voci describe the area to which the legal judgment belongs, the former describing the macro-area and the latter the sub-area in which the related legal case lies.</p><p>A total of 5059 legal judgments were extracted, labeled with the 8 most populated Voci (Figure <ref type="figure" target="#fig_0">1</ref>) and having the decisions paragraph well defined and separated from the facts paragraph of the document. Though the data sample is not totally random, the possible bias introduced doesn't compromise the outcome of the experiments to the best of our knowledge. It has been observed that in first-and second-instance legal judgments the structure of the document is not standard. Moreover, facts and decisions paragraphs may be combined in a single paragraph of the judgments file and therefore these were discarded in order to treat the two parts of the document separately properly.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Modus Operandi Analysis</head><p>In order to draw inspiration from the legal domain experts' modus operandi for reading and comparing legal judgments, we proceeded by conducting a process analysis performed by two lawyers. They read two judgments together and commented aloud on them by referring to relevant and irrelevant information in the document to determine whether the two judgments are similar or not similar. This step aimed to intercept the sequence of operations, reasoning, and weights that are given to the components of legal judgments in order to bring out the domain know-how and methodologies in the workload. Our assumption (and proposal) is that the process of reading and comparing can be generalized into an algorithmic form, in this way it can be automated to provide daily support. The manual process took about 1 hour, and we expect that the automated system can be faster, bringing organizational benefits.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Reading of the judgment</head><p>Having specified the context-based similarity criterion, the lawyers began reading one judgment at a time. The focus initially fell on Sezione, matter, and Court grade (first-instance, second-instance (or Appeal), or Supreme Court). Afterward, they read the parts of the legal judgment paying attention to the presence of institutions; careful attention should be paid to the fact that judgments are often anonymized in respect of privacy. Thereafter, they carefully read all paragraphs of the document (e.g. facts, decisions, PQM -i.e. an Italian acronym used to introduce the decision, etc.). The first part of the facts and decisions paragraphs was of particular relevance in defining, in a coarse-grained manner, the domain of the case on which the legal procedure was applied. Lawyers pointed out that the legislation and case law cited would require extensive knowledge that in some cases may require consulting the rules and maxims for a greater understanding.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Comparing two judgments</head><p>Once the accurate reading of the judgments was completed, they proceeded by comparing the information found in the judgments so as to define whether or not they were similar. In particular, it was noted how Sezione and Voci are of paramount importance in constrainingly defining the context within which the judgments fall. If Sezione and matter are different, then the judgments are by their nature different from each other. Subsequently, the focus was on the first part of facts, which define the specific scope of the case, and decisions, which define the legal procedure applied to the specific situation described in the facts.</p><p>The discussion with the lawyers revealed that, depending on the search criteria, it is useful to analyze the facts, if one wants to look for similar situations, and/or the decisions if one wants to give more importance to the legislation and case law cited. Since the second-instance judgments contain information related to the first-instance, which would influence the comparison without introducing additional relevant information, it was preferred to consider only the first part of the decisions that contains information of greater importance to define the legislation and case law applied that allow defining the topic and field.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Methodology</head><p>This section describes the steps that led the study from the analysis of the modus operandi of legal domain experts to the contextualization of legal judgments and the calculation of the Similarity Score. The output is accompanied by auxiliary information useful for understanding the system's results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Augmented Reading and Comparison Pipeline</head><p>The modus operandi of domain experts led us to the implementation of a pipeline (Figure <ref type="figure" target="#fig_1">2</ref>) with the purpose of translating the process of reading and comparing judgments into a generalized algorithmic form. Taking into consideration the scalability of our solution, we propose a modular pipeline, whose steps are somewhat independent and can be computed separately, storing partial results in JSON or CSV format. This methodology allows a single calculation that results in a final matrix of similarity scores that allows the data to be queried with linear complexity in the number n of legal judgments in order to retrieve the m most similar documents given a judgment.</p><p>The pipeline consists of three modules (as shown in Table <ref type="table">1</ref>): classification comparison, decision-based similarity and citation overlap calculation, followed by the calculation of the similarity score according to the outputs of the previous steps. Given all the sentences in the dataset, each step produces in output a matrix that will contribute to the calculation of the last matrix containing the total similarity scores.</p><p>The target of the system includes experts in the legal domain such as magistrates and lawyers. Since computer systems are often difficult to understand, it is necessary to provide a way to make the results explainable and allow critical reasoning with respect to the effectiveness of the output. To do this, information is extracted during data processing that is useful in calculating individual scores in modules, which upon completion of reading and comparing judgments allows for an explanation of why the machine returned the results. Since trust in the computational system applied in the legal domain is fundamental, it is very important to be able to critically evaluate the results to come up against accountability and the effects on the parties in the legal case.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Classification Comparison</head><p>As revealed by the performed process analysis, the most important features in evaluating the relatedness of two judgments are their Sezione and Voci which determine their classification within each Court since they carry important information about the documents' topic. In developing our work, these labels were available within the dataset.</p><p>Expanding this pipeline to a more generic scenario this information can be extracted through a process of automatic legal document classification. Domain experts claim that two judgments</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>module extracted information output classification comparison</head><p>For each judgment, Sezione and Voci with which they are labeled.</p><p>Classification Comparison Matrix where for each pair of judgments, we have 1 if the two documents are classified in the same way and 0 otherwise.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>decision-based similarity</head><p>For each judgment, the portion of the decisions paragraph analyzed in the module.</p><p>Decision-based Similarity Matrix where for each pair of legal judgments we have a decisionsSimilarity score between -1 and 1.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>citation overlap</head><p>For each pair of judgments, legislative and case-law citations in the overlap.</p><p>Citation-based Similarity Matrix where for each pair of legal judgments we have a citationOverlap score between 0 and 1</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 1</head><p>The information extracted from each module of the pipeline as well as their output.</p><p>having different Sezione or Voce are to be considered different and cannot be compared further.</p><p>Conversely, once it is established that two documents cover the same topic, it is possible to continue investigating their level of similarity through the analysis of their content. This first step of the pipeline acts as a filter and consists of comparing the labels Sezione and Voci. If they are equal we proceed with the calculation of the similarity scores based on the document semantics performed in the next steps otherwise, the two legal judgments are different. A legal judgment can have multiple Voci, to be considered equal they must have at least one entry in common.</p><p>Given two judgments j1 and j2, the classification comparison value was calculated as follows:</p><formula xml:id="formula_0">𝑐𝑙𝑎𝑠𝑠𝑖𝑓 𝑖𝑐𝑎𝑡𝑖𝑜𝑛𝐶𝑜𝑚𝑝𝑎𝑟𝑖𝑠𝑜𝑛 = { 1 if 𝑆𝑒𝑧𝑖𝑜𝑛𝑒1 == 𝑆𝑒𝑧𝑖𝑜𝑛𝑒2 and 𝑙𝑒𝑛(𝑉 𝑜𝑐𝑖1 ∩ 𝑉 𝑜𝑐𝑖2) &gt; 0 0 otherwise<label>(1)</label></formula><p>where (𝑆𝑒𝑧𝑖𝑜𝑛𝑒1, 𝑉 𝑜𝑐𝑖1) and (𝑆𝑒𝑧𝑖𝑜𝑛𝑒2, 𝑉 𝑜𝑐𝑖2) are the Sezioni and Voci of legal judgments j1 and j2, respectively.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Decision-based Similarity</head><p>The second step is the computation of the judgments' lexical similarity. This value is obtained by comparing the first portion of the documents' decisions paragraph, which, as suggested by domain experts, contains the most information regarding the legal case. The text was preprocessed through a pipeline that includes 1) conversion to lowercase, 2) removal of special characters, 3) removal of URLs and HTML tags, 4) conversion of word numbers to their numeric form, 5) removal of stopwords and 6) lemmatization through Morph-it! <ref type="bibr" target="#b9">[11]</ref>. Each text was then converted into embeddings using Italian Legal BERT <ref type="bibr" target="#b10">[12]</ref> in order to perform a pairwise comparison through cosine similarity.</p><p>The choice for this kind of approach was dictated by the fact that very few Courts provide a classification taxonomy with a granularity finer than the documents' Voci, making it difficult to find a subtopic label at this stage.</p><p>Although this approach allows us to find a deeper level of similarity, it reduces the overall interpretability of the pipeline results since it relies on deep learning techniques.</p><p>Given two judgments j1 and j2, the decision-based similarity score was calculated as follows: 𝑑𝑒𝑐𝑖𝑠𝑖𝑜𝑛𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦 = 𝑐𝑜𝑠𝑖𝑛𝑒𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦(𝑡𝑒𝑥𝑡𝐸𝑚𝑏𝑒𝑑𝑑𝑖𝑛𝑔(𝑗1), 𝑡𝑒𝑥𝑡𝐸𝑚𝑏𝑒𝑑𝑑𝑖𝑛𝑔(𝑗2))</p><p>(2)</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.4.">Citation Overlap</head><p>Subsequently, we focused on the extraction of citations within the decisions' part of the judgment as they can be used to define the juridical context in which the judgments are located. In this perspective, the document can be characterized by the citations it contains; hence documents with a higher citation overlap will have a higher similarity level as they appear in the same juridical proximity. In other words, as in topic modeling the words describe the topic of the document, in the case of legal judgments the citations define the context and domain of application of the legislation and procedures applied to the decisions. Citations are extracted following the idea that two judgments dealing with similar decisions cite similar legislation and case-law. Citations in documents were extracted through the use of Linkoln <ref type="bibr" target="#b11">[13]</ref>, which allows, given a text, to extract legislative and case-law citations using a regex-based methodology. The extraction provides a list of citations described with text, context, identifiers, reference type (legislative or case-law), authority (Court of first-and second-instance or Supreme Court), document type (legal judgment, decree-law, legislation, etc.), normative link (where available), etc. The proximity between citation-base contexts was calculated through the overlap between citations within legal judgments as follows.</p><p>Given two judgments j1 and j2:</p><formula xml:id="formula_1">𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑂𝑣𝑒𝑟𝑙𝑎𝑝 = |𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑠(𝑗1) ∩ 𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑠(𝑗2)| |𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑠(𝑗1) ∪ 𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑠(𝑗2)|<label>(3)</label></formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.5.">Total Similarity Scores Calculation</head><p>The aforementioned modules can work in isolation and independently of each other, each providing in output a square matrix of order n, where n equals the number of judgments in the dataset. The matrices that contribute to the calculation of the Total Similarity Matrix (TSM) are as follows: Classification Comparison Matrix (CCM), Decision-based Similarity Matrix (DSM), and Citation-based Similarity Matrix (CSM). Each cell in the TSM matrix is populated with a value ≤ 2 calculated as below.</p><p>Given two judgments (j1, j2) and the equations 1, 2 and 3:</p><formula xml:id="formula_2">𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦𝑆𝑐𝑜𝑟𝑒 = 𝑐𝑙𝑎𝑠𝑠𝑖𝑓 𝑖𝑐𝑎𝑡𝑖𝑜𝑛𝐶𝑜𝑚𝑝𝑎𝑟𝑖𝑠𝑜𝑛 * (𝛼 * 𝑑𝑒𝑐𝑖𝑠𝑖𝑜𝑛𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦 + 𝛽 * 𝑐𝑖𝑡𝑎𝑡𝑖𝑜𝑛𝑂𝑣𝑒𝑟𝑙𝑎𝑝) (4)</formula><p>where 𝛼 and 𝛽 represent the weights to be assigned to the last two pipeline components.</p><p>In matrix form on total judgments, we can rewrite the calculation as below:</p><formula xml:id="formula_3">𝑇 𝑆𝑀 = 𝐶𝐶𝑀 * (𝛼 * 𝐷𝑆𝑀 + 𝛽 * 𝐶𝑆𝑀)<label>(5)</label></formula><p>where 𝛼 and 𝛽 represent the weights to be assigned to the last two pipeline components.</p><p>The 𝛼 and 𝛽 multipliers allow for different weighting of similarity in decision-based context and citation-based context. This is because, within a legal case decisions, legislation, and case-law can take on different impacts in setting the context. When comparing two judgments, legal domain experts attach different importance to the components just mentioned and in some ways, it can be subjective in nature. 𝛼 and 𝛽 have a default value of 1, the first approach was to keep this value in the similarity calculation, thus considering the two pipeline components equally. Given a legal judgment, making a matrix with total similarity scores allows one to access the matrix with linear complexity and select the m judgments that are most similar from the perspective of the context described by decisions, legislation and case-law. In this way, reading the judgments and extracting the information occurs only once showing a potential advantage over reproducing the same operation manually.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.6.">Output Interpretability</head><p>For each sentence pair, the pipeline outputs a total similarity score and auxiliary information useful for understanding the result. The information extracted and maintained during the execution of the individual modules is broken down as in Table <ref type="table">1</ref>. Given two judgments j1 and j2, the extracted information supporting the score is composed by combining the information extracted from the individual modules. This kind of interpretable output format allows for a more transparent similarity measure, easy to motivate from a legal perspective.</p><p>Since we cannot provide an interpretable output for the decision-based similarity module, the numeric score is substituted with the text used to compute it, so that a legal actor can easily evaluate the accuracy of the comparison.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Evaluation</head><p>Due to the nature of the task and the domain of the documents, it was necessary to resort to domain experts in order to obtain an evaluation of the resulting similarity scores. The experts were presented with a set of triplets of judgments with shape (⋆,+,−) as evaluated by the pipeline where • ⋆ indicates the judgment taken into consideration, selected randomly from the analyzed data • + indicates a judgment evaluated as similar to ⋆ • − indicates a judgment evaluated as different from ⋆ They were then asked to binary rate the outputs as accurate or inaccurate and the time taken for the reading of each judgment.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Inter-Annotator Agreement</head><p>The Inter-Annotator Agreement was evaluated using Cohen's Kappa <ref type="bibr" target="#b12">[14]</ref>, obtaining 𝜅 = 0.769. The same metric was used to compute the average agreement between the annotators and the pipeline output, resulting in 𝜅 = 0.885. it is worth noting that the final evaluation was influenced by the subjective nature of Similar Case Matching.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Time</head><p>The average reading time (minutes per page) for legal judgments is calculated among the annotators and separated by types (time ⋆ = 3, time + = 3, time − = 1.7). The time starts with the reading of the document in order to define whether two sentences are similar or different and ends with the closing of the document. The reading does not have to be complete. Notably, these measurements do not include the search for judgments that legal domain experts would have had to do in the absence of this system.</p><p>On the other hand, through the computational pipeline analysis, in a few seconds a judgment can be analyzed and compared to every other judgment in the dataset, in order to obtain a similarity score. Moreover, it is important to acknowledge that once the judgment is analyzed by the system, all the partial results are stored and accessible in O(n).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Further considerations</head><p>From the evaluation process it emerged that judgments redacted by the same judge in a close time interval tend to be very similar to each other. This can be motivated by personal stylistic choices such as chosen lexicon and personal interpretation of the cited documents.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Future Work</head><p>In this section, possible future developments of this work are presented by topic.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.1.">Classification Comparison</head><p>From the perspective of generalizing the pipeline to different judgment sets, its first step should not rely solely on the labels present in the dataset. A more generic approach can be found by automatically classifying the documents and storing this information together with the judgments' metadata. Given the absence of a standard of classification among courts, this task presents different challenges and requires an alignment of the different classification taxonomies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.2.">Decision-based Similarity</head><p>The extraction of the lexical embeddings as presented in this work can be improved in different ways. The first aspect to take into account is the extraction of the most significant part of the judgment on which to focus to obtain said embeddings. While it is true that the most relevant information is to be found in the first part of the decision paragraph, there has to be a more thorough analysis of the length of the portion to be selected. Furthermore, since juridical documents are unstructured by nature, the decision paragraph is not always present and can often be merged with other Sezioni such as Fatti. For this reason, it is necessary to find a method of identifying such a paragraph that does not rely solely on the formatting of the document. Looking at the module from another perspective, more investigation could be done on the model to be used to create said embeddings.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.3.">Citation Overlap</head><p>In order to define a more precise and meaningful citation overlap score, this measure could be weighed in different ways.</p><p>Citation stance A first suggestion would be to refine the calculation of overlap between citations by weighing each citation according to the stance of the context in which it appears. This is because a sentence may cite another document to accommodate its meaning or to distance itself from it. From this point of view, two judgments having the same citation but with different stances would indeed be in the same legal context but would have a different connotation that would allow a different nuance of meaning to be highlighted.</p><p>Naively, this differentiation can be tackled through the computation of the polarity of the sentences in which the citations appear. Subsequently, said results can be further refined by a more precise stance detection analysis. Nevertheless, given the domain of the documents and the fact that the target of the analysis is known and always present in the sentences taken into consideration, the two tasks are in some way overlapping and the polarity of a sentence can coincide with its stance in regards to the citation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Citation relevance</head><p>The score computation could be further perfected by assigning a different degree of importance to each kind of citation. Although all references to other legal documents contribute in some way to defining the document's context, some (such as Supreme Court decisions) have higher relevance than others.</p><p>Through a deeper investigation of the legal landscape, it would be possible to configure these weights so that each citation could be given the importance that it actually has, ulteriorly refining the overlap score.</p><p>On the same idea, some documents could be often referenced without a direct correlation to the judgment's topic. In this scenario, it would be appropriate to consider a relevance measure to lower their contribution to the overall overlap measure. In particular, always-cited and background citations do not attribute additional information for defining the citation-based context, so it may be relevant to ignore them.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Improved extraction of caselaw citations</head><p>The extraction of the Supreme Court's rulings can be explored even to a greater extent since it can be useful to map principles of law stated and renewed. In the Italian legal system, it is considered a principle of law a generalization of the interpretation and application of the rule to a concrete case, given by the function of nomophilacy given by the Supreme Court (i.e. Corte di Cassazione). As discovered through the analysis conducted by our legal domain experts, there is a one-to-one correlation between principles of law and Supreme Court's citations in the explicit form. With the proper preprocessing and structure of the data, the aid of proper algorithms, the pattern found by the regex used in our experiments can represent an accurate extraction methodology of both Supreme Court citations and principles of law.</p><p>Outcome extraction An additional step in our pipeline would be the extraction of the judgment's outcome which would allow for a better understanding of the judgment as a whole.</p><p>With legal research in mind, being able to automatically extract the output of a judgment would enable more sophisticated features such as filtering the documents given their final decision.</p><p>Time evaluation It will be interesting to study the manual task again with the support of the developed computer system, so it may be possible to evaluate the usefulness, effectiveness and time gained. In addition, feedback given by domain experts about the actual potential of the search engine support is important.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="8.">Conclusions</head><p>The algorithmic reproduction of legal domain experts' modus operandi can be implemented and of great interest for the optimization of legal proceedings, as it was shown to be far more effective and time-efficient than the current procedure.</p><p>The modularity of the pipeline allows for a scalable solution, which allows for a thorough analysis and comparison of legal documents in seconds and an indexing in O(n). By integrating such computation in an online platform for the consultation of legal documents, it would be possible to increase the productivity of magistrates by providing them with an interpretable and transparent resource targeted to legal domain experts. Consequently, by facilitating the reading and the retrieval of relevant information within the text, this approach would contribute to the disposal of the backlog inside Courts.</p><p>Furthermore, the reproduction of an existing procedure for reading and comparing legal documents, allows for the collection of relevant data, which can be used by legal domain experts to evaluate the pipeline output.</p><p>The dataset used for these experiments was retrieved from a public online platform aimed at consulting Italian legal documents <ref type="bibr">[10]</ref>. Nevertheless, the proposed pipeline can be extended to any measure by any legal system, by using a legal dataset retrieved from Eur-Lex [15], an online portal that provides the official and most complete access to EU legal documents, in all 24 official EU languages. Its use may allow the identification of judicial similarities even between judgments written in different languages, facilitating the drafting motivation-phase of rulings by Member States Courts, related, for example, to preliminary reference to CJEU (i.e. Court Of Justice Of The European Union).</p><p>Furthermore, the availability of the same text in multiple languages would allow optimal results by computing every module of the pipeline using the language in which the technologies used have the best performances. implementation of innovative operating models in the judicial offices for the disposal of the backlog", promoted by the Italian Ministry of Justice and implemented in synergy with the interventions envisaged by the National Recovery and Resilience Plan (NRRP) in support to the justice reform.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Judgments distribution within the 8 most common labels in the dataset.</figDesc><graphic coords="4,89.29,84.19,416.70,157.91" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Flowchart describing the pipeline for comparing legal judgments.</figDesc><graphic coords="6,89.29,84.19,416.66,166.63" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_0">https://www.nextgenerationupp.unito.it/home</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>The research work has been funded in Next Generation UPP <ref type="bibr" target="#b4">5</ref> project supported from the European Union, National Operational Program Governance and Institutional Capacity 2014-2020, European Social Fund and European Regional Development Fund. The Next Generation UPP project is part of the "Unitary project for the dissemination of the Office for Trial and the</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Le banche dati di giurisprudenza e l&apos;ufficio per il processo</title>
		<author>
			<persName><forename type="first">Marco</forename><surname>Ciccarelli</surname></persName>
		</author>
		<idno>ac- cessed 02.05</idno>
		<ptr target="https://www.questionegiustizia.it/articolo/le-banche-dati-di-giurisprudenza-e-l-ufficio-per-il-processo" />
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A brief history of computer-assisted legal research</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">G</forename><surname>Harrington</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Law. Libr. J</title>
		<imprint>
			<biblScope unit="volume">77</biblScope>
			<biblScope unit="page">543</biblScope>
			<date type="published" when="1984">1984</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Finding similar legal judgements under common law system</title>
		<author>
			<persName><forename type="first">S</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">K</forename><surname>Reddy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">B</forename><surname>Reddy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Suri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Databases in Networked Information Systems: 8th International Workshop, DNIS 2013</title>
				<meeting><address><addrLine>Aizu-Wakamatsu, Japan</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">March 25-27, 2013. 2013</date>
			<biblScope unit="page" from="103" to="116" />
		</imprint>
	</monogr>
	<note>Proceedings 8</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Citation metrics for legal information retrieval: Scholars and practitioners intertwined?</title>
		<author>
			<persName><forename type="first">G</forename><surname>Wiggers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Verberne</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G.-J</forename><surname>Zwenne</surname></persName>
		</author>
		<idno type="DOI">10.1017/S1472669622000160</idno>
	</analytic>
	<monogr>
		<title level="j">Legal Information Management</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="88" to="103" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Lesicin: A heterogeneous graph-based approach for automatic legal statute identification from indian legal documents</title>
		<author>
			<persName><forename type="first">S</forename><surname>Paul</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Goyal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ghosh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">AAAI Conference on Artificial Intelligence</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">S</forename><surname>Dhani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bhatt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ganesan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Sirohi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Bhatnagar</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2107.04771</idno>
		<title level="m">Similar cases recommendation using legal knowledge graphs</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<author>
			<persName><forename type="first">P</forename><surname>Bhattacharya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Ghosh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Pal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ghosh</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2004.12307</idno>
		<title level="m">Methods for computing legal document similarity: A comparative study</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Structural scaffolds for citation intent classification in scientific publications</title>
		<author>
			<persName><forename type="first">A</forename><surname>Cohan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Ammar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Van Zuylen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Cady</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/n19-1361</idno>
		<ptr target="https://doi.org/10.18653/v1/n19-1361.doi:10.18653/v1/n19-1361" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019</title>
				<editor>
			<persName><forename type="first">J</forename><surname>Burstein</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Doran</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">T</forename><surname>Solorio</surname></persName>
		</editor>
		<meeting>the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019<address><addrLine>Minneapolis, MN, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">June 2-7, 2019. 2019</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="3586" to="3596" />
		</imprint>
	</monogr>
	<note>Association for Computational Linguistics</note>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">An interpretability framework for similar case matching</title>
		<author>
			<persName><forename type="first">N</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Yang</surname></persName>
		</author>
		<idno>ArXiv abs/2304.01622</idno>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Morph-it, A free corpus-based morphological resource for the Italian language</title>
		<author>
			<persName><forename type="first">E</forename><surname>Zanchetta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Baroni</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Corpus Linguistics</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<date type="published" when="2005">2005. 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">ITALIAN-LEGAL-BERT: A Pre-trained Transformer Language Model for Italian Law</title>
		<author>
			<persName><forename type="first">D</forename><surname>Licari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Comandè</surname></persName>
		</author>
		<ptr target="iSSN:1613-0073" />
	</analytic>
	<monogr>
		<title level="m">Companion Proceedings of the 23rd International Conference on Knowledge Engineering and Knowledge Management</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">D</forename><surname>Symeonidou</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Yu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Ceolin</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Poveda-Villalón</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Audrito</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><forename type="middle">D</forename><surname>Caro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Grasso</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Nai</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">E</forename><surname>Sulis</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><forename type="middle">J</forename><surname>Ekaputra</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">O</forename><surname>Kutz</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Troquard</surname></persName>
		</editor>
		<meeting><address><addrLine>Bozen-Bolzano, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">3256</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<title/>
		<author>
			<persName><surname>Linkoln</surname></persName>
		</author>
		<ptr target="http://ittig.github.io/Linkoln/" />
		<imprint>
			<date type="published" when="2023-04-27">27.04. 2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">A coefficient of agreement for nominal scales</title>
		<author>
			<persName><forename type="first">J</forename><surname>Cohen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Educational and Psychological Measurement</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="page" from="37" to="46" />
			<date type="published" when="1960">1960</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
