Detection of Similar Legal Cases on Personal Injury
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The Canadian case system is based on the principle of stare decisis and the concept that like cases should be decided alike. Each judge, when deciding a matter before him or her, selects the prior cases on which to rely. Recently researchers have begun exploring the use of legal text data to find similar cases to assist lawyers with legal research as well as to assist self-represented litigants with legal aid tools. Due to differences in writing style, verbosity, variation in feature importance, case complexity, and subjective bias in judgements, the analysis of legal text using computational models offers interesting challenges for computer scientists. In this study, we explore the problem of finding similar personal injury cases in which plaintiffs claimed compensation specifically for neck and/or back injuries. We extracted and pre-processed unlabeled legal text data and developed deep-learning models across three stages to gradually improve model performance. At each stage, the subset of results was evaluated and validated by a team of lawyers based on qualitative criteria, with the feedback used to refine the model at the next stage. The results demonstrate that semantic similarity between two cases does not ensure that they are legally similar, and artificial intelligence and deep learning techniques for analyzing legal text data can help detect legally similar cases.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.008 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it