Towards Intelligent Legal Document Analysis: CNN-Driven Classification of Case Law Texts

• URL: http://arxiv.org/abs/2604.17674v1
• Date: Mon, 20 Apr 2026 00:14:11 GMT
• Title: Towards Intelligent Legal Document Analysis: CNN-Driven Classification of Case Law Texts
• Abstract summary: This work presents a lightweight yet high-accuracy framework for citation-treatment classification.<n>It pairs lemmatisation-based preprocessing with subword-aware FastText embeddings and a one-dimensional Convolutional Neural Network (CNN)<n>The proposed system achieves 97.26% classification accuracy and a macro F1-score of 96.82%, surpassing established baselines.
• Score: 1.3192560874022086
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Legal practitioners and judicial institutions face an ever-growing volume of case-law documents characterised by formalised language, lengthy sentence structures, and highly specialised terminology, making manual triage both time-consuming and error-prone. This work presents a lightweight yet high-accuracy framework for citation-treatment classification that pairs lemmatisation-based preprocessing with subword-aware FastText embeddings and a multi-kernel one-dimensional Convolutional Neural Network (CNN). Evaluated on a publicly available corpus of 25,000 annotated legal documents with a 75/25 training-test partition, the proposed system achieves 97.26% classification accuracy and a macro F1-score of 96.82%, surpassing established baselines including fine-tuned BERT, Long Short-Term Memory (LSTM) with FastText, CNN with random embeddings, and a Term Frequency-Inverse Document Frequency (TF-IDF) k-Nearest Neighbour (KNN) classifier. The model also attains the highest Area Under the Receiver Operating Characteristic (AUC-ROC) curve of 97.83% among all compared systems while operating with only 5.1 million parameters and an inference latency of 0.31 ms per document - more than 13 times faster than BERT. Ablation experiments confirm the individual contribution of each pipeline component, and the confusion matrix reveals that residual errors are confined to semantically adjacent citation categories. These findings indicate that carefully designed convolutional architectures represent a scalable, resource-efficient alternative to heavyweight transformers for intelligent legal document analysis.

Related papers

• Benchmarking Classical and Transformer-Based Models for Document Sensitivity Classification [1.096626056612224]
  This paper introduces Strategic 16K, a leakage-controlled corpus of 16,000 diplomatic cables sourced from the WikiLeaks Public Library of US Diplomacy (PlusD)<n>We document an extended leakage removal protocol that identifies and eliminates three categories of residual classification markers embedded within document bodies.<n>Among classical models, TF-IDF with Logistic Regression achieves the strongest performance at significantly lower computational cost.
  arXiv  Detail & Related papers  (2026-08-05T05:00:41Z)
• Neuro-Symbolic AI for LEED compliance: Document-Centric Benchmarking, Deterministic Numeric Checking, and When Multimodal Hurts [0.0]
  This paper investigates whether small, locally deployed language models can perform meaningful screening of LEED documentation.<n>A neuro-symbolic pipeline is introduced that aligns project PDFs to LEED credit sections, retrieves evidence with credit-aware keyword signatures, and applies a LEED-specific numeric checker to quantitative thresholds.
  arXiv  Detail & Related papers  (2026-07-17T05:45:02Z)
• Cycle-Consistent Neural Explanation of Formal Verification Certificates [5.61123152362224]
  We propose a cycle-consistent neural architecture that generates faithful natural language explanations of verification certificates.<n>A pointer-generator mechanism ensures lexical grounding by copying state names directly from the certificate.<n>Our trained architecture, combined with a hybrid inference-time routing strategy, achieves 90.0% cycle-verified soundness.
  arXiv  Detail & Related papers  (2026-06-23T10:51:54Z)
• Context-Aware Distillation and Ablation for Text2DSL [78.29352305480285]
  We replace prompt-only synthetic generation with context-aware distillation.<n>A teacher large language model operates under an explicitly defined structured context.<n>This scales the verified PolkitBench corpus from 4,204 to 10,073 pairs.
  arXiv  Detail & Related papers  (2026-06-21T16:27:24Z)
• Error-Aware TF-IDF Retrieval-Augmented Generation for ASR Error Correction [0.0]
  This letter proposes a highly efficient, purely lexical error-aware framework to explicitly resolve phonetic and loop hallucinations.<n>Our approach integrates a symmetric text normalization module with a novel error-aware term frequency-inverse document frequency algorithm.
  arXiv  Detail & Related papers  (2026-06-19T16:43:31Z)
• Semantic Entanglement in Vector-Based Retrieval: A Formal Framework and Context-Conditioned Disentanglement Pipeline for Agentic RAG Systems [0.0]
  We formalize semantic entanglement as a model-relative measure of cross-topic overlap in embedding space.<n>We introduce the Semantic Disentanglement Pipeline (SDP), a four-stage preprocessing framework that restructures documents prior to embedding.<n>We evaluate SDP on a real-world enterprise healthcare knowledge base comprising over 2,000 documents across approximately 25 sub-domains.
  arXiv  Detail & Related papers  (2026-04-20T00:24:34Z)
• From Black Box to Glass Box: Cross-Model ASR Disagreement to Prioto Review in Ambient AI Scribe Documentation [43.148402136307716]
  Cross-model disagreement among heterogeneous ASR systems can act as a reference-free uncertainty signal.<n>We transcribed 50 publicly available medical audio clips with eight ASR systems spanning commercial APIs and open-source engines.<n>Low-agreement regions were enriched for content disagreements, with the content fraction increasing from 53.9% to 73.9% across quintiles of high-risk mass.
  arXiv  Detail & Related papers  (2026-03-02T13:02:13Z)
• A Theoretically Grounded Hybrid Ensemble for Reliable Detection of LLM-Generated Text [0.0]
  We propose a theoretically grounded hybrid ensemble that fuses three complementary detection paradigms.<n>The core novelty lies in an optimized weighted voting framework, where ensemble weights are learned on the probability simplex to maximize F1-score.<n>Our system achieves 94.2% accuracy and an AUC of 0.978, with a 35% relative reduction in false positives on academic text.
  arXiv  Detail & Related papers  (2025-11-27T06:42:56Z)
• Open Source State-Of-the-Art Solution for Romanian Speech Recognition [47.27624927463166]
  We present a new Romanian Automatic Speech Recognition (ASR) system based on NVIDIA's FastConformer architecture.<n>We train our model on a large corpus of weakly supervised transcriptions, totaling over 2,600 hours of speech.<n>Our system achieves state-of-the-art performance across all Romanian evaluation benchmarks.
  arXiv  Detail & Related papers  (2025-11-05T11:02:16Z)
• Span-level Detection of AI-generated Scientific Text via Contrastive Learning and Structural Calibration [2.105564340986074]
  Sci-SpanDet is a structure-aware framework for detecting AI-generated scholarly texts.<n>It combines section-conditioned stylistic modeling with multi-level contrastive learning to capture human nuanced-AI differences.<n>It achieves state-of-the-art performance, with F1(AI) of 80.17, AUROC of 92.63, and Span-F1 of 74.36.
  arXiv  Detail & Related papers  (2025-10-01T13:35:14Z)
• KELPS: A Framework for Verified Multi-Language Autoformalization via Semantic-Syntactic Alignment [5.295540405828356]
  KELPS is an iterative framework for translating, synthesizing, and filtering informal data into formal languages.<n>First, we translate natural language into Knowledge Equations (KEs), a novel language that we designed, theoretically grounded in assertional logic.<n>Next, we convert them to target languages through rigorously defined rules that preserve both syntactic structure and semantic meaning.<n>This process yielded a parallel corpus of over 60,000 problems.
  arXiv  Detail & Related papers  (2025-07-11T15:05:06Z)
• vCache: Verified Semantic Prompt Caching [95.16654660556975]
  This paper proposes vCache, the first verified semantic cache with user-defined error rate guarantees.<n>It employs an online learning algorithm to estimate an optimal threshold for each cached prompt, enabling reliable cache responses without additional training.<n>Our experiments show that vCache consistently meets the specified error bounds while outperforming state-of-the-art static-threshold and fine-tuned embedding baselines.
  arXiv  Detail & Related papers  (2025-02-06T04:16:20Z)
• HyPoradise: An Open Baseline for Generative Speech Recognition with Large Language Models [81.56455625624041]
  We introduce the first open-source benchmark to utilize external large language models (LLMs) for ASR error correction. The proposed benchmark contains a novel dataset, HyPoradise (HP), encompassing more than 334,000 pairs of N-best hypotheses. LLMs with reasonable prompt and its generative capability can even correct those tokens that are missing in N-best list.
  arXiv  Detail & Related papers  (2023-09-27T14:44:10Z)
• Factual Error Correction for Abstractive Summaries Using Entity Retrieval [57.01193722520597]
  We propose an efficient factual error correction system RFEC based on entities retrieval post-editing process. RFEC retrieves the evidence sentences from the original document by comparing the sentences with the target summary. Next, RFEC detects the entity-level errors in the summaries by considering the evidence sentences and substitutes the wrong entities with the accurate entities from the evidence sentences.
  arXiv  Detail & Related papers  (2022-04-18T11:35:02Z)
• GERE: Generative Evidence Retrieval for Fact Verification [57.78768817972026]
  We propose GERE, the first system that retrieves evidences in a generative fashion. The experimental results on the FEVER dataset show that GERE achieves significant improvements over the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-04-12T03:49:35Z)
• On Addressing Practical Challenges for RNN-Transduce [72.72132048437751]
  We adapt a well-trained RNN-T model to a new domain without collecting the audio data. We obtain word-level confidence scores by utilizing several types of features calculated during decoding. The proposed time stamping method can get less than 50ms word timing difference on average.
  arXiv  Detail & Related papers  (2021-04-27T23:31:43Z)
• Legal Document Classification: An Application to Law Area Prediction of Petitions to Public Prosecution Service [6.696983725360808]
  This paper proposes the use of NLP techniques for textual classification. Our main goal is to automate the process of assigning petitions to their respective areas of law. The best results were obtained with a combination of Word2Vec trained on a domain-specific corpus and a Recurrent Neural Network architecture.
  arXiv  Detail & Related papers  (2020-10-13T18:05:37Z)

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.