<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1"/><title>Multi-Topic Multi-Document Summarization</title><author surname="Hasida" givenname="Koiti"><org  name="Communications Research Laboratory" country="Japan" city="Kyoto"/></author><author surname="Utiyama" givenname="Masao"><org  name="Communications Research Laboratory" country="Japan" city="Kyoto"/></author></firstpageheader><frontmatter><p>Multi-Topic Multi-Document Summarization</p><p>UTIYAMA Masao</p><p>Communications Research Laboratory 588-2, <b>Iwaoka, </b>Nishi-ku, Kobe, <b>Hyogo </b>651-2492, Japan <b>mutiy ama@crl</b>. go. j p</p><p>HASIDA Kôiti</p><p><b>Electrotechnical </b>Labor 1-1-4, Umezono, Tukuba Ibaraki 305-8568, Japan hasida@etl.go.jp</p></frontmatter><abstract>Summarization of multiple documents featur­ing multiple topics is discussed. The exam­ple treated here consists of fifty articles about the Peru hostage incident for December 1996 through April 1997. They include a <b>lot </b>of top­ics such as opening, negotiation, ending, and so on. The method proposed <b>in </b>this paper is based on spreading activation over documents syntactically and semantically annotated <b>with </b>GDA (Global Document Annotation) tags. The method extracts important documents and im­portant parts therein, and creates a network consisting of important entities and relations among them. <b>It </b>also identifies cross-document coreferences to replace expressions with more concrete ones. The method is essentially multi­lingual due to the language-independence of the GDA tagset. This tagset can provide a stan­dard format for the study on the transformation and/or generation stage of summarization pro­cess, among other natural language processing tasks. </abstract></header><body><section number="1" title="Introduction"><p>A large event consists of a number of smaller events. These component events are usually related but such relations may <b>not </b>be strong enough to define larger topics. For example, a war may consist of opening, battles, negotia­tions, and so on. These relatively independent events are considered to be topics by themselves and would accordingly be reported in multiple news articles.</p><p>Summarization of such a large event, or mul­tiple documents about multiple topics, is the concern of this paper. Summarization of multi­ple documents containing multiple topics is an unexplored research issue. Some previous stud­ies on summarization (McKeown and Radev, 1995; Barzilay et al., 1999; <b>Mani </b>and Bloedorn, 1999) deal with multiple documents about a sin­gle topic, but not about multiple topics<footnote anchor="1"/>.</p><p>In order to summarize multiple documents with multiple topics, one needs a general, semantics-oriented method for evaluating im­portance. Summarization of a single document may largely exploit the document structure. As an extreme example, the first paragraph of a newspaper article often serves as a summary of the entire article. On the other hand, summa­rization of multiple documents in general must be more based on their semantic structures, be­cause there is no overall consistent document structure across them.</p><p>Selection of multiple important topics (not keywords) for multiple-topic summarization has not yet been really addressed in the previ­ous literature. The present paper proposes a method, based on spreading activation, for ex­tracting important topics and important docu­ments. Another method proposed which is use­ful for grasping the overview of multiple docu­ments is visualization of important entities men­tioned and relationships among them. Visu­alization of relationships among keywords has been studied in the context of information re­trieval (Niwa et al., 1997; Sanderson and Croft, 1999), but to the authors' knowledge the present study is the first to address such visualization in the context of summarization. Of course a con­cise summary of the entire set of multiple docu­ments can be obtained by recovering sentences from important entities and their relationships as demonstrated in section 3.3.</p><p>The present study assumes documents anno­tated with GDA (Global Document Annota<b>tion) </b>tags (Hasida, 1997; Nagao and Hasida, 1998).<page local="2"/> Since <b>the </b>GDA tagset is designed to be independent of any particular natural language, the proposed method is essentially multilingual. Another merit of using annotated documents is <b>that </b>we can separate the analysis phase from the whole process of summarization so that we can focus on the latter, generation phase of sum­marization process. Annotated documents can also be useful for a common input format for the study of summarization, among other nat­ural language processing tasks.</p><footnote label="1">Maybury (1999) discusses summarization of multiple topics, but in his study the summaries are made from an event database but not from documents.</footnote></section><section number="2" title="The GDA Tagset"><p>GDA is a project to make on-line documents machine-understandable on the basis of a lin­guistic tagset, while developing and spread­ing technologies of content-based presentation, retrieval, question-answering, summarization, translation, among others, with much higher quality than before. GDA thus proposes an integrated global platform for electronic con­tent authoring, presentation, and reuse. The GDA tagset<footnote anchor="2"/> is an XML (extensible Markup Language) instance which allows machines to automatically infer the semantic and pragmatic structures underlying the raw documents.</p><p>Under the current state of the art, GDA-tagging is semiautomatic and calls for manual correction by human annotators; otherwise an­notation would make no sense. The cost in­volved here pays, because annotated documents are generic information contents from which to render diverse types of presentations, poten­tially involving summarization, narration, visu­alization, translation, information retrieval, in­formation extraction, and so forth. The present paper concerns summarization only, but the merit of GDA-tagging is not at all restricted to summarization, and that is why it is considered reasonable to assume GDA-tagged input here.</p><subsection number="2.1" title="Syntactic structure"><p>An example of a GDA-tagged sentence is shown in Figure 1. <b>&lt;su&gt; </b>means sentential unit. <b>&lt;np&gt;, &lt;v&gt;, </b>and <b>&lt;adp&gt; </b>stand for noun phrase, verb, and adnominal or adverbial phrase.</p><p><b>&lt;su&gt; </b>and the tags whose name end with <b>'p!</b>(such as <b>&lt;adp&gt; </b>and <b>&lt;vp&gt;) </b>are called <i>phrasal tags.   </i>In a sentence, an element (a text span from a begin tag to the corresponding end tag) is usually a syntactic constituent. The elements enclosed in phrasal tags are called <i>phrasal ele­ments, </i>which cannot be the head of larger ele­ments. So in Figure 1 'flies' is specified to be the head of the <b>&lt;su&gt; </b>element and 'like' the head of the <b>&lt;adp&gt; </b>element.</p><footnote label="2">http://www.etl.go.jp/etl/nl/GDA/tagset.html</footnote><doubt alpha="50.0" length="4" tooSmall="False" monospace="0.0">&lt;su&gt;</doubt><doubt alpha="59.5" length="37" tooSmall="False" monospace="0.0">&lt;np&gt;Time&lt;/np&gt; &lt;v&gt;flies&lt;/v&gt; &lt;adp&gt; like</doubt><doubt alpha="58.3" length="24" tooSmall="False" monospace="0.0">&lt;np&gt;an arrow&lt;/np&gt; &lt;/adp&gt;</doubt><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">&lt;/su&gt;</doubt><figure caption="Figure 1: A GDA-tagged sentence."></figure></subsection><subsection number="2.2" title="Coreferences and Anaphora"><p>Each element may have an identifier as the value for the <b>id </b>attribute. Coreferences, including identity anaphora, are annotated by the <b>eq </b>at­tribute, as follows:</p><p><b>&lt;np id="jO"&gt;John&lt;/np&gt; beats &lt;adp eq="jO"&gt;his&lt;/adp&gt; dog.</b></p><p>When the shared semantic content is not the referent but the type (kind, set, etc.) of the referents, the <b>eq.ab </b>attribute is used like the following:</p><p><b>You bought a &lt;np id="cl"&gt;car&lt;/np&gt;. I bought &lt;np eq.ab="cl"&gt;one&lt;/np&gt;, too.</b></p><p>A zero anaphora is encoded as follows:</p><p><b>Tom visited &lt;np id="ml"&gt;Mary&lt;/np&gt;. He had &lt;v iob="ml"&gt;brought&lt;/v&gt; a present.</b></p><p><b>iob="ml" </b>means that the indirect object of <i>brought </i>is element whose <b>id </b>value is <b>ml, </b>that is, <i>Mary.</i></p><p>Other relations, such as <b>sub </b>and <b>sup, </b>can also be encoded, <b>sub </b>represents subset, part, or ele­ment. An example follows:</p><p><b>She has &lt;np id="bl"&gt;many books&lt;/np&gt;.</b></p><doubt alpha="64.0" length="25" tooSmall="False" monospace="0.0">&lt;namep sub="bl"&gt;''Alice's</doubt><page local="3"/><p><b>Adventures in Wonderland''&lt;/namep&gt; is her favorite.</b></p><p><b>sup </b>is <b>the </b>inverse of <b>sub, </b>i.e., <b>includer </b>of any sort, which is superset as to subset, whole as to part, or set as to element.</p><p>Syntactic structures and coreferences are es­sential for the summarization method described in section 3. Further details such as semantics, coordination, scoping, <b>illocutionary </b>act, and so on, are omitted here.</p></subsection></section><section number="3" title="Multi-Document Summarization"><subsection number="3.1" title="Spreading activation"><p>A set of GDA-tagged documents is regarded as a network in which nodes roughly correspond to GDA elements and links represent the syntac­tic and semantic relations among them. This network is the tree of GDA elements plus cross-reference (via <b>eq, eq.ab, sub, sup, </b>and so on) links among them. Cross-reference links may encompass different documents. Figure 2 shows a schematic, graphical representation of the net­work.</p><figure caption="Figure 2: Multi-document network."></figure><p>Spreading activation is carried out in this network to assess the importance of the ele­ments. Spreading activation has been applied to summarization of single GDA-tagged docu­ments (Hasida et al., 1987; Nagao and Hasida, 1998). The main conjecture of the present study is that the merit of spreading activation in that it evaluates importances of semantic entities is greater in summarization of multiple docu­ments with multiple topics, because summariza­tion techniques using document structures do not apply here, as mentioned earlier.</p><p>To fit the semantic interpretation, activations spread under the condition that coreferent ele­ments should have the same activation value.</p><p>The algorithm is shown in Figure 3. Here the external input <i>c(i) </i>to node <i>i </i>represents <i>a pri­ori </i>importance of <i>i,</i><i> </i>which is set on an empir­ical basis; for instance, an entity <footnote anchor="4"/> referred to in the title of an article tend to be important, and thus <i>c(i)</i><i> </i>should be relatively large for the corresponding node <i>i.</i><i> </i>The weight <i>w(i,j)</i><i> </i>of an­other kind of link from node <i>i </i>to node <i>j </i>may also be set empirically, but it is fixed to a uni­form value in the present work. Let <i>E(i)</i><i> </i>be the equivalence class of node <i>i,</i><i> </i>that is the set of nodes which are coreferent with <i>i </i>(linked with <i>i </i>via <b>eq </b>relationships). Condition should be satisfied in order for the spreading ac­tivation to converge. This condition is satisfied if we treat each equivalence class of nodes as a virtual node while setting the weights of other types of links to be , where <i>D </i>is the maximum degree of equivalence classes:</p><doubt alpha="50.0" length="10" tooSmall="False" monospace="0.0">E Ew&amp;,j)&lt;i</doubt><doubt alpha="50.0" length="12" tooSmall="False" monospace="0.0">k€E(i)j$E(i)</doubt><doubt alpha="51.6" length="31" tooSmall="False" monospace="0.0">D =maxE    Eôk:i%k(EE(i) j$E{i)</doubt><p>where <i>5kj</i><i> </i>is 1 if there is a link between node <i>k</i><i> </i>and node <i>j,</i><i> </i>otherwise it is 0.</p><p>The score <i>score(i) </i>of node <i>i </i>is calculated by summing the activation values of all the nodes under node <i>i </i>in the syntactic tree structure:</p><doubt alpha="51.7" length="29" tooSmall="False" monospace="0.0">score(i) =a(i)+  Escore(j)(1)</doubt><doubt alpha="57.1" length="7" tooSmall="False" monospace="0.0">j€ch(i)</doubt><p>where <i>a(i)</i><i> </i>is the activation value of node <i>i</i><i> </i>and <i>ch(i)</i><i> </i>is the set of child nodes of node <i>i. </i><i>ch(i)</i><i> </i>is empty if node <i>i </i>is a leaf node, or a word. This score is regarded as the importance of node <i>i.</i></p></subsection><subsection number="3.2" title="Extraction of important documents and sentences"><p>Extraction of important documents is simple once the scores of the nodes in the network are obtained. Sorting the document nodes accord­ing to their scores and extracting higher-ranked ones is sufficient for the purpose.</p><footnote label="3">Another spreading activation algorithm is discussed by Mani and Bloedorn (1999). The comparison is a fu­ture work.</footnote><footnote label="4">We use the terms 'entity', 'node', and 'element' in­terchangeably.</footnote><page local="4"/><p>Variables: N: number of nodes.</p><p><b>D:</b><b> </b>maximum <b>out-degree </b>of equivalence classes.</p><p><b>c(i): </b>external input to node <b>i.</b></p><p><b>w</b><b>(i, j ) </b>: weight of the link from node <b>i </b>to node <b>j :</b></p></subsection></section><section number="0" title="if not connected,"><p>1 if connected via <b>eq, </b>1/D otherwise.</p><p><b>a(i): </b>activation value of node <b>i. </b>The initial value is 0. <b>a(i) </b>is the sum of all <i>a(j,i).</i></p><p><b>a(i,j): </b>activation value of the link from node <b>i </b>to node <b>j. </b>The initial value is 0.</p><p>Algorithm:</p><p><b>repeat {</b></p><doubt alpha="40.4" length="47" tooSmall="False" monospace="0.0">for(i=0;i&lt;N;i++){ av = c (i) ; for(j=0;j&lt;N;j++K</doubt><doubt alpha="36.4" length="44" tooSmall="False" monospace="0.0">a(j,i) = w(j,i)*(a(j) - a(i,j)) av += a(j,i)</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">&gt;</doubt><p><b>a(i) = av; </b><b>}■</b><b> until convergence.</b></p><figure caption="Figure 3: Spreading activation algorithm."></figure><p>Similar procedure is used to extract impor­tant sentences from an important document. Extracted sentences are pruned according to their syntactic structures. Anaphoric expres­sions such as <i>he </i>or <i>she </i>are substituted by their antecedents if <b>necessary.</b></p><p>An experiment has been conducted to <b>test the </b>effectiveness of the proposed algorithm. The ex­ample set contains fifty Japanese articles about the Peru hostage incident which continued over four months from December 1996 to April 1997. They include a <b>lot </b>of topics such as opening, negotiation, settlement, and so on. The GDA-<b>tagging </b>of these articles has involved automatic morphological analysis by <b>.11 </b><b>MAX</b><b> </b>(Kurohashi and Nagao, 1998), automatic syntactic analysis by KNP (Kurohashi, 1998), and manual anno­tation encompassing <b>morphology, </b>syntax, coref-<b>erence, </b>and anaphora. The types of anaphora identified here are mainly plain <b>coreference </b>and zero anaphora. Cross-document coreferences among entities have been automatically identified by exact string matching. d They contained errors but those errors were <b>not </b>corrected for the experiment. Cross-document coreferences found were 'Peru'(49), <b>'Japan'(39), </b>'Peru Pres­ident' <b>(15), </b>'members of Tupac <b>Amaru'(9), ... </b>and so <b>on, </b>where the numbers indicate the num­bers of documents which contain these expres­sions.</p><p>The external inputs to nodes have been de­fined according to the corresponding nodes: <i>c(i)</i><i> </i><i>=</i><i> </i>10 if node <b>i's </b>antecedent dominates sen­tences (e.g., a node <b>coreferring </b>with a para­graph). This sets a preference for nodes which summarize preceding sentences. <i>c(i)</i><i> </i><i>=</i><i> </i><b>5 </b>if node <i>i </i>is <b>in </b>the <b>title </b>of an article, because a <b>title </b>is usually important. Otherwise <i>c(i)</i><i> </i><i>=</i><i> </i><b>1. </b>These crude parameter values have been set by the au­thors on the basis of the investigation of <b>sum-</b>marizations of various documents.</p><p>Two important topics, the opening (first at­tack by Tupac Amaru) and the settlement (at­tack by the Peruvian government comman­dos), have been extracted from the four highest ranked articles, even though temporal informa­tion has <b>not </b>been incorporated <b>in </b>the algorithm. The opening article is the first article of the sample document set. However, the settlement article is the sixth last one. So mere extraction of the last article would miss the settlement.</p><p>The <b>25% </b>summaries of the two articles made by extracting and pruning sentences are shown below together with their English translations:</p><doubt alpha="27.8" length="18" tooSmall="False" monospace="0.0">MW,200 À#A®--^;i/-</doubt><p>Armed guerrillas broke into a party at Japanese ambassador's residence. Gunshots. 200 held in hostage. — Peru.</p><p>Many people from Japanese and Peruvian sides were held in hostage. The armed group consists of about twenty people, several of which broke into the ambassador's residence. It is reported that there are intermittent shootings now.</p><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">and</doubt><p>°We are planning to incorporate recent results (Bagga and Baldwin, 1998) to identify cross-document corefer­ences.</p><page local="5"/><doubt alpha="55.0" length="20" tooSmall="False" monospace="0.0">**Ä»@ttfflv&gt; —vU AM«</doubt><p><b>y </b>At«±ÄS$f«cAo <b>fe„ ÄfiJISraii, </b>ff «O KM W <b>&amp; tft </b>o <b>T V &gt; Ô 3 i: &amp; fe.</b></p><p>Japanese ambassador's residence possession incident in Peru. All hostages released. Aim at recovering his power basis — President Fu­jimori.</p><p>President Fujimori demonstrated himself as a strong politician by resolving the Japanese ambassador's residence possession incident. He entered the residence site. This visit to the residence impressed that he was leading the operation himself. Why did he choose to resort to ? We can say that he aimed at recovering his political leadership by re­solving through military power the residence incident, which is at the root of the political crisis.</p><subsection number="3.3" title="Entity-relation graph"><p>The score <i>score(i.j) </i>of a relation between two entities <i>i</i><i> </i>and <i>j.</i><i> </i>is defined by:</p><p><i>score(i.j)</i> where <i>S(E(i))</i><i> </i>is the set of sentence nodes which dominate one of the nodes in <i>E{i)</i><i> </i>and <i>\E{i)\</i><i> </i>is the number of nodes <b>in </b><i>E(i).</i><i></i><i> </i><i>E(i).</i><i> </i><i>a(i).</i><i> </i>and <i>score(s) </i>have been defined <b>in </b>Section <b>3.1. </b><i>\E(i)\a(i)</i><i> </i>is an <b>analogy </b>of <i>ltf</i><i> </i>x <i>idf \ </i>which is a measure of term importance widely used <b>in </b>information retrieval.</p><doubt alpha="36.4" length="22" tooSmall="False" monospace="0.0">=\E(i)\a(i)+\E(j)\a(j)</doubt><doubt alpha="50.0" length="14" tooSmall="False" monospace="0.0">+ Escore(s)(2)</doubt><doubt alpha="44.4" length="18" tooSmall="False" monospace="0.0">s€S(E(i))r\S(E(j))</doubt><p>If <i>score(i.j) </i>is sufficiently large, then <i>S(E(i))</i><i> </i>n <i>S(E(j))</i><i> </i>(the sentences containing both the entities) can constitute a cross-document <b>summary </b>concerning <i>i </i>and j<footnote anchor="6"/>.</p><p>An entity-relation graph (E-R graph) is made of the relations highly ranked in terms of the score defined in (2). Figure 4 shows the E-R graph made of the top eleven relations extracted from the articles about Peru hostage incident. The numbers near the lines represent the ranks of the relations.</p><p>Peru hostage incident</p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">jimaI \</doubt><doubt alpha="45.5" length="11" tooSmall="False" monospace="0.0">\3/ Japan \</doubt><p>Peruvian government</p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">/</doubt><p>anese ambassador's residence</p><p>observers Fujimori Tupac Amaru</p><figure caption="Figure 4: E-R graph of Peru hostage incident."></figure><p>The top-ranked relation was the one be­tween <i>Peru </i>and <i>Japanese ambassador's resi­dence. </i>Three sentences extracted from the eight sentences which contained both of the entities were as follows.<footnote anchor="7"/> They were listed in chrono­logical order which was identified by the date information in the articles.</p><doubt alpha="57.1" length="35" tooSmall="False" monospace="0.0">teftatffi7h,t&amp;efu91 » b ti&amp;mm? &amp;-y"</doubt><p>According to reports from Peru, <b>on the 17th </b>the Japanese ambassador's residence in Lima, the capi­tal, was attacked by <b>an armed groups, allegedly leftist guerrillas, </b>and many people from both Japanese and Peruvian sides were held in hostage.</p><p>2.</p><p><i>mx-mmit </i><i>m</i><i> </i>h,</p><doubt alpha="66.7" length="3" tooSmall="False" monospace="0.0">WW;</doubt><p>Concerning <b>the hostage incident at the Japanese ambassador's residence caused by armed guerrilla, on the 18th </b>the government requested the Peruvian government to assure the safety of the hostages, and sent Mr. HORIUTI Takahiko, coordinator, Division of Middle and South America. • • •</p><doubt alpha="42.4" length="33" tooSmall="False" monospace="0.0">3. 22H,^;i/-0H*Att^SW0g§Aff«£lM/3</doubt><p>President Fujimori's political authority will recover because he succeeded in the operation to break into the Japanese ambassador's residence in Peru <b>on the 22nd.</b></p><p>These sentences, extracted from different ar­ticles, have been paraphrased on <b>the </b>basis of</p><p>r'Coreference chains are used to summarize single doc­uments by Azzam et al. (1999).</p><p>rThese sentences were selected manually to demon­strate the possibility of cross document summarization based on coreference.</p><doubt alpha="33.3" length="3" tooSmall="False" monospace="0.0">//X</doubt><doubt alpha="66.7" length="6" tooSmall="False" monospace="0.0">Peru -</doubt><page local="6"/><p>coreferences. Since <b>the </b>name of <b>the </b>guerilla group is <b>not </b>identified <b>in </b>the beginning of the incident, <b>the </b>expression <b>U </b><b>!7 £ &lt;fr   </b><b>tl </b>&lt;5</p><p><i>H&amp;ktf )\&gt;</i><i>—~J</i><i>"*</i><i> </i>(armed group which seems to be leftist guerrillas) is used in the first sentence there. This expression has been replaced with <b>^ ( h </b><b>9 • </b><i>7~?)iy</i><i> </i>(leftist guerrillas (Tupac Amaru)) by using cross-document coref­erences. The equivalence of the first sentence and the first noun phrase of the second sentence, iSAS^ft' (the hostage incident caused by armed guerrillas at the Japanese ambassador's residence in Peru), were properly detected and was replaced by another expression because the equivalence of events across possibly different documents <b>(McKeown </b>et al., 1999; Barzilay et al., 1999) has been also detected by comparing predicate-argument structures of relevant sen­tences. Date expressions such as '17 0' (the 17th) have been augmented like '1996 ^ 12 <i>M </i>17 0' (Dec. 17, 1996). The resulting passages are below (underlines indicating paraphrases), together with their English translations (bold­face indicating paraphrases):</p><doubt alpha="57.1" length="63" tooSmall="False" monospace="0.0">1. ^}V-frç, cd«îtïcJ:ô£,W»Uvrft!ctbSB *att Äsfr1996Jgi.12ft17B,</doubt><p><i><u>&amp;n&gt;fv</u></i><b><u>7(h•</u></b><b><u> </u></b><u>7v</u><u>;i/)</u> <b>icgsan,</b><b> </b>a <i>a\</i><i> </i><i>Kjv </i>- cd<i>mmmtm^Miï </i>ahic <i>t^tih.</i></p><p>According to news from Peru, <b>on December 17, 1996 </b>the Japanese ambassador's residence in Lima, the capital, was attacked by <b>leftist guerrillas (Tupac Amaru), </b>and many people from both Japanese and Peruvian sides were held <b>in </b>hostage.</p><p>2. <u>^cDAfi*fr</u> t'tts <u>i2 </u><i><u>ft</u></i><i><u> </u></i><u>is </u><u>a</u>, <i>«K</i><i>-ï&amp;mzM</i></p><p>Concerning <b>the hostage incident, </b>the govern­ment requested the Peruvian government to assure the hostages' safety <b>on December the 18th, </b>and sent Mr. HORIUTI Takahiko, coordinator, Divi­sion of Middle and South America, Ministry of In­ternational Affairs, to Peru on that night.</p><doubt alpha="43.2" length="37" tooSmall="False" monospace="0.0">3.19975U Jf 22 B, ^-®B*AttÂSV\cd^Af|ï</doubt><p><i>imxßmmz mfro</i><i>^t</i><i>\z</i><i>&amp;&amp;t</i><i>£ôo„</i></p><p>President Fujimori's political authority will recover because he succeeded in the operation to break into the Japanese ambassador's residence in Peru <b>on April 22, 1997.</b></p></subsection></section><section number="4" title="Discussion"><subsection number="4.1" title="Evaluation"><p>Evaluation of multi-document summarization calls for far greater cost than that of single-document summarization. Testbeds for evalua­tion of multi-document summarization have not been developed yet. So the present evaluation is limited to the sample set of articles mentioned above, but the obtained results suggest general applicability of the proposed method and sup­ports the conjecture that spreading activation is effective for multi-document multi-topic sum­marization.</p><p>As discussed in the previous section, the pro­posed method can extract important articles, that <b>is, </b>the opening and settlement articles, from fifty articles about Peru hostage incident. Also, an E-R, graph consisting of important rela­tions among important entities, <i>Peru, Japanese ambassadors' residence, Tupac Amaru, </i>and so <b>on, </b>has been successfully constructed on this basis. The above-mentioned method also uses cross-document coreferences for replacing ex­pressions with more concrete ones.</p><p>All these are archived essentially by using in­formation in the GDA-tagging only, but not domain-dependent knowledge such as embed­ded in templates for information extraction. The proposed method is hence expected to de­tect important documents and sentences and create an appropriate E-R graph when applied to another set of documents about multiple top­ics.</p></subsection><subsection number="4.2" title="Transformation"><p>The process of summarization can be decom­posed into three stages <b>(Sparck </b>Jones, 1999):</p></subsection></section><section number="1." title="source text interpretation to source text representation,"><p>2. source representation <i>transformation </i>to summary text representation, and</p><p>3. summary text <i>generation </i>from summary representation.</p><p>GDA-tagged documents are regarded as source text representations. The method described above focuses on the transformation stage. Its <b>multi-linguality </b>comes from the <b>multi-linguality </b>of the stage.</p><page local="7"/></section><section number="5" title="Conclusion"><p>Summarization of multiple documents about multiple topics has been discussed in this pa­per. The method proposed here uses spread­ing activation over documents syntactically and <b>semantically </b>annotated with GDA tags. It is capable of:</p><p>• extraction of the opening and settlement articles from fifty articles about a hostage incident,</p><p>• creation of an entity-relation graph of im­portant relations among important entities,</p><p>• extraction and pruning of important sen­tences, and</p><p>• substitution of expressions with more con­crete ones using cross-document corefer­ences.</p><p>The method is essentially multilingual because it is based on GDA tags and the GDA tagset is designed to address multilingual coverage. Since this tagset can embed various linguistic information into documents, it could be a stan­dard format for the study of the transformation and/or generation stage of document summa­rization, among other natural language process­ing tasks.</p></section><references><p>Saliha Azzam, Kevin Humphreys, and <b>Robert </b>Gaizauskas. 1999. Using <b>coreference </b>chains for text summarization. In <i>ACL'99 Work­shop on Coreference and Its Applications, </i>pages 77......84.</p><p><b>Amit </b>Bagga and <b>Breck </b>Baldwin. 1998. Entity-based cross-document <b>coreferencing </b>using the vector space model. In <i>COLING-ACL'98, </i>pages 79 85.</p><p>Regina Barzilay, Kathleen <b>R. </b>McKeown, and Michael Elhadad. 1999. Information fusion in the context of multi-document summariza­tion. In <i>ACL'99, </i>pages 550 557.</p><p><b>Kôiti </b>Hasida, Syun Ishizaki, and Hitoshi <b>Isa-hara. </b>1987. A connectionist approach to the generation of abstracts. In Gerard Kempen, editor. <i>Natural Langauge Generation: New Results in Artificial Intelligence, Psychology, and Linguistics, </i>pages 149 156. <b>Martinus </b>Ni-jhoff.</p><p>Kôiti Hasida. 1997. Global Document Annota­tion. In <i>NLPRS'97, </i>pages 505 508.</p><p>Sadao Kurohashi and <b>Makoto </b>Nagao. 1998. Japanese morphological analysis system <b>JU­KI AN </b>manual.</p><p>Sadao Kurohashi. 1998. Japanese syntactic analysis system KNP manual.</p><p><b>Inderjeet Mani </b>and Eric <b>Bloedorn. </b>1999. Sum­marizing similarities and differences among related documents. In Inderjeet Mani and Mark T. Maybury, editors, <i>ADVANCES IN AUTOMATIC TEXT SUMMARIZATION </i>chapter 23, pages 357 379. The MIT Press.</p><p>Mark T. Maybury. 1999. Generating sum­maries from event data. In Inderjeet Mani and Mark T. Maybury, editors, <i>ADVANCES IN AUTOMATIC TEXT SUMMARIZA­TION </i>chapter 17, pages 265 281. The MIT Press.</p><p>Kathleen McKeown and <b>Dragomir </b>R. Radev. 1995. Generating summaries of multiple news articles. In <i>SIGIR'95, </i>pages 74 82.</p><p>Kathleen R. McKeown, Judith L. Klavans, Vasileios Hatzivassiloglou, Regina Barzilay, and Elezar Eskin. 1999. Towards multi-document summarization by reformulation: Progress and prospects. In <i>AAAI-99, </i>pages 453460.</p><p>Katashi Nagao and Kôiti Hasida. 1998. Au­tomatic Text Summarization Based on the Global Document Annotation. In <i>COLING-ACL'98, </i>pages 917 921.</p><p>Yoshiki Niwa, Shingo Nishioka, Makoto <b>Iwayama, </b>Akihiko Takano, and Yosihiko Nitta. 1997. Topic graph generation for query naviagation: Use of frequency classes for topic extraction. In <i>NLPRS'97, </i>pages 95100.</p><p>Mark Sanderson and Bruce Croft. 1999. De­riving concept hierarchies from text. In <i>SI-GIR'99, </i>pages 206 213.</p><p>Karen <b>Sparck </b>Jones. 1999. Automatic summa­rizing: factors and directions. In Inderjeet Mani and Mark T. Maybury, editors, <i>AD­VANCES IN A UTOMATIC TEXT SUMMA­RIZATION </i>chapter 1, pages 1 12. The MIT Press.</p></references></body></article>