Abstract:
Text summarizers using relevance measurement technologies and latent semantic analysis techniques provide accurate and useful summarization of the contents of text documents. Generic text summaries may be produced by ranking and extracting sentences from original documents; broad coverage of document content and decreased redundancy may simultaneously be achieved by constructing summaries from sentences that are highly ranked and different from each other. In one embodiment, conventional Information Retrieval (IR) technologies may be applied in a unique way to perform the summarization; relevance measurement, sentence selection, and term elimination may be repeated in successive iterations. In another embodiment, a singular value decomposition technique may be applied to a terms-by-sentences matrix such that all the sentences from the document may be projected into the singular vector space; a text summarizer may then select sentences having the largest index values with the most important singular vectors as part of the text summary.

Description:
[0001]    This application claims the benefit of U.S. Provisional Application No. 60/254,535, filed Dec. 12, 2000, entitled “Text Summarization Using IR Technique And Singular Value Decomposition,” the disclosure of which is hereby incorporated by reference. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    The present invention is related generally to summarization of document contents, and more particularly to a system and method of summarizing the content of text documents through implementation of relevance measurement technologies and latent semantic analysis techniques.  
           [0004]    2. Description of the Related Art  
           [0005]    The explosive growth of the World-Wide Web has dramatically increased the speed and the scale of information dissemination. With a vast sea of accessible text documents now available on the Internet, conventional Information Retrieval (IR) technologies have become more and more insufficient to find relevant information effectively. Recently, it has become quite common that a keyword-based search on the Internet returns hundreds (or even thousands) of hits, by which the user is often overwhelmed. There is an increasing need for new technologies which assist users in sifting through vast volumes of information, and which can quickly identify the most relevant documents.  
           [0006]    Given a large volume of text documents, presenting the user with summaries of these documents greatly facilitates the task of finding documents containing desired information. Text search and text summarization are two essential technologies that complement each other. Conventional text search engines return a set of documents based upon a relevance measurement with respect to a keyword query, for example; text summarization systems may then produce document summaries that facilitate a quick examination of the contents of each text document returned by the search (by providing, for example, an overview, keyword summary, or abstract).  
           [0007]    In other words, a text search engine may typically serve as an information filter for identifying an initial set of relevant documents, while a cooperating text summarization system may serve as an information spotter for assisting the user in identifying a final set of desired or relevant documents.  
           [0008]    There are two types of text summaries: generic summaries, and query-relevant summaries. Generic summaries provide an overall sense of a particular document&#39;s content, while query-relevant summaries present only content from a particular document that is closely related to the initial search query.  
           [0009]    A good generic summary should contain the main topics presented in a document while minimizing redundancy. Since the generic summarization process is not responsive to a particular keyword query or topic search, developing a high quality generic summarization method and system has proven very challenging. A query-relevant summary, on the other hand, presents document contents that are specifically related to an initial search query; in many existing systems, creating a query-relevant summary is essentially a process of retrieving query-relevant sentences from the document. It will be appreciated by those of skill in the art that this process is strongly related to the text retrieval process. Accordingly, query-relevant summarization is most often achieved simply by extending conventional IR technologies.  
           [0010]    Many text summarization methods have been proposed; many recent research studies have been directed toward query-relevant text summarization methods. For example, B. Baldwin and T. S. Morton have proposed a query-sensitive summarization method that selects sentences from the documents until all the phrases in the query are represented. A sentence in the document is considered to represent a phrase in the query if the sentence and the phrase “corefer” to the same individual, organization, event, and so forth (B. Baldwin et al.,  Dynamic Co-reference-Based Summarization , in Proceedings of the Third Conference on Empirical Methods in Natural Language Processing (EMNLP3), Granada, Spain, June 1998). R. Barzilay and M. Elhadad have developed a method that creates text summaries by finding lexical chains in documents (R. Barzilay et al.,  Using Lexical Chains For Text Summarization , in Proceedings of the Workshop on Intelligent Scalable Text Summarization (Madrid, Spain), August 1997).  
           [0011]    Mark Sanderson has approached the problem by dividing each document into equally sized overlapping passages, and using the INQUERY IR system to retrieve the passage from each document that best matches a query. This “best passage” is then used as a summary of the document. A query expansion technique called Local Context Analysis (LCA, which is also from INQUERY) is used before the best passage retrieval. Given a topic and a document collection, the LCA procedure retrieves top-ranked documents from the collection and examines the context surrounding the topic terms in each retrieved document; LCA then selects the words or phrases that are frequent in these contexts and adds these words or phrases to the original query (M. Sanderson,  Accurate User Directed Summarization From Existing Tools , in Proceedings of the 7th International Conference on Information and Knowledge Management (CIKM98), 1998).  
           [0012]    The SUMMARIST text summarizer from the University of Southern California attempts to create text summaries based on the equation:  
           summarization=topic identification+interpretation+generation  
           [0013]    The identification stage filters the input document to determine the most important central topics. The interpretation stage clusters words and abstracts them into some encompassing concepts. Finally, the generation stage generates summaries either by outputting some portions of the input, or by creating new sentences based on the interpretation of the document concepts (E. Hovy et al.,  Automated Text Summarization in Summarist , in Proceedings of the TIPSTER Workshop, Baltimore, Md., 1998). This generation function was not realized in the work upon which this paper was based.  
           [0014]    The Knowledge Management (KM) system from SRA International, Inc. extracts summarization features using morphological analysis, name tagging, and co-reference resolution. The KM approach uses a machine-learning technique to determine the optimal combination of features in combination with statistical information from the corpus to identify the best sentences to include in a summary (http://www.SRA.com). The Cornell/Sabir system uses the document ranking and passage retrieval capabilities of the SMART text search engine to identify relevant passages in a document (C. Buckley et al.,  The SMART/Empire TIPSTER IR System , in Proceedings of TIPSTER Phase III Workshop, 1999). The text summarizer from CGI/CMU uses a technique called Maximal Marginal Relevance (MMR), which measures the relevance of each sentence in a document, both relative to a query as well as relative to sentences that have already been added to the summary. The MMR system then produces summaries of a document by identifying key relevant, non-redundant information found within the document (J. Goldstain et al.,  Summarizing Text Documents: Sentence Selection and Evaluation Metrics , in Proceedings of ACM SIGIR&#39;99, Berkeley, Calif., August 1999).  
           [0015]    Query-relevant text summaries such as those mentioned above may be useful for determining whether a given document is relevant to a user&#39;s query, and, if a document is relevant, for identifying which part of the document is related to the query. Since query-relevant summaries are created responsive to particular queries, however, these types of summaries do not provide an overall sense of the document content; consequently, query-relevant summaries are not appropriate for content overview. Generic text summarization techniques must be developed for identifying key topics within documents and for categorizing those documents.  
         SUMMARY OF THE INVENTION  
         [0016]    The present invention provides two approaches to output high quality generic text summaries of predetermined or user-specified length. Briefly, the various inventive embodiments provide generic summarization of document content using relevance measurement technologies and latent semantic analysis techniques. Generic text summaries may be produced by ranking and extracting sentences from original documents; broad coverage of document content as well as decreased redundancy may simultaneously be achieved by constructing summaries from sentences that are highly ranked and different from each other.  
           [0017]    In accordance with one aspect of the present invention, for example, conventional IR technologies may be applied in a unique way to perform the summarization. In one exemplary embodiment, three IR processes may be combined to ensure accurate summaries. An inventive system or method of text summarization may perform the following operations: measure the relevance between the document as a whole and each of its sentences; select the most relevant sentence in the context of the entire document; and eliminate all the terms contained in the selected sentence. These procedures of relevance measurement, sentence selection, and term elimination may be repeated in successive iterations until a predetermined number of sentences has been selected.  
           [0018]    In accordance with another aspect of the present invention, for example, a “terms-by-sentences” matrix of the entire document may be created. A singular value decomposition technique may be applied to the terms-by-sentences matrix such that all the sentences from the document may be projected into the singular vector space. A system and method of generic text summary may then select the sentences having the largest index values with the most important singular vectors as part of the text summary.  
           [0019]    The above-mentioned and other attendant advantages of the present invention will become more apparent upon examination of the following detailed description of the preferred embodiments thereof with reference to the attached drawing figures. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0020]    [0020]FIG. 1 is a simplified flow chart of the operation of one embodiment of a generic text summarization system and method.  
         [0021]    [0021]FIG. 2 is a simplified flow chart of the operation of another embodiment of a generic text summarization system and method. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0022]    With reference now to the drawings, FIG. 1 is a simplified flow chart of the operation of one embodiment of a generic text summarization system and method, and FIG. 2 is a simplified flow chart of the operation of another embodiment of a generic text summarization system and method.  
         [0023]    By way of background, a document usually consists of several topics. Some topics are typically described in detail by more sentences than other topics, and hence may be inferred to comprise the major (or most important) content of the document. Other topics may be briefly mentioned to supplement or to support the major topics, or to make the whole story more complete. Those of skill in the art will appreciate that a good generic text summary should cover the major topics of the document as thoroughly as possible within a prescribed length (word count or sentence count, for example), while at the same time, minimizing redundancy.  
         [0024]    A system and method of generic text summarization may advantageously decompose an entire document into a plurality of individual sentences; after such decomposition, a weighted term-frequency vector may be created for each sentence in the document as follows. A term-frequency vector, T i , for a passage, i, may be expressed as  
           T   i   [t   1i   , t   2i   , . . . , t   ni ,] t    
         [0025]    where each element, t ji , denotes the frequency with which a given term, j, occurs in the passage i. The passage i may represent an individual phrase, a sentence, a paragraph, or the entire document, for example.  
         [0026]    Similarly, a weighted term-frequency vector, A i , for the same passage may be expressed as  
           A   i   [a   1i   , a   2i   , . . . , a   ni .] t    
         [0027]    where each element, a ji , in the weighted term-frequency vector may further be defined as  
           a   ji   =L ( t   ji ) G ( t   ji ).  
         [0028]    In the equation above, L(t ji ) represents a local weighting function for term j in passage i, and G(t ji ) represents a global weighting function for term j. During its creation, the weighted term-frequency vector A 1 , may be normalized by its length |A i |; accordingly, during subsequent computations, the system may employ either the original term-frequency vector A i , or the normalized vector.  
         [0029]    It will be appreciated by those of skill in the art that many possible weighting schemes exist for both the local weighting function L(t ji ) and the global weighting function G(t ji ). Different weighting schemes may influence the performance of a generic text summarization system and method; performance and accuracy may be maximized when both an appropriate local weighting function and an appropriate global weighting function are applied simultaneously.  
         [0030]    By way of example only, and not by way of limitation, a local weighting function, L(i), may take one of the following four popular forms.  
         [0031]    In a very simplistic, No Weight scheme: L(i)=tf(i), where tf(i) represents the number of times the term i occurs in a given sentence.  
         [0032]    In a Binary Weight scheme: L(i)=1, if the term i appears at least once in a given sentence; otherwise, L(i)=0.  
         [0033]    In an Augmented Weight scheme: L(i)=0.5+0.5 (tf(i)/tf(max)), where tf(max) represents the term-frequency of the most frequently occurring term in a sentence.  
         [0034]    In a Logarithmic Weight scheme: L(i)=log(1+tf(i)).  
         [0035]    Also by way of example only, a global weighting function G(i) may take one of the following two popular forms.  
         [0036]    In a No Weight scheme: G(i)=1, for any given term i.  
         [0037]    In an Inverse Document Weight scheme: G(i)=log(N/n(i)), where N represents the total number of sentences in the document, and n(i) represents the number of sentences that contain the term i.  
         [0038]    Additionally, as noted above, when a weighted term-frequency vector, A k , of a sentence, k, is created using one of the local and one of the global weighting schemes noted above, for example, either the original form of A k  may be used by the summarizer, or another vector may be created by normalizing A k  by its length, or magnitude, |A i |. In this exemplary embodiment with four possible local weighting functions, two possible global weighting functions, and the option of implementing the original or the normalized vector,  16  possible weighting schemes exist. It will be appreciated by those of skill in the art that other combinations and possibilities exist, with different approaches or strategies for local and global weighting.  
         [0039]    Turning now to FIG. 1, an exemplary embodiment of a generic text summarizer may apply conventional IR technologies to create accurate and non-redundant summaries. First, a document may be decomposed into a plurality of individual sentences from which a candidate sentence set may be created (block  101 ). A weighted term-frequency vector as described above, for example, may be created for the entire document as a whole as well as for each sentence in the candidate sentence set (block  102 ). Next, a relevance score may be computed for each sentence in the candidate sentence set in accordance with relevance to the document as a whole, and the sentence with the highest relevance score may be selected as a sentence for inclusion in the summary (blocks  103  and  104 ).  
         [0040]    Various techniques are known in the art for computing relevance scores for one vector relative to another vector. For example, at block  103 , a method and system of generic text summarization may calculate the inner product (or dot product) of the weighted term-frequency vector for the sentence under consideration and the weighted term-frequency vector for the document.  
         [0041]    The selected sentence may then be removed from the candidate sentence set, and all the terms contained in this selected sentence may be eliminated from the document (block  105 ). As shown in block  105 , deletion of the sentence and elimination of that sentence&#39;s terms from the document generally requires that the weighted term-frequency vector for the document as a whole be reconstructed; this may ensure accuracy of subsequent relevancy computations.  
         [0042]    As indicated at block  106 , with respect to the remaining sentences, the relevance score computation (block  103 ), the sentence selection (block  104 ), and the term elimination (block  105 ) operations may be repeated until a predetermined number of sentences has been selected.  
         [0043]    It will be appreciated by those of skill in the art that, at block  104  of the foregoing operation, the sentence, k, having the highest relevance score (relative to the document) may be considered the sentence that best represents the major content of the document. Therefore, selecting sentences based upon relevance scores in the foregoing manner may ensure that tie summary represents the major topics of the document to the greatest extent possible. On the other hand, eliminating all the terms contained in k from the document, as shown at block  105 , may ensure that retrieval of the subsequent sentence (in the following iteration) with the highest relevance score will create minimum overlap with the subject matter contained in sentence k. In this manner, a very low level of redundancy may be achieved during creation of a summary that covers every major topic in the document.  
         [0044]    In accordance with the latent semantic indexing approach illustrated in the FIG. 2 embodiment, a singular value decomposition (SVD) technique may be employed during creation of a generic text summary, as described in detail below. As indicated at block  201 , this alternative embodiment may begin in the same manner as the FIG. 1 embodiment, namely, by decomposing a document into a plurality of individual sentences from which a candidate sentence set may be created.  
         [0045]    By way of background, it should be appreciated that in order to implement SVD techniques during document summarization, a “terms-by-sentences” matrix may be constructed for the document (block  202 ). A terms-by-sentences matrix may be in the form  
         
       A=[A 
       1 
       , A 
       2 
       , . . . A 
       n] 
     
         [0046]    where each column vector A i  represents the weighted term-frequency vector of a sentence, i, in the document under consideration. If there are a total of m terms and n sentences in the document, then the terms-by-sentences matrix A for the entire document will have dimensions of m×n. Since every word does not normally appear in each sentence, the matrix A is usually sparse. In practice, local and global weightings such as described above may be applied to increase or to decrease the importance of terms within a particular sentence or among sentences, as is known in the art (see, e.g., S. Dumais,  Improving The Retrieval of Information From External Sources , Behavior Research Methods, Instruments, and Computers, vol. 23, 1991).  
         [0047]    Given a matrix, A, of dimensions m×n, where without loss of generality m≧n, the SVD of A is defined as follows (see, W. Press et al.,  Numerical Recipes in C. The Art of Scientific Computing , Cambridge, England: Cambridge University Press, 2 ed., 1992):  
         
       A=UΣV 
       T  
     
         [0048]    In the equation above: U=[u ij ] is an m×n column-orthonormal matrix whose columns are called left singular vectors; Σ=diag(σ 1 , σ 2 , . . . , σ n ) is an n×n diagonal matrix whose diagonal elements are non-negative singular values sorted in descending order; V=[v 1j ] is an n×n orthonormal matrix whose columns are called right singular vectors; and V T  is the transpose of V. If rank (A)=r, then Σ satisfies the following relationship:  
         σ 1 ≧σ 2 ≧ . . . σ r ≧σ r+1 = . . . =σ n =0  
         [0049]    This application of SVD techniques to the matrix A may be interpreted from two different perspectives. From a transformation point of view, the SVD derives a mapping between the m-dimensional space spanned by the weighted term-frequency vectors and the r-dimensional singular vector space with all of its axes linearly-independent. This mapping projects each column vector in matrix A (which represents the weighted term-frequency vector of sentence i), to column vector ψ i =[v i1 , V i2 , . . . , v ir ] T  of matrix V T , and maps each row vector in matrix A (which represents the occurrence count of the term, j, in each of the documents), to row vector φ j =[u j1 , u j2 , . . . , u jr ] of matrix U. Here, each element, v ix  of ψ i , u jy  of φ j , is called the index with the i th , j th  singular vectors, respectively.  
         [0050]    From a semantic point of view, the SVD technique may enable the summarizer to derive the latent semantic structure of the document represented by the matrix A (see, e.g., S. Deerwester et al.,  Indexing By Latent Semantic Analysis , Journal of the American Society for Information Science, vol. 41, pp. 391-407, 1990). This operation may reflect a breakdown of the original document into a number, r, of linearly-independent base vectors or concepts. Each term and sentence from the document may be jointly indexed by these base vectors and concepts. A unique SVD feature which is lacking in conventional IR technologies is that the SVD may generally be capable of capturing and modeling the interrelationships among terms such that semantic clusters of terms and sentences may be created.  
         [0051]    By way of example, consider the words “doctor”, “physician”, “hospital”, “medicine”, and “nurse”. The words “doctor” and “physician” may be used synonymously in many circumstances, while “hospital”, “medicine”, and “nurse” may represent closely related concepts. The two synonyms, doctor and physician, will often appear with many of the same related words such as hospital, medicine, nurse, and so forth. Given such similar or predictable patterns of word combinations, the words doctor and physician may be mapped near to each other in the r-dimensional singular vector space.  
         [0052]    Furthermore, (as illustrated by M. Berry et al.,  Using Linear Algebra For Intelligent Information Retrieval , Tech. Rep. UT-CS-94-270, University of Tennessee, Computer Science Department, Dec. 1994), if a word or sentence, W, has a large index value with an important singular vector, then W is very likely to represent a major or important topic or concept of the document as a whole. Other words or sentences which are closely related to W may advantageously be mapped close to W, and along the same singular vector as W in the space. In other words, each singular vector from the SVD may be interpreted as representing an identifiable, salient concept or topic in the document, and the magnitude of its corresponding singular value may represent the degree of importance of that salient topic.  
         [0053]    Returning now to FIG. 2, the operation of an exemplary embodiment of an SVD-based document summarizer may proceed substantially as follows. First, as noted above, a document may be decomposed into a plurality of individual sentences from which a candidate sentence set may be created (block  201 ); additionally, a sentence counter variable, k, may be initialized at k=1. After document decomposition, a terms-by-sentences matrix, A (as described above, for example), may be created for the entire document (block  202 ). Creation of the terms-by-sentences matrix may advantageously employ both local and global weighting functions for each term in the document.  
         [0054]    Next, as indicated at block  203 , the SVD may be performed on A in order to obtain the singular value matrix, Σ, and the right singular vector matrix, V T . Each sentence, i, may be represented by the column vector ψ i =[v i1 , V i2 , . . . , V ir ] T  of V T . The system may then select the k th  right singular vector from matrix V T , which is equivalent to selecting the k th  row of V T  (block  204 ).  
         [0055]    In this embodiment, the sentence having the largest index value with the k th  right singular vector may then be selected as a relevant sentence and included in the summary (block  205 ). Finally, as indicated at block  206 , if the sentence counter variable, k, reaches a predetermined number, the operation may be terminated; otherwise, k may be incremented by one, and the system may revert to Block  204  for the next iteration.  
         [0056]    At block  205  in FIG. 2, identifying the sentence having the largest index value on the k th  right singular vector may be equivalent to finding the column vector ψ i  whose k th  element v ik  is the largest. This operation may generally be equivalent to finding the sentence describing the salient topic represented by the k th  singular vector. Since the singular vectors are sorted in descending order of their singular values, the k th  singular vector represents the k th  important topic. Because all the singular vectors are independent of each other, the sentences selected in accordance with this technique may contain the minimum redundancy.  
         [0057]    From the foregoing, it can be seen that the present invention provides accurate generic text summaries of a desired length while minimizing redundancy and making efficient use of system resources. The preferred embodiments disclosed herein have been described and illustrated by way of example only, and not by way of limitation; it will be apparent to those of skill in the art that numerous modifications may be made thereto without departing from the spirit and scope of the invention.