Legal Information Retrieval and Entailment Using Transformer-based Approaches
Open Access
- 11 January 2024
- journal article
- research article
- Published by Springer Nature in The Review of Socionetwork Strategies
- Vol. 18 (1) , 101-121
Abstract
The challenge of information overload in the legal domain increases every day. The COLIEE competition has created four challenge tasks that are intended to encourage the development of systems and methods to alleviate some of that pressure: a case law retrieval (Task 1) and entailment (Task 2), and a statute law retrieval (Task 3) and entailment (Task 4). Here we describe our methods for Task 1 and Task 4. In Task 1, we used a sentence-transformer model to create a numeric representation for each case paragraph. We then created a histogram of the similarities between a query case and a candidate case. The histogram is used to build a binary classifier that decides whether a candidate case should be noticed or not. In Task 4, our approach relies on fine-tuning a pre-trained DeBERTa large language model (LLM) trained on SNLI and MultiNLI datasets. Our method for Task 4 was ranked third among eight participating teams in the COLIEE 2023 competition. For Task 4, We also compared the performance of the DeBERTa model with those of a knowledge distillation model and ensemble methods including Random Forest and Voting.Keywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada (DGECR-2022-00369 and RGPIN-2022-03469)
- Natural Sciences and Engineering Research Council of Canada
- Alberta Machine Intelligence Institute
- Alberta Innovates
This publication has 19 references indexed in Scilit:
- Evaluating BERT for natural language inference: A case study on the CommitmentBank2019
- Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks2019
- EQUATE: A Benchmark Evaluation Framework for Quantitative Reasoning in Natural Language Inference2019
- Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark2019
- Multiway Attention Networks for Modeling Sentence Pairs2018
- A Broad-Coverage Challenge Corpus for Sentence Understanding through Inference2018
- Bilateral Multi-Perspective Matching for Natural Language Sentences2017
- An Improved Non-monotonic Transition System for Dependency Parsing2015
- A large annotated corpus for learning natural language inference2015
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001