Explainable Legal Case Matching via Inverse Optimal Transport-based Rationale Extraction
Authors:
Open Access
- 6 July 2022
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 657-668
Abstract
As an essential operation of legal retrieval, legal case matching plays a central role in intelligent legal systems. This task has a high demand on the explainability of matching results because of its critical impacts on downstream applications --- the matched legal cases may provide supportive evidence for the judgments of target cases and thus influence the fairness and justice of legal decisions. Focusing on this challenging task, we propose a novel and explainable method, namely IOT-Match, with the help of computational optimal transport, which formulates the legal case matching problem as an inverse optimal transport (IOT) problem. Different from most existing methods, which merely focus on the sentence-level semantic similarity between legal cases, our IOT-Match learns to extract rationales from paired legal cases based on both semantics and legal characteristics of their sentences. The extracted rationales are further applied to generate faithful explanations and conduct matching. Moreover, the proposed IOT-Match is robust to the alignment label insufficiency issue commonly in practical legal case matching tasks, which is suitable for both supervised and semi-supervised learning paradigms. To demonstrate the superiority of our IOT-Match method and construct a benchmark of explainable legal case matching task, we not only extend the well-known Challenge of AI in Law (CAIL) dataset but also build a new Explainable Legal cAse Matching (ELAM) dataset, which contains lots of legal cases with detailed and explainable annotations. Experiments on these two datasets show that our IOT-Match outperforms state-of-the-art methods consistently on matching prediction, rationale extraction, and explanation generation.Keywords
All Related Versions
Funding Information
- Beijing Outstanding Young Scientist Program (BJJWZYJH012019100020098)
- Mainland-Hong Kong Joint Funding Scheme (MHKJFS) (MHP/001/19)
- Intelligent Social Governance Interdisciplinary Platform, Major Innovation \& Planning Interdisciplinary Platform for the ``Double-First Class' Initiative, Renmin University of China
- National Key Research and Development Program of China (2019YFE0198200)
- National Natural Science Foundation of China (61872338, 61832017)
- Public Policy and Decision-making Research Lab of Renmin University of China
This publication has 22 references indexed in Scilit:
- Hierarchical clustering with optimal transportStatistics & Probability Letters, 2020
- Iteratively Questioning and Answering for Interpretable Legal Judgment PredictionProceedings of the AAAI Conference on Artificial Intelligence, 2020
- Computational Optimal Transport with Applications to Data SciencesFoundations and Trends in Machine Learning, 2019
- Gromov-Wasserstein Alignment of Word Embedding Spaces2018
- Interpretable Charge Predictions for Criminal Cases: Learning to Generate Court Views from Fact Descriptions2018
- A Decomposable Attention Model for Natural Language Inference2016
- Finding Relevant Indian Judgments using Dispersion of Citation Network2015
- A history of AI and Law in 50 papers: 25 years of the international conference on AI and LawArtificial Intelligence and Law, 2012
- Similarity analysis of legal judgments2011
- Improving legal information retrieval using an ontological frameworkArtificial Intelligence and Law, 2009