Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

LegaLMFiT: Efficient Short Legal Text Classification with LSTM Language Model Pre-Training (2109.00993v3)

Published 2 Sep 2021 in cs.CL

Abstract: Large Transformer-based LLMs such as BERT have led to broad performance improvements on many NLP tasks. Domain-specific variants of these models have demonstrated excellent performance on a variety of specialised tasks. In legal NLP, BERT-based models have led to new state-of-the-art results on multiple tasks. The exploration of these models has demonstrated the importance of capturing the specificity of the legal language and its vocabulary. However, such approaches suffer from high computational costs, leading to a higher ecological impact and lower accessibility. Our findings, focusing on English language legal text, show that lightweight LSTM-based LLMs are able to capture enough information from a small legal text pretraining corpus and achieve excellent performance on short legal text classification tasks. This is achieved with a significantly reduced computational overhead compared to BERT-based models. However, our method also shows degraded performance on a more complex task, multi-label classification of longer documents, highlighting the limitations of this lightweight approach.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Benjamin ClaviƩ (12 papers)
  2. Akshita Gheewala (1 paper)
  3. Paul Briton (1 paper)
  4. Marc Alphonsus (2 papers)
  5. Rym Laabiyad (1 paper)
  6. Francesco Piccoli (5 papers)
Citations (2)