Automatically recommending relevant law articles to a given legal case has attracted much attention as it can greatly release human labor from searching over the large database of laws. However, current researches only support coarse-grained recommendation where all relevant articles are predicted as a whole without explaining which specific fact each article is relevant with. Since one case can be formed of many supporting facts, traversing over them to verify the correctness of recommendation results can be time-consuming. We believe that learning fine-grained correspondence between each single fact and law articles is crucial for an accurate and trustworthy AI system. With this motivation, we perform a pioneering study and create a corpus with manually annotated fact-article correspondences. We treat the learning as a text matching task and propose a multi-level matching network to address it. To help the model better digest the content of law articles, we parse articles in form of premise-conclusion pairs with random forest. Experiments show that the parsed form yielded better performance and the resulting model surpassed other popular text matching baselines. Furthermore, we compare with previous researches and find that establishing the fine-grained fact-article correspondences can improve the recommendation accuracy by a large margin. Our best system reaches an F1 score of 96.3%, making it of great potential for practical use. It can also significantly boost the downstream task of legal decision prediction, increasing the F1 score by up to 12.7%.
翻译:自动向特定法律案例推荐相关的法律条款引起了人们的极大关注,因为这可以极大地释放人类劳动力,让他们在大型法律数据库中搜索大量法律数据库。然而,目前的研究只支持粗略的建议,即所有相关条款的预测是整体的,而没有解释每一条款与哪个具体事实相关。由于一个案件可以由许多支持事实组成,因此,用它们来核查建议结果的正确性可能耗费时间。我们认为,每个事实和法律条款之间细微的对应对于准确和可靠的AI系统至关重要。我们利用这一动机,进行了一项开创性的研究,并创建了一套手动的附加事实文章。我们把学习当作一个文本匹配任务,并提出一个多层次匹配网络来解决这个问题。为了帮助模型更好地消化法律条款的内容,我们用假设式的对立对立面来分析文章,我们用随机森林来分析它们是否正确。 实验表明,这种对立面形式产生更好的表现,所产生的模型比其他受欢迎的文本匹配基线。此外,我们比较了以前的研究,发现建立精准的、附有注释的、附有注释的、附有注释的对应的文本。我们把学习当作一个多层次的匹配的F1,我们能够大大地进行推算。