An Enhanced and High-Performance Algorithm for Accurate Named Entity Recognition in Legal Text

The rise of digital technologies results in the generation of large volumes of legal data. Although natural language legal texts are easily understood by humans, they pose significant challenges for machine processing. Converting this information into a machine-readable format is essential for efficient legal data analysis. In this paper, we propose resource-efficient method for extracting and classifying named entities within legal documents. We use rule-based learning and regular expressions to identify legal entities like parties, courts, and case references. Once extracted, these entities are classified into categories such as individuals, legal organizations, and jurisdictions. To improve both accuracy and processing speed, we implement a modified K-Means algorithm clustering the extracted entities. This clustering step refines the classification by grouping entities based on their shared attributes. The proposed method significantly enhances the speed and precision of Named Entity Recognition (NER) for legal texts, enabling faster and more efficient legal data processing.

Authors

Institutions

Publication Details

Published
2025-02-21
DOI
https://doi.org/10.1109/setcom64758.2025.10932533
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Enhanced and High-Performance Algorithm for Accurate Named Entity Recognition in Legal Text

Varsha Naik, Aniket Rahalkar
Topic Modeling
article

An Enhanced and High-Performance Algorithm for Accurate Named Entity Recognition in Legal Text

Varsha Naik, Aniket Rahalkar
article en

Abstract

The rise of digital technologies results in the generation of large volumes of legal data. Although natural language legal texts are easily understood by humans, they pose significant challenges for machine processing. Converting this information into a machine-readable format is essential for efficient legal data analysis. In this paper, we propose resource-efficient method for extracting and classifying named entities within legal documents. We use rule-based learning and regular expressions to identify legal entities like parties, courts, and case references. Once extracted, these entities are classified into categories such as individuals, legal organizations, and jurisdictions. To improve both accuracy and processing speed, we implement a modified K-Means algorithm clustering the extracted entities. This clustering step refines the classification by grouping entities based on their shared attributes. The proposed method significantly enhances the speed and precision of Named Entity Recognition (NER) for legal texts, enabling faster and more efficient legal data processing.

MIT World Peace University (IN)
Peace, Justice and strong institutions
Openalex Percentile: Top 97%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.