Log In Sign Up

An Efficient Approach to Learning Chinese Judgment Document Similarity Based on Knowledge Summarization

by   Yinglong Ma, et al.

A previous similar case in common law systems can be used as a reference with respect to the current case such that identical situations can be treated similarly in every case. However, current approaches for judgment document similarity computation failed to capture the core semantics of judgment documents and therefore suffer from lower accuracy and higher computation complexity. In this paper, a knowledge block summarization based machine learning approach is proposed to compute the semantic similarity of Chinese judgment documents. By utilizing domain ontologies for judgment documents, the core semantics of Chinese judgment documents is summarized based on knowledge blocks. Then the WMD algorithm is used to calculate the similarity between knowledge blocks. At last, the related experiments were made to illustrate that our approach is very effective and efficient in achieving higher accuracy and faster computation speed in comparison with the traditional approaches.


page 1

page 2

page 3

page 4


Content-based Text Categorization using Wikitology

A major computational burden, while performing document clustering, is t...

Document Clustering based on Topic Maps

Importance of document clustering is now widely acknowledged by research...

Incorporating Domain Knowledge for Extractive Summarization of Legal Case Documents

Automatic summarization of legal case documents is an important and prac...

Privacy-Preserving Multi-Document Summarization

State-of-the-art extractive multi-document summarization systems are usu...

Improving the Similarity Measure of Determinantal Point Processes for Extractive Multi-Document Summarization

The most important obstacles facing multi-document summarization include...

FastKASSIM: A Fast Tree Kernel-Based Syntactic Similarity Metric

Syntax is a fundamental component of language, yet few metrics have been...

An Efficient Shared-memory Parallel Sinkhorn-Knopp Algorithm to Compute the Word Mover's Distance

The Word Mover's Distance (WMD) is a metric that measures the semantic d...