MétaCan
Menu
Back to cohort
Record W4409402469 · doi:10.47852/bonviewjcce52024104

Legal Text Analytics for Reasonable Notice Period Prediction

2025· article· en· W4409402469 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

VenueJournal of Computational and Cognitive Engineering · 2025
Typearticle
Languageen
FieldSocial Sciences
TopicArtificial Intelligence in Law
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of CanadaQueen's UniversityCanadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
KeywordsNoticePeriod (music)AnalyticsComputer scienceData sciencePolitical scienceLawPhilosophy

Abstract

fetched live from OpenAlex

Applications of deep learning (DL) to generate text embeddings and natural language processing (NLP) have shown wide success in semantic interpretations of domain-specific text data when applied to downstream tasks such as predicting the next word, information extraction for classification, analyzing social media feeds, classifying text, and creating compressed representations. While DL and NLP have been widely applied across numerous domains, researchers have recently begun to apply these techniques to the field of law due to the challenges in processing legal case descriptions. Attention-based models have shown promising results in predicting criminal charges using unstructured text as an input, but little work has been done on data representing the Canadian legal system, especially employment law. The legal field poses many challenges, such as the amount of legal data publicly available in Canada, the verbosity of judgments, the legal jargon used in judgments, and the subjectivity of outcomes that pose many challenges in processing legal text data. Many of the state-of-the-art systems require expensive hand-annotated labels that are often unobtainable. In this study, we investigate the prediction of reasonable notice for termination of employment in the field of law. To address these challenges, we propose domain-adapted BERT variations specifically trained for legal texts. We assess the performance of various attention-based and pre-trained models using human-typed summaries of legal judgment and present a detailed analysis of the data and the results to provide insights for further exploration in this area. Our approaches also provide interesting insights about this specific type of legal case focusing on employment law, given the subjective nature of judges and the variability in outcomes. Received: 15 August 2024 | Revised: 28 February 2025 | Accepted: 10 March 2025 Conflicts of Interest The authors declare that they have no conflicts of interest to this work. Data Availability Statement The data that support the findings of this study are openly available at https://static.case.law/. Author Contribution Statement Jason Lam: Conceptualization, Methodology, Software, Validation, Formal analysis, Investigation, Resources, Data curation, Writing – original draft, Writing – review & editing, Visualization. Yuhao Chen: Writing – review & editing, Visualization. Farhana Zulkernine: Conceptualization, Resources, Data curation, Writing – review & editing, Visualization, Supervision, Project administration, Funding acquisition. Samuel Dahan: Validation, Data curation, Writing – review & editing, Supervision, Project administration, Funding acquisition.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.889
Threshold uncertainty score0.212

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.017
GPT teacher head0.309
Teacher spread0.292 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it