The Unreasonable Effectiveness of the Baseline: Discussing SVMs in Legal Text Classification
We aim to highlight an interesting trend to contribute to the ongoing debate around advances within legal Natural Language Processing. Recently, the focus for most legal text classification tasks has shifted towards large pre-trained deep learning models such as BERT. In this paper, we show that a more traditional approach based on Support Vector Machine classifiers reaches surprisingly competitive performance with BERT-based models on the classification tasks in the LexGLUE benchmark. We also highlight that error reduction obtained by using specialised BERT-based models over baselines is noticeably smaller in the legal domain when compared to general language tasks. We present and discuss three hypotheses as potential explanations for these results to support future discussions.
Code (0)
등록된 구현이 없습니다.
Tasks
Natural Language Understandingtext-classificationText ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
LLM Agents in Law: Taxonomy, Applications, and Challenges
Large language models (LLMs) have precipitated a dramatic improvement in the legal domain, yet the deployment of standalone models faces significant limitations regarding hallucination, outdated information, and verifiab…
The Unreasonable Effectiveness of Word Representations for Twitter Named Entity Recognition
Empirical Evaluations of Preprocessing Parameters' Impact on Predictive Coding's Effectiveness
Predictive coding, once used in only a small fraction of legal and business matters, is now widely deployed to quickly cull through increasingly vast amounts of data and reduce the need for costly and inefficient human d…
Early Prediction of Course Grades: Models and Feature Selection
In this paper, we compare predictive models for students' final performance in a blended course using a set of generic features collected from the first six weeks of class. These features were extracted from students' on…
feature selectionregression$p$SVM: Soft-margin SVMs with $p$-norm Hinge Loss
Support Vector Machines (SVMs) based on hinge loss have been extensively discussed and applied to various binary classification tasks. These SVMs achieve a balance between margin maximization and the minimization of slac…
Binary ClassificationMulti-class Classification