SM-BERT-CR:一种具有支持模型的判例法检索深度学习方法

IF 3.1 2区 社会学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yen Thi-Hai Vuong, Quan Minh Bui, Ha-Thanh Nguyen, Thi-Thu-Trang Nguyen, Vu Tran, Xuan-Hieu Phan, Ken Satoh, Le-Minh Nguyen
{"title":"SM-BERT-CR:一种具有支持模型的判例法检索深度学习方法","authors":"Yen Thi-Hai Vuong,&nbsp;Quan Minh Bui,&nbsp;Ha-Thanh Nguyen,&nbsp;Thi-Thu-Trang Nguyen,&nbsp;Vu Tran,&nbsp;Xuan-Hieu Phan,&nbsp;Ken Satoh,&nbsp;Le-Minh Nguyen","doi":"10.1007/s10506-022-09319-6","DOIUrl":null,"url":null,"abstract":"<div><p>Case law retrieval is the task of locating truly relevant legal cases given an input query case. Unlike information retrieval for general texts, this task is more complex with two phases (<i>legal case retrieval</i> and <i>legal case entailment</i>) and much harder due to a number of reasons. First, both the query and candidate cases are long documents consisting of several paragraphs. This makes it difficult to model with representation learning that usually has restriction on input length. Second, the concept of <i>relevancy</i> in this domain is defined based on the legal relation that goes beyond the lexical or topical relevance. This is a real challenge because normal text matching will not work. Third, building a large and accurate legal case dataset requires a lot of effort and expertise. This is obviously an obstacle to creating enough data for training deep retrieval models. In this paper, we propose a novel approach called <i>supporting model</i> that can deal with both phases. The underlying idea is the case–case supporting relation and the paragraph–paragraph as well as the decision-paragraph matching strategy. In addition, we propose a method to automatically create a large weak-labeling dataset to overcome the lack of data. The experiments showed that our solution has achieved the state-of-the-art results for both case retrieval and case entailment phases.</p></div>","PeriodicalId":51336,"journal":{"name":"Artificial Intelligence and Law","volume":"31 3","pages":"601 - 628"},"PeriodicalIF":3.1000,"publicationDate":"2022-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"SM-BERT-CR: a deep learning approach for case law retrieval with supporting model\",\"authors\":\"Yen Thi-Hai Vuong,&nbsp;Quan Minh Bui,&nbsp;Ha-Thanh Nguyen,&nbsp;Thi-Thu-Trang Nguyen,&nbsp;Vu Tran,&nbsp;Xuan-Hieu Phan,&nbsp;Ken Satoh,&nbsp;Le-Minh Nguyen\",\"doi\":\"10.1007/s10506-022-09319-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Case law retrieval is the task of locating truly relevant legal cases given an input query case. Unlike information retrieval for general texts, this task is more complex with two phases (<i>legal case retrieval</i> and <i>legal case entailment</i>) and much harder due to a number of reasons. First, both the query and candidate cases are long documents consisting of several paragraphs. This makes it difficult to model with representation learning that usually has restriction on input length. Second, the concept of <i>relevancy</i> in this domain is defined based on the legal relation that goes beyond the lexical or topical relevance. This is a real challenge because normal text matching will not work. Third, building a large and accurate legal case dataset requires a lot of effort and expertise. This is obviously an obstacle to creating enough data for training deep retrieval models. In this paper, we propose a novel approach called <i>supporting model</i> that can deal with both phases. The underlying idea is the case–case supporting relation and the paragraph–paragraph as well as the decision-paragraph matching strategy. In addition, we propose a method to automatically create a large weak-labeling dataset to overcome the lack of data. The experiments showed that our solution has achieved the state-of-the-art results for both case retrieval and case entailment phases.</p></div>\",\"PeriodicalId\":51336,\"journal\":{\"name\":\"Artificial Intelligence and Law\",\"volume\":\"31 3\",\"pages\":\"601 - 628\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2022-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence and Law\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10506-022-09319-6\",\"RegionNum\":2,\"RegionCategory\":\"社会学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence and Law","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10506-022-09319-6","RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 11

摘要

判例法检索是在给定输入查询案例的情况下定位真正相关的法律案例的任务。与一般文本的信息检索不同,这项任务更复杂,有两个阶段(法律案件检索和法律案件隐含),由于多种原因,难度更大。首先,查询和候选案例都是由几个段落组成的长文档。这使得使用通常对输入长度有限制的表示学习进行建模变得困难。其次,该领域的关联性概念是基于超越词汇或主题关联的法律关系来定义的。这是一个真正的挑战,因为普通的文本匹配不起作用。第三,建立一个庞大而准确的法律案件数据集需要大量的精力和专业知识。这显然是创建足够数据用于训练深度检索模型的障碍。在本文中,我们提出了一种新的方法,称为支持模型,可以处理这两个阶段。其基本思想是案例-案例支持关系、段落-段落以及决策段落匹配策略。此外,我们提出了一种自动创建大型弱标记数据集的方法,以克服数据不足的问题。实验表明,我们的解决方案在案例检索和案例隐含阶段都取得了最先进的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

SM-BERT-CR: a deep learning approach for case law retrieval with supporting model

SM-BERT-CR: a deep learning approach for case law retrieval with supporting model

Case law retrieval is the task of locating truly relevant legal cases given an input query case. Unlike information retrieval for general texts, this task is more complex with two phases (legal case retrieval and legal case entailment) and much harder due to a number of reasons. First, both the query and candidate cases are long documents consisting of several paragraphs. This makes it difficult to model with representation learning that usually has restriction on input length. Second, the concept of relevancy in this domain is defined based on the legal relation that goes beyond the lexical or topical relevance. This is a real challenge because normal text matching will not work. Third, building a large and accurate legal case dataset requires a lot of effort and expertise. This is obviously an obstacle to creating enough data for training deep retrieval models. In this paper, we propose a novel approach called supporting model that can deal with both phases. The underlying idea is the case–case supporting relation and the paragraph–paragraph as well as the decision-paragraph matching strategy. In addition, we propose a method to automatically create a large weak-labeling dataset to overcome the lack of data. The experiments showed that our solution has achieved the state-of-the-art results for both case retrieval and case entailment phases.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
9.50
自引率
26.80%
发文量
33
期刊介绍: Artificial Intelligence and Law is an international forum for the dissemination of original interdisciplinary research in the following areas: Theoretical or empirical studies in artificial intelligence (AI), cognitive psychology, jurisprudence, linguistics, or philosophy which address the development of formal or computational models of legal knowledge, reasoning, and decision making. In-depth studies of innovative artificial intelligence systems that are being used in the legal domain. Studies which address the legal, ethical and social implications of the field of Artificial Intelligence and Law. Topics of interest include, but are not limited to, the following: Computational models of legal reasoning and decision making; judgmental reasoning, adversarial reasoning, case-based reasoning, deontic reasoning, and normative reasoning. Formal representation of legal knowledge: deontic notions, normative modalities, rights, factors, values, rules. Jurisprudential theories of legal reasoning. Specialized logics for law. Psychological and linguistic studies concerning legal reasoning. Legal expert systems; statutory systems, legal practice systems, predictive systems, and normative systems. AI and law support for legislative drafting, judicial decision-making, and public administration. Intelligent processing of legal documents; conceptual retrieval of cases and statutes, automatic text understanding, intelligent document assembly systems, hypertext, and semantic markup of legal documents. Intelligent processing of legal information on the World Wide Web, legal ontologies, automated intelligent legal agents, electronic legal institutions, computational models of legal texts. Ramifications for AI and Law in e-Commerce, automatic contracting and negotiation, digital rights management, and automated dispute resolution. Ramifications for AI and Law in e-governance, e-government, e-Democracy, and knowledge-based systems supporting public services, public dialogue and mediation. Intelligent computer-assisted instructional systems in law or ethics. Evaluation and auditing techniques for legal AI systems. Systemic problems in the construction and delivery of legal AI systems. Impact of AI on the law and legal institutions. Ethical issues concerning legal AI systems. In addition to original research contributions, the Journal will include a Book Review section, a series of Technology Reports describing existing and emerging products, applications and technologies, and a Research Notes section of occasional essays posing interesting and timely research challenges for the field of Artificial Intelligence and Law. Financial support for the Journal of Artificial Intelligence and Law is provided by the University of Pittsburgh School of Law.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信