AU4002600A - Multi-document summarization system and method - Google Patents

Description

WO 00/49517 PCTIUSOO/04118 1 MULTI-DOCUMENT SUMMARIZATION SYSTEM AND METHOD SPECIFICATION Statement of Government Rights The United States Government may have certain rights to the 5 invention set forth herein pursuant to a grant by the National Science Foundation, Contract No. IRI-96-18797. Statement of Related Applications This application claims the benefit of United States provisional patent application, Serial No. 60/120,659, entitled "Information Fusion in the Context of 10 Multi-Document Summarization," which was filed on February 19, 1999. Field of the Invention The present invention relates generally to information summarization and more particularly relates to systems and methods for generating a summary for a set of multiple, related documents. 15 Background of the Invention The amount of information available today drastically exceeds that of any time in history. With the continuing expansion of the Internet, this trend will likely continue well into the future. Often, people conducting research of a topic are faced with information overload as the number of potentially relevant documents 20 exceeds the researchers ability to individually review each document. To address this problem, information summaries are often relied on by researchers to quickly evaluate a document to determine if it is truly relevant to the problem at hand. Given the vast collection of documents available, there is interest in developing and improving the systems and methods used to summarize information 25 content. For individual documents, domain-dependent template based systems and WO 00/49517 PCT/USOO/04118 2 domain-independent sentence extraction methods are known. Such known systems can provide a reasonable summary of a single document. However, these systems are not able to compare and contrast related documents in a document set to provide a summary of the collection. 5 The ability to summarize collections of documents containing related information is desirable to further expedite the research process. For example, for a researcher interested in news stories regarding a certain event, a summary of all documents from a given source, or multiple sources, would provide a valuable overview of the documents within the set. From such a summary, the researcher may 10 be able to extract the information desired, or at the very least, make an informed decision regarding the relevance of the set of documents. Therefore, there remains a need for systems and methods which can generate a summary of related documents in a document set. Summary of the Invention 15 It is an object of the present invention to provide a system and method for generating a summary of a set of multiple, related documents. It is a further object of the present invention to provide a system and method for generating a summary of a set of multiple, related documents which use paraphrasing rules to detect similarities in non-identical phrases in the documents. 20 A present method for generating a summary of related documents in a collection includes extracting phrases from the documents which have common focus elements. Phrase intersection analysis is performed on the extracted phrases to generate a phrase intersection table. Temporal processing can be performed on the phrases in the phrase intersection table to remove ambiguous temporal references and 25 to sort the phrases in a temporal sequence. Sentence generation is performed using the phrases in the phrase intersection table to generate the multidocument summary. Preferably, the phrase intersection analysis operation can include representing the phrases in tree structures having root nodes and children nodes; selecting those tree structures with verb root nodes; comparing the selected root nodes 30 to the other root nodes to identify identical nodes; applying paraphrasing rules to non- WO 00/49517 PCT/USOO/04118 3 identical root nodes to determine if non identical nodes are equivalent; and evaluating the children nodes of those tree structures where the parent nodes are identical or equivalent. The tree structure can take the form of a DSYNT tree structure. The paraphrasing rules can include one or more rules which are selected from the group 5 consisting of ordering of sentence components, main clause versus a relative clause, different syntactic categories, change in grammatical features, omission of an empty head, transformation of one part of speech to another, and semantically related words. In an embodiment of the present method, the temporal processing includes time stamping phrases based on a first occurrence of the phrase in the 10 collection; substituting date certain references for ambiguous temporal references; ordering the phrases based on the time stamp; and inserting a temporal marker if a temporal gap between phrases exceeds a threshold value. Preferably, a phrase divergence processing operation can also be performed to include phrases that signal changes in focus of the documents in the 15 collection. Sentence generation can includes mapping the phrases, represented in the tree structure, to an input format of a language generation engine and then operating the language generation engine. A present system for generating a summary of a collection of related 20 documents includes a storage device for storing the documents in the collection, a lexical database, such as WordNet, and a processing subsystem operatively coupled to the storage device and the lexical database. The processing subsystem is programmed to perform multiple document summarization including: accessing the documents in the storage device; using the lexical database to extract phrases from the documents 25 with similar focus elements; performing phrase intersection analysis on the extracted phrases to generate a phrase intersection table; performing temporal processing on the phrases in the phrase intersection table; and performing sentence generation using the phrases in the phrase intersection table. The methods described above can be encoded in the form of a 30 computer program stored in computer readable media, such as CD-ROM, magnetic storage and the like.

WO 00/49517 PCT/USOO/04118 4 Brief Description of the Drawing Further objects, features and advantages of the invention will become apparent from the following detailed description taken in conjunction with the accompanying figures showing illustrative embodiments of the invention, in which 5 Figure 1 is a flow chart illustrating the operation of the present multiple document summarization system; Figure 2 is a flow chart of a phrase intersection processing operation in accordance with the system operation of Figure 1; Figure 3 is a pictorial diagram of a DSYNT tree structure for an 10 exemplary sentence; Figure 4 is a flow chart of a temporal processing operation in accordance with the system operation of Figure 1; Figure 5 is a simplified block diagram of an embodiment of the present multiple document summarization system. 15 Throughout the figures, the same reference numerals and characters, unless otherwise stated, are used to denote like features, elements, components or portions of the illustrated embodiments. Moreover, while the subject invention will now be described in detail with reference to the figures, it is done so in connection with the illustrative embodiments. It is intended that changes and modifications can 20 be made to the described embodiments without departing from the true scope and spirit of the subject invention as defined by the appended claims. Detailed Description of Preferred Embodiments Figure 1 is a flow chart which provides an overview of the operation of the present multiple document summarization system. Initially, a set of documents, in 25 computer readable format and grouped by a common theme or domain, is presented to the summarization system. From the collection of documents, entities are identified and sentences are extracted from the documents which are relevant to the focus of the articles. Entities can be identified and extracted in a number of ways, such as by use of an information extraction engine. A suitable information extraction engine is 30 TALENT, which is available from International Business Machines, Inc. In step 100, WO 00/49517 PCT/USOO/04118 5 phrases are extracted from the documents which include terms that are present in at least two of the documents. In addition, divergent phrases, which may be indicative of contrasts in the documents, are also extracted from the document in step 110. Following extraction, phrase intersection processing (step 120) and phrase divergence 5 processing (step 130) are performed to evaluate and compare the extracted phrases and determine whether such phrases should be included in the resulting multiple document summary. Since phrases are extracted from multiple documents and can include temporal references which are ambiguous when taken out of context from the original document, temporal processing (step 140) is performed on the phrases 10 selected for the summary. Finally, sentence generation (step 150) is used to transform selected phrases into a coherent summary. Figure 2 is a flow chart which further illustrates steps that can be performed in connection with phrase intersection processing of step 120. The selected phrases are grammatically parsed and represented in a tree structure, such as a 15 DSYNT tree diagram, which is generally known in the art. An example of such a diagram is illustrated in Figure 3. The parse trees can be generated by a conventional grammatical parser, such as Collin's parser. The DSYNT tree structure is a way of representing the constituent dependencies resulting from a predicate-argument sentence structure. In the tree structure, each non-auxiliary word in the sentence has a 20 node which is connected to its direct dependents. Grammatical features of each word are also stored in the node. To facilitate subsequent comparisons, words in the nodes are kept in their canonical form. Returning to Figure 2, those trees which have root nodes which are verbs are selected and used as the basis for comparison. Each such verb based tree is 25 compared against the other trees derived from the sentences extracted from the documents in the collection (step 220). A comparison is made to determine if two nodes are identical (step 230). If two nodes are identical, those nodes are added to an output tree (step 235) and the nodes are evaluated to determine if there are further nodes descending from the root node (step 240). Such further nodes are referred to as 30 children nodes. If children nodes are present (step 245), the comparison in step 230 is repeated for each of child node. If the analysis of the children nodes is complete at WO 00/49517 PCT/USOO/04118 6 step 240, a determination is made as to whether the trees with common root nodes represent a phrase intersection (step 250). For example, if there is commonality in the root node and at least two children nodes of that root node, that phrase can be deemed complete and added to a phrase intersection table (step 255). If no phrase intersection 5 is detected at step 250, the next parent node is selected for processing (step 260) and control returns to step 230. Returning to step 230, if two nodes are not identical, it is still possible for the nodes to be equivalent. To make this determination, the present method employs a set of paraphrasing rules to evaluate the nodes (step 265). Paraphrasing, 10 which can be broadly defined as alternative ways a human speaker can choose to "say the same thing" by using linguistic knowledge, generally occurs at a "surface" level, e.g., it is achieved by using semantically related words and syntactic transformations. In the case of a set of related documents, theme sentences of the documents will generally be close semantically. This limits the scope of different 15 paraphrasing types to be evaluated. From an analysis of paraphrasing patterns evaluated through themes of a training corpus derived from TDT, the following non exhaustive set of paraphrasing categories have been found to occur with the greatest frequency: 1. ordering of sentence components: "Tuesday they met..." and "They met 20 ... Tuesday"; 2. main clause vs. a relative clause: "...a building was devastated by the bomb" and "...a building, devastated by the bomb"; 3. realization in different syntactic categories, e.g., classifier vs. apposition: "Palestinian leader Arafat" and "Arafat, Palestinian 25 leader", "Pentagon speaker" and "speaker from the Pentagon"; 4. change in grammatical features: active/passive, time, number. "...a building was devastated by the bomb" and "...the bomb devastated a building"; 5. omission of an empty head: "group of students" and "students"; 30 6. transformation from one part of speech to another: "building devastation" and "...building was devastated"; and WO 00/49517 PCT/USOO/04118 7 7. using semantically related words such as synonyms: "return" and "alight", "regime" and "government". The categories presented are used as paraphrasing rules by the present methods. The majority of these categories,such as ordering, can be fully implemented 5 in an automatic way, . However, some of the rules can be only approximated to a certain degree in an automated system. For example, identification of similarity based on semantic relations between words depends on the scope of coverage of the thesaurus employed. Word similarity can be established using relationships such as synonymy, hyponymy/hypernymy, and meronymy/holonymy which are detectable 10 using the WordNet language database which is described in the article "WordNet: A lexical Database for English", by G.A. Miller, Communications of the ACM, Vol. 38, No. 11. pp. 39-41, November 1995. If any of the included paraphrasing rules are satisfied for non-identical nodes, the nodes are deemed equivalent (step 270). Equivalent nodes are added to the 15 output tree (step 235) and processed in the same manner as identical nodes. If no paraphrasing rule is applicable to non-identical nodes, there is no phrase intersection with the current tree (step 280). In addition to phase intersection processing, which compares phrases for similarity, it is also desirable to perform phrase divergence processing (step 130), 20 which compares selected phrases for differences. Phrase divergence may indicate a critical change in the course of events through a set of related documents and would be worthy of inclusion in a summary. For example, a collection of articles regarding a plane crash could begin with a focus on the passengers as "survivors" and later refer to "casualties," "victims," "bodies" and the like, which signify a turning point in the 25 events described by the documents. WordNet can also be used in phrase divergence processing by evaluating focus relationships such antonymy (e.g., "happiness is opposite to sadness"). Once phrases are selected from the documents for the summary, temporal processing can be performed to sequence the phrases and eliminate 30 ambiguous temporal references. The flow chart of Figure 4 illustrates an overview of the temporal processing operations performed in the present methods. Using a rule WO 00/49517 PCT/USOO/04118 8 that an event is assumed to have occurred on the day that it is first reported, a time stamp can be applied to the selected phrases based on the earliest occurrence of the phrase in the collection of documents (step 405). In certain cases, phrases may include ambiguous temporal references, such as today, yesterday, etc. In this case, 5 such ambiguous references can be replaced by a date certain reference, such as by changing "Yesterday it was reported...." to "On 01/02/2000, it was reported...". Such substitutions, which are performed in step 410, can be implemented using the Emacs "calendar" package. The extracted phrases can then be ordered in accordance with the 10 assigned date stamp (step 415). In certain cases, a large temporal gap may exist between consecutive phrases. In such a case, if the gap exceeds a threshold, such as two days, a temporal marker can be inserted between the phrases to indicate this gap in time (step 420). This may be significant, for example, in the case of a collection of news articles where the gap in time can also correspond to a change in focus in the 15 articles. With the phrases selected and sorted in temporal order, sentence generation (step 150) can be performed to synthesize a coherent summary. Sentence generation involves two major operations. First, the DSYNT representation of the phrases to be used in sentence generation are mapped to the appropriate syntax of a 20 selected language generation engine. Then, the language generation engine is operated to arrange the phrases into coherent sentences. A suitable language generation engine is FUF/SURGE, which is available from Columbia University, New York , New York, as well as from Ben Gurion University, Department of Computer Science, Beer-Sheva, Israel. The acronym FUF stands for Functional Unification 25 Formalism interpreter and the acronym SURGE stands for syntactic realization grammar for text generation. The input specification for the FUF/SURGE engine includes a semantic role, circumstantial, which itself includes a temporal feature. The inclusion of the semantic attributes enables FUF/SURGE to perform various paraphrasing operations to the input phrases to improve the resulting sentences. 30 Figure 5 is a simplified block diagram of a multiple document summarization system in accordance with the present invention. The system 500 WO 00/49517 PCTUSOO/04118 9 includes a processor section 505 wherein the processing operations set forth in Figure 1 are performed. The system also includes non-volatile storage coupled to the processor section 505 for document storage 510, collection summary storage 515, lexical database storage 518 and program storage 520. Generally these storage 5 systems are read/write data storage systems, such as magnetic media and read/write optical storage media. However, the document collection storage may take the form of read-only storage, such as a CD-ROM storage device. The system further includes RAM memory 525 coupled to the processor section for temporary storage during operation. The system 500 will generally include one or more input device 530 such 10 as a keyboard, digitizer, mouse and the like, which is coupled to the processor section 505. Similarly, a conventional display device 535 is generally provided which is also operatively coupled to the processor section. The particular hardware embodiment is not critical to the practice of the present invention. Various computer platforms and architectures can be used to 15 implement the system 500, such as personal computers, workstations, networked computers, and the like. The functions described in the system can be performed locally or in a distributed manner, such as over a local area network or the Internet. For example, the document collection storage 510 may be at a remote archive location which is accessed by the processor section 505 via a connection to the Internet. 20 Although the present invention has been described in connection with specific exemplary embodiments, it should be understood that various changes, substitutions and alterations can be made to the disclosed embodiments without departing from the spirit and scope of the invention as set forth in the appended claims.

Claims (22)

1. A method for generating a summary of a plurality of related documents in a collection comprising: extracting phrases having focus elements from the plurality of 5 documents; performing phrase intersection analysis on the extracted phrases to generate a phrase intersection table; performing temporal processing on the phrases in the phrase intersection table; and 10 performing sentence generation using the phrases in the phrase intersection table.

2. The method of generating a summary as defined by claim 1, wherein the phrase intersection analysis comprises: representing the phrases in tree structures having root nodes and 15 children nodes; selecting those tree structures with verb root nodes; comparing the selected root nodes to the other root nodes to identify identical nodes; applying paraphrasing rules to non-identical root nodes to determine if 20 non identical nodes are equivalent; and evaluating the children nodes of those tree structures where the parent nodes are identical or equivalent.

3. The method of claim 2, wherein the tree structure is a DSYNT tree structure. 25

4. The method of claim 2, wherein the paraphrasing rules are selected from the group consisting of ordering of sentence components, main clause versus a relative clause, different syntactic categories, change in grammatical features, omission of an WO 00/49517 PCT/US0O/04118 11 empty head, transformation of one part of speech to another, and semantically related words.

5. The method of claim 1, wherein the temporal processing includes: time stamping phrases based on a first occurrence of the phrase in the 5 collection; substituting date certain references for ambiguous temporal references; ordering the phrases based on the time stamp; and inserting a temporal marker if a temporal gap between phrases exceeds a threshold value. 10

6. The method of claim 1, further comprising a phrase divergence processing operation.

7. The method of claim 1, wherein the sentence generation includes mapping phrases to an input format of a language generation engine and operating the language generation engine. 15

8. A system for generating a summary of a plurality of related documents in a collection comprising: a storage device for storing the documents in the collection; a lexical database; and a processing subsystem, the processing subsystem being operatively 20 coupled to the storage device and the lexical database, the processing subsystem being programmed to access the documents in the storage device and: using the lexical database to extract phrases having focus elements from the plurality of documents; performing phrase intersection analysis on the extracted phrases to 25 generate a phrase intersection table; performing temporal processing on the phrases in the phrase intersection table; and WO 00/49517 PCT/USOO/04118 12 performing sentence generation using the phrases in the phrase intersection table.

9. The system for generating a summary as defined by claim 9, wherein the phrase intersection analysis processing further comprises: 5 representing the phrases as data structures having root nodes and children nodes; selecting those data structures with verb root nodes; comparing the selected root nodes to the other root nodes to identify identical nodes; 10 applying paraphrasing rules to non-identical root nodes to determine if non identical nodes are equivalent; and evaluating the children nodes of those tree structures where the parent nodes are identical or equivalent. 15

10. The system of claim 9, wherein the data structure is a DSYNT tree structure.

11. The system of claim 9, wherein the paraphrasing rules are selected from the group consisting of ordering of sentence components, main clause versus a relative clause, different syntactic categories, change in grammatical features, omission of an empty head, transformation of one part of speech to another, and semantically related 20 words.

12. The system of claim 8, wherein the temporal processing includes: time stamping phrases based on a first occurrence of the phrase in the collection; substituting date certain references for ambiguous temporal references; 25 ordering the phrases based on the time stamp; and inserting a temporal marker if a temporal gap between phrases exceeds a threshold value. WO 00/49517 PCT/USOO/04118 13

13. The system of claim 8, further comprising a phrase divergence processing operation.

14. The system of claim 8, wherein the processing subsystem includes a language generation engine and wherein sentence generation includes mapping phrases to an 5 input format of the language generation engine and then operating the language generation engine.

15. The system of claim 8, wherein the storage device for storing the documents in the collection is remotely located from the processing subsystem.

16. A computer readable media for programming a computer system to perform a 10 method of generating a summary of a plurality of related documents in a collection comprising: extracting phrases having focus elements from the plurality of documents; performing phrase intersection analysis on the extracted phrases to 15 generate a phrase intersection table; performing temporal processing on the phrases in the phrase intersection table; and performing sentence generation using the phrases in the phrase intersection table. 20

17. The computer readable media of claim 16, wherein the phrase intersection analysis comprises: representing the phrases in tree structures having root nodes and children nodes; selecting those tree structures with verb root nodes; 25 comparing the selected root nodes to the other root nodes to identify identical nodes; applying paraphrasing rules to non-identical root nodes to determine if non identical nodes are equivalent; and WO 00/49517 PCT/USO0/04118 14 evaluating the children nodes of those tree structures where the parent nodes are identical or equivalent.

18. The computer readable media of claim 17, wherein the tree structure is a 5 DSYNT tree structure.

19. The computer readable media of claim 17, wherein the paraphrasing rules are selected from the group consisting of ordering of sentence components, main clause versus a relative clause, different syntactic categories, change in grammatical features, omission of an empty head, transformation of one part of speech to another, and 10 semantically related words.

20. The computer readable media of claim 16, wherein the temporal processing includes: time stamping phrases based on a first occurrence of the phrase in the collection; 15 substituting date certain references for ambiguous temporal references; ordering the phrases based on the time stamp; and inserting a temporal marker if a temporal gap between phrases exceeds a threshold value.

21. The computer readable media of claim 16, further comprising a phrase 20 divergence processing operation.

22. The computer readable media of claim 16, wherein the sentence generation includes mapping phrases to an input format of a language generation engine and operating the language generation engine.