mlsanityData to 14 Oct 2026

Precise Legal Sentence Boundary Detection for Retrieval at Scale: NUPunkt and CharBoundary

arXiv 2504.04131 ↗First posted 5 Apr 2025cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

We present NUPunkt and CharBoundary, two sentence boundary detection libraries optimized for high-precision, high-throughput processing of legal text in large-scale applications such as due diligence, e-discovery, and legal research. These libraries address the critical challenges posed by legal documents containing specialized citations, abbreviations, and complex sentence structures that confound general-purpose sentence boundary detectors. Our experimental evaluation on five diverse legal datasets comprising over 25,000 documents and 197,000 annotated sentence boundaries demonstrates that NUPunkt achieves 91.1% precision while processing 10 million characters per second with modest memory requirements (432 MB). CharBoundary models offer balanced and adjustable precision-recall tradeoffs, with the large model achieving the highest F1 score (0.782) among all tested methods. Notably, NUPunkt provides a 29-32% precision improvement over general-purpose tools while maintaining exceptional throughput, processing multi-million document collections in minutes rather than hours. Both libraries run efficiently on standard CPU hardware without requiring specialized accelerators. NUPunkt is implemented in pure Python with zero external dependencies, while CharBoundary relies only on scikit-learn and optional ONNX runtime integration for optimized performance. Both libraries are available under the MIT license, can be installed via PyPI, and can be interactively tested at https://sentences.aleainstitute.ai/. These libraries address critical precision issues in retrieval-augmented generation systems by preserving coherent legal concepts across sentences, where each percentage improvement in precision yields exponentially greater reductions in context fragmentation, creating cascading benefits throughout retrieval pipelines and significantly enhancing downstream reasoning quality.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 22 references that are in the map. First posted on arXiv 5 Apr 2025.

Builds on

6 of 22 references.

References · 6

  1. 2019BERT for Joint Intent Classification and Slot Fillingcited by 196
  2. 2024LegalBench-RAG: A Benchmark for Retrieval-Augmented Generation in the Legal Domaincited by 118
  3. 2024CBR-RAG: Case-Based Reasoning for Retrieval Augmented Generation in LLMs for Legal Question Answeringcited by 72
  4. 2020PySBD: Pragmatic Sentence Boundary Disambiguationcited by 38
  5. 2018Obligation and Prohibition Extraction Using Hierarchical RNNscited by 18
  6. 2023MultiLegalSBD: A Multilingual Legal Sentence Boundary Detection Datasetcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Towards Reliable Retrieval in RAG Systems for Large Legal Datasets
  2. 2026Chunking German Legal Code
  3. 2026Legal RAG Bench: an end-to-end benchmark for legal RAG
  4. 2023One Law, Many Languages: Benchmarking Multilingual Legal Reasoning for Judicial Support
  5. 2026Enhancing Legal LLMs through Metadata-Enriched RAG Pipelines and Direct Preference Optimization
  6. 2025Logic Haystacks: Probing LLMs Long-Context Logical Reasoning (Without Easily Identifiable Unrelated Padding)
  7. 2025Scaling Legal AI: Benchmarking Mamba and Transformers for Statutory Classification and Case Law Retrieval
  8. 2026UA-Legal-Bench: A Benchmark for Evaluating Large Language Models on Ukrainian Legal Reasoning