Measuring Similarity among Legal Court Case Documents

Compute Pub Date : 2017-11-16 DOI:10.1145/3140107.3140119
A. Mandal, Raktim Chaki, S. Saha, Kripabandhu Ghosh, Arindam Pal, Saptarshi Ghosh
{"title":"Measuring Similarity among Legal Court Case Documents","authors":"A. Mandal, Raktim Chaki, S. Saha, Kripabandhu Ghosh, Arindam Pal, Saptarshi Ghosh","doi":"10.1145/3140107.3140119","DOIUrl":null,"url":null,"abstract":"Computing the similarity between two legal documents is an important challenge in the Legal Information Retrieval domain. Efficient calculation of this similarity has useful applications in various tasks such as identifying relevant prior cases for a given case document. Prior works have proposed network-based and text-based methods for measuring similarity between legal documents. However, there are certain limitations in the prior methods. Network-based measures are not always meaningfully applicable since legal citation networks are usually very sparse. On the other hand, only primitive text-based similarity measures, such as TF-IDF based approaches, have been tried till date. In this work, we focus on improving text-based methodologies for computing the similarity between two legal documents. In addition to TF-IDF based measures, we use advanced similarity measures (such as topic modeling) and neural network models (such as word embeddings and document embeddings). We perform extensive experiments on a large dataset of Indian Supreme Court cases, and compare among various methodologies for measuring the textual similarity of legal documents. Our experiments show that embedding based approaches perform better than other approaches. We also demonstrate that the proposed embedding-based methodologies significantly outperforms a baseline hybrid methodology involving both network-based and text-based similarity.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Compute","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3140107.3140119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

Abstract

Computing the similarity between two legal documents is an important challenge in the Legal Information Retrieval domain. Efficient calculation of this similarity has useful applications in various tasks such as identifying relevant prior cases for a given case document. Prior works have proposed network-based and text-based methods for measuring similarity between legal documents. However, there are certain limitations in the prior methods. Network-based measures are not always meaningfully applicable since legal citation networks are usually very sparse. On the other hand, only primitive text-based similarity measures, such as TF-IDF based approaches, have been tried till date. In this work, we focus on improving text-based methodologies for computing the similarity between two legal documents. In addition to TF-IDF based measures, we use advanced similarity measures (such as topic modeling) and neural network models (such as word embeddings and document embeddings). We perform extensive experiments on a large dataset of Indian Supreme Court cases, and compare among various methodologies for measuring the textual similarity of legal documents. Our experiments show that embedding based approaches perform better than other approaches. We also demonstrate that the proposed embedding-based methodologies significantly outperforms a baseline hybrid methodology involving both network-based and text-based similarity.
法院案件文书相似性的测度
计算两份法律文件之间的相似度是法律信息检索领域的一个重要挑战。这种相似性的有效计算在各种任务中都有有用的应用,例如为给定的案例文档识别相关的先前案例。先前的工作已经提出了基于网络和基于文本的方法来测量法律文件之间的相似性。但是,现有的方法存在一定的局限性。基于网络的测量并不总是有意义的适用,因为法律引用网络通常非常稀疏。另一方面,迄今为止只尝试了基于原始文本的相似性度量,例如基于TF-IDF的方法。在这项工作中,我们专注于改进基于文本的方法来计算两个法律文件之间的相似性。除了基于TF-IDF的度量之外,我们还使用了高级相似性度量(如主题建模)和神经网络模型(如词嵌入和文档嵌入)。我们在印度最高法院案件的大型数据集上进行了广泛的实验,并比较了用于测量法律文件文本相似性的各种方法。我们的实验表明,基于嵌入的方法比其他方法性能更好。我们还证明了所提出的基于嵌入的方法显著优于基于网络和基于文本的相似度的基线混合方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书