<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Legal Explanations | Language Technologies Lab</title><link>https://nlp.unibo.it/tag/legal-explanations/</link><atom:link href="https://nlp.unibo.it/tag/legal-explanations/index.xml" rel="self" type="application/rss+xml"/><description>Legal Explanations</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 13 Oct 2026 00:00:00 +0000</lastBuildDate><image><url>https://nlp.unibo.it/media/logo.svg</url><title>Legal Explanations</title><link>https://nlp.unibo.it/tag/legal-explanations/</link></image><item><title>Explaining Unfair Clauses in Terms of Service</title><link>https://nlp.unibo.it/proposals/legal/tos-explanations/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://nlp.unibo.it/proposals/legal/tos-explanations/</guid><description>&lt;h2 id="context"&gt;Context&lt;/h2&gt;
&lt;p&gt;Privacy policies and terms of service often contain clauses that are unfair to customers or do not fully meet the General Data Protection Regulation (GDPR).
These documents are long and technical, so their analysis is complex and slow.
Artificial intelligence can help users understand them and make informed decisions.&lt;/p&gt;
&lt;h2 id="objective"&gt;Objective&lt;/h2&gt;
&lt;p&gt;This proposal uses large language models to generate legal explanations of whether a clause in a digital contract can be considered fair.
The model may classify the clause itself or motivate a label assigned by a person or another system.
The thesis evaluates the impact of the available information, such as guidelines or other contracts, and of the technique, such as retrieval-augmented generation or few-shot learning.&lt;/p&gt;
&lt;figure class="lt-viz lt-svg" style="--lt-svg-min: 640px"&gt;
&lt;svg viewBox="0 0 800 270" role="img" aria-labelledby="tosexp-title" xmlns="http://www.w3.org/2000/svg"&gt;
&lt;defs&gt;&lt;marker id="tosexp-arrow" viewBox="0 0 10 10" refX="8" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"&gt;&lt;path class="lt-s-head" d="M0 0 L10 5 L0 10 z"/&gt;&lt;/marker&gt;&lt;/defs&gt;
&lt;title id="tosexp-title"&gt;An illustrative clause of a Terms of Service document, We may change these terms at any time, goes to a large language model. The model receives information such as guidelines or other contracts, through retrieval-augmented generation or few-shot learning. It returns a label, fair or unfair, which is either its own or given by a person or another system, and a legal explanation of why the label holds.&lt;/title&gt;
&lt;text class="lt-s-sub" x="20" y="22"&gt;A CLAUSE OF A TERMS OF SERVICE&lt;/text&gt;
&lt;rect class="lt-s-tok" x="20" y="34" width="330" height="56" rx="10"/&gt;
&lt;text class="lt-s-txt" x="185" y="67"&gt;We may change these terms at any time.&lt;/text&gt;
&lt;text class="lt-s-sub" x="20" y="140"&gt;INFORMATION&lt;/text&gt;
&lt;rect class="lt-s-box lt-s-pred" x="20" y="152" width="330" height="64" rx="12"/&gt;
&lt;text class="lt-s-txt lt-s-strong" x="185" y="178"&gt;Guidelines or other contracts&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-small" x="185" y="200"&gt;through RAG or few-shot learning&lt;/text&gt;
&lt;path class="lt-s-arrow" marker-end="url(#tosexp-arrow)" d="M354 62 H380 V112 H406"/&gt;
&lt;path class="lt-s-arrow" marker-end="url(#tosexp-arrow)" d="M354 184 H380 V148 H406"/&gt;
&lt;rect class="lt-s-box lt-s-sel" x="410" y="96" width="160" height="68" rx="12"/&gt;
&lt;text class="lt-s-txt lt-s-strong" x="490" y="125"&gt;Large language&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-strong" x="490" y="145"&gt;model&lt;/text&gt;
&lt;text class="lt-s-sub" x="620" y="22"&gt;OUTPUT&lt;/text&gt;
&lt;path class="lt-s-arrow" d="M574 130 H596 V62 V184"/&gt;
&lt;path class="lt-s-arrow" marker-end="url(#tosexp-arrow)" d="M596 62 H616"/&gt;
&lt;path class="lt-s-arrow" marker-end="url(#tosexp-arrow)" d="M596 184 H616"/&gt;
&lt;rect class="lt-s-label" x="620" y="40" width="160" height="44" rx="22"/&gt;
&lt;text class="lt-s-txt lt-s-strong lt-s-labeltxt" x="700" y="67"&gt;fair or unfair&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-small" x="700" y="110"&gt;its own label, or one given&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-small" x="700" y="126"&gt;by a person or a system&lt;/text&gt;
&lt;rect class="lt-s-tok" x="620" y="156" width="160" height="56" rx="10"/&gt;
&lt;text class="lt-s-txt lt-s-strong" x="700" y="180"&gt;Explanation&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-small" x="700" y="200"&gt;why the label holds&lt;/text&gt;
&lt;text class="lt-s-txt lt-s-small" x="400" y="254"&gt;The thesis measures how the type of information and the technique change the explanations.&lt;/text&gt;
&lt;/svg&gt;
&lt;figcaption&gt;The explanation task on the illustrative clause of the unfair clause detection proposal, built from the description of the proposal.&lt;/figcaption&gt;
&lt;/figure&gt;</description></item></channel></rss>