BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:diego_ma

The blue social bookmark and publication sharing system.

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Multi-document Summarization by Graph Search and Matching

by: Inderjeet Mani, and Eric Bloedorn

In: CoRR, Vol. cmp-lg/9712004 (1997) .

Resources (URL, PDF, PS...)

URL:	http://dblp.uni-trier.de/db/journals/corr/corr9712.html#cmp-lg-9712004

We describe a new method for summarizing similarities and differences in a pair of related documents using a graph representation for text. Concepts denoted by words, phrases, and proper names in the document are represented positionally as nodes in the graph along with edges corresponding to semantic relations between items. Given a perspective in terms of which the pair of documents is to be summarized, the algorithm first uses a spreading activation technique to discover, in each document, nodes semantically related to the topic. The activated graphs of each document are then matched to yield a graph corresponding to similarities and differences between the pair, which is rendered in natural language. An evaluation of these techniques has been carried out.

BibTeX record

@article{Mani:1997,
  abstract = {We describe a new method for summarizing similarities and differences in a pair of related documents using a graph representation for text. Concepts denoted by words, phrases, and proper names in the document are represented positionally as nodes in the graph along with edges corresponding to semantic relations between items. Given a perspective in terms of which the pair of documents is to be summarized, the algorithm first uses a spreading activation technique to discover, in each document, nodes semantically related to the topic. The activated graphs of each document are then matched to yield a graph corresponding to similarities and differences between the pair, which is rendered in natural language. An evaluation of these techniques has been carried out.},
  added-at = {2008-02-26T06:39:48.000+0100},
  author = {Mani, Inderjeet and Bloedorn, Eric},
  biburl = {http://www.bibsonomy.org/bibtex/287535fc865377ad1ff4d3274c10de5eb/diego_ma},
  date = {2008-01-02},
  ee = {http://arxiv.org/abs/cmp-lg/9712004},
  interhash = {bdcca006bcc7bd1cc169f926adbe43db},
  intrahash = {87535fc865377ad1ff4d3274c10de5eb},
  journal = {CoRR},
  keywords = {graphs summarisation},
  library = {Web (Feb 2008)},
  note = {informal publication},
  timestamp = {2008-02-26T06:39:48.000+0100},
  title = {Multi-document Summarization by Graph Search and Matching},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr9712.html#cmp-lg-9712004},
  volume = {cmp-lg/9712004},
  year = 1997
}

Endnote record

%0 Journal Article
%1 Mani:1997
%A Mani, Inderjeet
%A Bloedorn, Eric
%D 1997
%J CoRR
%K 
%T Multi-document Summarization by Graph Search and Matching
%U http://dblp.uni-trier.de/db/journals/corr/corr9712.html#cmp-lg-9712004
%V cmp-lg/9712004
%X We describe a new method for summarizing similarities and differences in a pair of related documents using a graph representation for text. Concepts denoted by words, phrases, and proper names in the document are represented positionally as nodes in the graph along with edges corresponding to semantic relations between items. Given a perspective in terms of which the pair of documents is to be summarized, the algorithm first uses a spreading activation technique to discover, in each document, nodes semantically related to the topic. The activated graphs of each document are then matched to yield a graph corresponding to similarities and differences between the pair, which is rendered in natural language. An evaluation of these techniques has been carried out.

BibSonomy :: publication ::

Multi-document Summarization by Graph Search and Matching

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record