Skip to content

Prompting Beats Fine-Tuning: Generative Expected Value Scoring for Statutory Term Retrieval

Jul 2026 · arXiv.org · Vol abs/2607.05582 · 0 citations · 27 references
Computer Science

TL;DR

This work studies the task of ranking case-law sentences by their usefulness for explaining a concept or target statutory term, using an established dataset of 26,959 sentences covering 42 U.S. Code concepts labeled into four explanatory-value categories.

Abstract

Legal concepts in statutes are often expressed using vague terms, and practitioners frequently turn to case law to interpret them. We study the task of ranking case-law sentences by their usefulness for explaining a concept or target statutory term, using an established dataset of 26,959 sentences covering 42 U.S. Code concepts labeled into four explanatory-value categories. We compare two families of methods: (i) supervised fine-tuning of encoder-only models (ModernBERT) and (ii) zero-shot prompting of decoder-only models. We show that across all concepts and standard NDCG cutoffs, ModernBERT largely matches earlier BERT-family baselines. In contrast, prompting decoder-only models achieves the strongest overall effectiveness, with our best system surpassing all previously reported state-of-the-art results on this task.

View source

Similar papers

Preprint Aug 2026

PROSLEX: A Novel Dataset for Expert-Annotated Legal Statute Prediction for Indian Judiciary

This work presents PROSLEX (PRediction Of Statutes and LEgal eXplanation), a comprehensive dataset comprising 1,623 expert-annotated legal documents from the Indian context, positioning PROSLEX as a benchmark for developing explainable AI systems that can support legal practitioners while advancing research in interpre...

Subinay Adhikary, Upal Bhattacharya, Vivek K. Singh et al. · 0 citations
#machine learning Preprint Sep 2026

LLMs as Feature Engineers for Text-and-Tabular Prediction

An iterative framework that automates the extraction of interpretable, schema-bound categorical features from unstructured text for tabular prediction models that guarantees instance-level interpretability and provides a fully transparent, semantic audit trail for every prediction.

Merwan Barlier, Blaž Škrlj · 1 citation
#natural language process... Preprint Aug 2026

Annotated Surrogate Retrieval for Polish Statutory Law

It is reported that the ranking advantage of ASCR-H does not extend to citation accuracy, where DTF matches the oracle ceiling, and three negative results on lemmatisation, pseudo-relevance feedback and query rewriting.

Orkun Yiğit Cengiz · 0 citations
#natural language process... Preprint Sep 2026

Classifying Interpretive Canons at the Sentence Level: A Benchmark from the German Federal Constitutional Court

Judicial reasoning remains challenging for large language models (LLMs) to analyze. This paper contributes a sentence-level benchmark for evaluating the ability of LLMs to classify interpretive canons as articulated by Larenz in the tradition of Savigny. Our contributions are threefold. First, we operationalize this co...

Felix Ringe · 0 citations
2026

"Decode the Law": Towards Legal Text Simplification with Large Language Models

SIMPLE-LAW is introduced, a curated benchmark dataset of over 6,000 aligned pairs of original and simplified legal passages, specifically constructed to facilitate research in legal text simplification by leveraging large language models (LLMs).

Mohammed Danish Rabbani, Subhadeep Roy, Sayantan Mitra et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.