ReLeVAnT: Relevance Lexical Vectors for Accurate Legal Text Classification

• URL: http://arxiv.org/abs/2604.22292v1
• Date: Fri, 24 Apr 2026 07:13:24 GMT
• Title: ReLeVAnT: Relevance Lexical Vectors for Accurate Legal Text Classification
• Abstract summary: ReLeVAnT is a framework for legal document binary classification.<n>It uses n-gram processing, contrastive score matching, and a shallow neural network as the primary drivers for discriminative classification.<n>It has 99.3% accuracy and 98.7% F1 score on the LexGLUE dataset.
• Score: 5.530730417910086
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The classification of legal documents from an unstructured data corpus has several crucial applications in downstream tasks. Documents relevant to court filings are key in use cases such as drafting motions, memos, and outlines, as well as in tasks like docket summarisation, retrieval systems, and training data curation. Current methods classify based on provided metadata, LLM-extracted metadata, or multimodal methods. These methods depend on structured data, metadata, and extensive computational power. This task is approached from a perspective of leveraging discriminative features in the documents between classes. The authors propose ReLeVAnT, a framework for legal document binary classification. ReLeVAnT utilises n-gram processing, contrastive score matching, and a shallow neural network as the primary drivers for discriminative classification. It leverages one-time keyword extraction per corpus, followed by a shallow classifier to swiftly and reliably classify documents with 99.3% accuracy and 98.7% F1 score on the LexGLUE dataset.

Related papers

• Performance Analysis of Supervised Machine Learning Algorithms for Text Classification [0.0]
  This paper illustrates the text classification process on different datasets using some standard supervised machine learning techniques.<n> Labeled text documents are used to classify the text in supervised classifications.<n> Experimental analysis on real data reveals which model works well in terms of classification accuracy.
  arXiv  Detail & Related papers  (2025-08-31T20:30:52Z)
• Learning Refined Document Representations for Dense Retrieval via Deliberate Thinking [58.69615583599489]
  Deliberate Thinking based Retriever (Debater) is a novel approach that enhances document representations by incorporating a step-by-step thinking process.<n>Debater significantly outperforms existing methods across several retrieval benchmarks.
  arXiv  Detail & Related papers  (2025-02-18T15:56:34Z)
• Contextual Document Embeddings [77.22328616983417]
  We propose two complementary methods for contextualized document embeddings. First, an alternative contrastive learning objective that explicitly incorporates the document neighbors into the intra-batch contextual loss. Second, a new contextual architecture that explicitly encodes neighbor document information into the encoded representation.
  arXiv  Detail & Related papers  (2024-10-03T14:33:34Z)
• Document Classification using File Names [7.130525292849283]
  Rapid document classification is critical in several time-sensitive applications like digital forensics and large-scale media classification.<n>Traditional approaches that rely on heavy-duty deep learning models fall short due to high inference times over vast input datasets and computational resources associated with analyzing whole documents.<n>We present a method using lightweight supervised learning models, combined with a TF-IDF feature extraction-based tokenization method, to accurately and efficiently classify documents based solely on file names.
  arXiv  Detail & Related papers  (2024-10-02T01:42:19Z)
• PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrieval [76.50690734636477]
  We propose PromptReps, which combines the advantages of both categories: no need for training and the ability to retrieve from the whole corpus. The retrieval system harnesses both dense text embedding and sparse bag-of-words representations.
  arXiv  Detail & Related papers  (2024-04-29T04:51:30Z)
• Lbl2Vec: An Embedding-Based Approach for Unsupervised Document Retrieval on Predefined Topics [0.6767885381740952]
  We introduce a method that learns jointly embedded document and word vectors solely from the unlabeled document dataset. The proposed method requires almost no text preprocessing but is simultaneously effective at retrieving relevant documents with high probability. For easy replication of our approach, we make the developed Lbl2Vec code publicly available as a ready-to-use tool under the 3-Clause BSD license.
  arXiv  Detail & Related papers  (2022-10-12T08:57:01Z)
• 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)
• Improving Probabilistic Models in Text Classification via Active Learning [0.0]
  We propose a fast new model for text classification that combines information from both labeled and unlabeled data with an active learning component. We show that by introducing information about the structure of unlabeled data and iteratively labeling uncertain documents, our model improves performance.
  arXiv  Detail & Related papers  (2022-02-05T20:09:26Z)
• Out-of-Category Document Identification Using Target-Category Names as Weak Supervision [64.671654559798]
  Out-of-category detection aims to distinguish documents according to their semantic relevance to the inlier (or target) categories. We present an out-of-category detection framework, which effectively measures how confidently each document belongs to one of the target categories.
  arXiv  Detail & Related papers  (2021-11-24T21:01:25Z)
• LeQua@CLEF2022: Learning to Quantify [76.22817970624875]
  LeQua 2022 is a new lab for the evaluation of methods for learning to quantify'' in textual datasets. The goal of this lab is to provide a setting for the comparative evaluation of methods for learning to quantify, both in the binary setting and in the single-label multiclass setting.
  arXiv  Detail & Related papers  (2021-11-22T14:54:20Z)
• Comparative Study of Long Document Classification [0.0]
  We revisit long document classification using standard machine learning approaches. We benchmark approaches ranging from simple Naive Bayes to complex BERT on six standard text classification datasets.
  arXiv  Detail & Related papers  (2021-11-01T04:51:51Z)

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.