Mining Legal Arguments to Study Judicial Formalism
Not on the map. Why?
Abstract (arXiv)
Courts must justify their decisions, but systematically analyzing judicial reasoning at scale remains difficult. This study tests claims about formalistic judging in Central and Eastern Europe (CEE) by developing automated methods to detect and classify judicial reasoning in decisions of Czech Supreme Courts using state-of-the-art natural language processing methods. We create the MADON dataset of 272 decisions from two Czech Supreme Courts with expert annotations of 9,183 paragraphs with eight argument types and holistic formalism labels for supervised training and evaluation. Using a corpus of 300,511 Czech court decisions, we adapt transformer LLMs to Czech legal domain through continued pretraining and we experiment with methods to address dataset imbalance including asymmetric loss and class weighting. The best models can detect argumentative paragraphs (82.6% Bal-F1), classify traditional types of legal argument (77.5% Bal-F1), and classify decisions as formalistic/non-formalistic (83.8% Bal-F1). Our three-stage pipeline combining ModernBERT, Llama 3.1, and traditional feature-based machine learning achieves promising results for decision classification while reducing computational costs and increasing explainability. Empirically, we challenge prevailing narratives about CEE formalism. We demonstrate that legal argument mining enables promising judicial philosophy classification and highlight its potential for other important tasks in computational legal studies. Our methodology can be used across jurisdictions, and our entire pipeline, datasets, guidelines, models, and source codes are available at https://github.com/trusthlt/madon.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 112 references that are in the map. First posted on arXiv 12 Dec 2025.
Builds on
20 of 112 references.
References · 20
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
- 2023ChatGPT Outperforms Crowd-Workers for Text-Annotation Taskscited by 849
- 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 527
- 2021When Does Pretraining Help? Assessing Self-Supervised Learning for Law and the CaseHOLD Datasetcited by 199
- 2022The 'Problem' of Human Label Variation: On Ground Truth in Data, Modeling and Evaluationcited by 133
- 2021Toward a Perspectivist Turn in Ground Truthing for Predictive Computingcited by 129
- 2020LEGAL-BERT: The Muppets straight out of Law Schoolcited by 111
8 more
- 2017Neural End-to-End Learning for Computational Argumentation Miningcited by 41
- 2022Mining Legal Arguments in Court Decisionscited by 35
- 2020Multilingual Argument Mining: Datasets and Analysiscited by 19
- 2023Modeling Legal Reasoning: LM Annotation at the Edge of Human Agreementcited by 17
- 2021Lex Rosetta: Transfer of Predictive Models Across Languages, Jurisdictions, and Legal Domainscited by 11
- 2024Argument Mining in Data Scarce Settings: Cross-lingual Transfer and Few-shot Techniquescited by 6
- 2019The Czech Court Decisions Corpus (CzCDC): Availability as the First Stepcited by 1
- 2023LaCour!: Enabling Research on Argumentation in Hearings of the European Court of Human Rightscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.