Automatic summarization of legal case documents is an important and practical challenge. Apart from many domain-independent text summarization algorithms that can be used for this purpose, several algorithms have been developed specifically for summarizing legal case documents. However, most of the existing algorithms do not systematically incorporate domain knowledge that specifies what information should ideally be present in a legal case document summary. To address this gap, we propose an unsupervised summarization algorithm DELSumm which is designed to systematically incorporate guidelines from legal experts into an optimization setup. We conduct detailed experiments over case documents from the Indian Supreme Court. The experiments show that our proposed unsupervised method outperforms several strong baselines in terms of ROUGE scores, including both general summarization algorithms and legal-specific ones. In fact, though our proposed algorithm is unsupervised, it outperforms several supervised summarization models that are trained over thousands of document-summary pairs.
翻译:法律案例文件的自动总结是一项重要而实际的挑战。除了可以用于此目的的许多独立域文本汇总算法外,还专门为总结法律案例文件制定了几种算法。然而,大多数现有的算法没有系统地纳入域知识,以具体说明哪些信息最好会出现在法律案例文件摘要中。为了弥补这一差距,我们提议了一种未经监督的汇总算法DELSumm,目的是系统地将法律专家的准则纳入一个优化设置。我们对印度最高法院的案例文件进行了详细的实验。实验表明,我们提议的未经监督的方法在ROUGE分数方面超越了几个强有力的基线,包括一般的汇总算法和法律专用的分数。事实上,尽管我们提议的算法不统一,但它优于数个经过监督的汇总模型,这些模型经过了超过数千个文件摘要配对的培训。