The Unpredictable Nature of Termination Notice: A Data Science Experiment
Bibliographic record
Abstract
Rapid advances in data analysis techniques, particularly predictive algorithms, have opened radically new perspectives for legal practice and access to justice. Several firms in North America, Asia and Europe have set out to use machine-learning techniques to create automated legal predictions, raising concerns regarding ethics, reliability and limits on prediction accuracy, and potential impact on case law development. To explore these opportunities and challenges, we consider in depth one of the most litigated issues in Canada: wrongful termination disputes, more specifically the question of reasonable notice calculation. Beyond the thorough analysis of this question, this paper is also intended as a road map for non-technicians, and especially lawyers, on the application of Artificial Intelligence (AI) methods, illustrating both its potential benefits and its limitations in other areas of dispute resolution. To achieve these results, we created a large data set by annotating all historic cases related to wrongful employment termination. This data set has proven useful to assess the predictability of reasonable notice, that is, the accuracy and precision of AI predictions. In particular, it helped to identify the degree of inconsistency and fluctuation in notice period cases, incidentally exposing the limitations of legal predictions. We then developed predictive algorithms to estimate notice periods given details of the employment period, and investigated their accuracy and performance. Moreover, we thoroughly analyzed these algorithms to better understand the judicial process, and in particular to quantify the weight and influence of case-specific features in the determination of reasonable notice. Finally, we closely analyzed cases that were poorly predicted by the AI algorithms in order to better understand the judicial decision process and identify inconsistencies, a strategy that will ultimately yield a deeper practical understanding of case law. This project will open the door to the development of a larger- scale access-to-justice project, and will provide users with an open-access platform for notice calculation. In particular, the tool will help self-represented litigants to appreciate possible outcomes of litigation – in this case, reasonable notice – that is, the Best Alternative to a Negotiated Agreement (BATNA).
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.023 | 0.078 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".