LAMUS: A Large-Scale Corpus for Legal Argument Mining from U.S. Caselaw using LLMs

• URL: http://arxiv.org/abs/2603.08286v1
• Date: Mon, 09 Mar 2026 12:01:42 GMT
• Title: LAMUS: A Large-Scale Corpus for Legal Argument Mining from U.S. Caselaw using LLMs
• Abstract summary: This paper introduces LAMUS, a sentence-level legal argument mining corpus constructed from U.S. Supreme Court decisions and Texas criminal appellate opinions.<n>The dataset is created using a data-centric pipeline that combines large-scale case collection, automatic annotation, and targeted human-in-the-loop quality refinement.
• Score: 0.5830619388189558
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Legal argument mining aims to identify and classify the functional components of judicial reasoning, such as facts, issues, rules, analysis, and conclusions. Progress in this area is limited by the lack of large-scale, high-quality annotated datasets for U.S. caselaw, particularly at the state level. This paper introduces LAMUS, a sentence-level legal argument mining corpus constructed from U.S. Supreme Court decisions and Texas criminal appellate opinions. The dataset is created using a data-centric pipeline that combines large-scale case collection, LLM-based automatic annotation, and targeted human-in-the-loop quality refinement. We formulate legal argument mining as a six-class sentence classification task and evaluate multiple general-purpose and legal-domain language models under zero-shot, few-shot, and chain-of-thought prompting strategies, with LegalBERT as a supervised baseline. Results show that chain-of-thought prompting substantially improves LLM performance, while domain-specific models exhibit more stable zero-shot behavior. LLM-assisted verification corrects nearly 20% of annotation errors, improving label consistency. Human verification achieves Cohen's Kappa of 0.85, confirming annotation quality. LAMUS provides a scalable resource and empirical insights for future legal NLP research. All code and datasets can be accessed for reproducibility on GitHub at: https://github.com/LavanyaPobbathi/LAMUS/tree/main

Related papers

• From Benchmarking to Reasoning: A Dual-Aspect, Large-Scale Evaluation of LLMs on Vietnamese Legal Text [0.0]
  This paper introduces a comprehensive dual-aspect evaluation framework to address this need.<n>We establish a performance benchmark for four state-of-the-art large language models across three key dimensions: Accuracy, Readability, and Consistency.<n>Our results reveal a crucial trade-off: models like Grok-1 excel in Readability and Consistency but compromise on fine-grained legal Accuracy.
  arXiv  Detail & Related papers  (2026-04-17T17:28:23Z)
• Blind to the Human Touch: Overlap Bias in LLM-Based Summary Evaluation [89.52571224447111]
  Large language model (LLM) judges have often been used alongside traditional, algorithm-based metrics for tasks like summarization.<n>We provide an LLM judge bias analysis as a function of overlap with human-written responses in the domain of summarization.
  arXiv  Detail & Related papers  (2026-02-07T19:39:28Z)
• Place Matters: Comparing LLM Hallucination Rates for Place-Based Legal Queries [8.865671688076574]
  We show that the rate of hallucination of legal information by leading closed-source LLMs is significantly associated with place.<n>This suggests that the quality of legal solutions provided by these models is not evenly distributed across geography.
  arXiv  Detail & Related papers  (2025-11-10T04:42:00Z)
• Better Call CLAUSE: A Discrepancy Benchmark for Auditing LLMs Legal Reasoning Capabilities [15.35489310097019]
  CLAUSE is a first-of-its-kind benchmark designed to evaluate the fragility of an LLM's legal reasoning.<n>Our work outlines a path to identify and correct such reasoning failures in legal AI.
  arXiv  Detail & Related papers  (2025-11-01T00:51:21Z)
• Relative Scaling Laws for LLMs [91.73497548097775]
  Scaling laws describe how language models improve with additional data, parameters, and compute.<n>We introduce relative scaling laws, which track how performance gaps between test distributions evolve with scale.<n>These results show that although scaling improves overall performance, it is not a universal equalizer.
  arXiv  Detail & Related papers  (2025-10-28T16:55:22Z)
• Verifying the Verifiers: Unveiling Pitfalls and Potentials in Fact Verifiers [59.168391398830515]
  We evaluate 12 pre-trained LLMs and one specialized fact-verifier, using a collection of examples from 14 fact-checking benchmarks.<n>We highlight the importance of addressing annotation errors and ambiguity in datasets.<n> frontier LLMs with few-shot in-context examples, often overlooked in previous works, achieve top-tier performance.
  arXiv  Detail & Related papers  (2025-06-16T10:32:10Z)
• LLMPR: A Novel LLM-Driven Transfer Learning based Petition Ranking Model [0.0699049312989311]
  We propose an automated framework that assigns priority rankings to legal petitions based on their contextual urgency.<n>Our experiments demonstrate that Random Forest and Decision Tree models yield superior performance.<n>These findings suggest that automated petition ranking can effectively streamline judicial, reduce case backlog, and improve fairness in legal prioritization.
  arXiv  Detail & Related papers  (2025-05-27T19:25:24Z)
• AnnoCaseLaw: A Richly-Annotated Dataset For Benchmarking Explainable Legal Judgment Prediction [56.797874973414636]
  AnnoCaseLaw is a first-of-its-kind dataset of 471 meticulously annotated U.S. Appeals Court negligence cases.<n>Our dataset lays the groundwork for more human-aligned, explainable Legal Judgment Prediction models.<n>Results demonstrate that LJP remains a formidable task, with application of legal precedent proving particularly difficult.
  arXiv  Detail & Related papers  (2025-02-28T19:14:48Z)
• CaseSumm: A Large-Scale Dataset for Long-Context Summarization from U.S. Supreme Court Opinions [25.82451110740322]
  This paper introduces CaseSumm, a novel dataset for long-context summarization in the legal domain.<n>We collect 25.6K U.S. Supreme Court (SCOTUS) opinions and their official summaries, known as "syllabuses"<n>Our dataset is the largest open legal case summarization dataset, and is the first to include summaries of SCOTUS decisions dating back to 1815.
  arXiv  Detail & Related papers  (2024-12-30T19:00:01Z)
• Bayesian scaling laws for in-context learning [85.34114399339741]
  In-context learning (ICL) is a powerful technique for getting language models to perform complex tasks with no training updates.<n>We show that ICL approximates a Bayesian learner, which gives rise to a novel Bayesian scaling law for ICL.<n>Our scaling law matches existing scaling laws in accuracy while also offering interpretable terms for task priors, learning efficiency, and per-example probabilities.
  arXiv  Detail & Related papers  (2024-10-21T21:45:22Z)
• LLM-Generated Natural Language Meets Scaling Laws: New Explorations and Data Augmentation Methods [3.333401582174629]
  We introduce the scaling laws to intrinsically calculate large language models (LLMNL) and human natural language (HNL) Through experiments, we reveal slight deviations from Mandelbrot's law in LLMNL, underscore a complexity advantage in HNL, and supplement an interpretive discussion on language style. We introduce a novel data augmentation method for few-shot text classification, termed ZGPTDA, which leverages fuzzy computing mechanisms driven by the conformity to scaling laws.
  arXiv  Detail & Related papers  (2024-06-29T05:40:17Z)
• CLadder: Assessing Causal Reasoning in Language Models [82.8719238178569]
  We investigate whether large language models (LLMs) can coherently reason about causality. We propose a new NLP task, causal inference in natural language, inspired by the "causal inference engine" postulated by Judea Pearl et al.
  arXiv  Detail & Related papers  (2023-12-07T15:12:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.