Özet:
Information overload is one of the greatest challenges in recent years, especially due to the rapid increase of data produced on the Internet. Automatic summarization of documents about similar topics is a salient solution to overcome this problem. There are mainly two approaches for this task, extractive multi-document summarization where the summary is created by selecting salient sentences from documents, and abstractive multi-document summarization where new sentences are generated using natural language generation methods. Sentence similarity calculation is signi cant in most of the extractive multi-document summarization approaches. In this study we introduce the usage of dependency grammars to compute sentence similarity for extractive multi-document summarization. We adapt and investigate the e ects of two untyped dependency tree based sentence similarity kernels, which have originally been proposed for relation extraction, to the multi-document summarization problem. In addition, we propose a series of new dependency grammar based kernels to better represent the syntactic and semantic similarities among the sentences. The proposed methods incorporate type information of dependency relations for sentence similarity calculation. Our best method achieves signi cantly better scores than the untyped dependency tree based kernels. We observe that using the dependency grammar representations of sentences leads to better results in nding the similarities between sentences and the type of dependency relations is crucial in identifying the important parts in sentences.
