Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-09-16
2002-06-04
Coby, Frantz (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06401086
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention relates to a method for the automatic generation of a summary of a text by means of a computer.
2. Description of the Related Art
From the European Patent document EP 0 751 470 A1, a method for the automatic summarization of a text is known. Feature probabilities are thereby determined that enable an automatic summarization.
Today, it is difficult and strenuous to select, from a flood of information, the information that is important according to predeterminable personal criteria. Even after the selection, a nearly inexhaustible mass of data, e.g. in the form of articles, is often provided. Since with the aid of a computer it is easy to acquire and manage large quantities of data, the idea suggests itself of using the computer also for the preparation or, respectively, for the selection of information. Such an automatic reduction of information should make it possible for a user to have to read a significantly smaller amount of data in order to obtain the information that is relevant for the user.
A particular type of information reduction is the summarization of texts.
From the publication by J. Kupiec, J. Pedersen and F. Chen, “A Trainable Document Summarizer,” Xerox, Palo Alto Research Center, 1995, a method is known for the summarization of texts that uses heuristic features with a discrete value range. The probability that a sentence from the text belongs to the summary, under the condition that a heuristic feature has a particular value, is estimated from a training set of summaries.
SUMMARY OF THE INVENTION
An object of the invention is the automatic generation of a summary from a predetermined text, whereby this summary should reproduce in short form the essential content of the text.
This and other objects and advantages of the invention are achieved by a method for the automatic generation of a summary of a text by a computer, in which for each sentence a probability is calculated that the sentence belongs to the summary, in that, for each word in the sentence, the relevance measure is determined from a lexicon that contains application-specific words with a predetermined relevance measure for each of these words, and all relevance measures cumulatively yield the probability that the sentence belongs to the summary; all sentences of the text are sorted according to the probabilities; and corresponding to a predeterminable reduction measure, for the summarization the best sentences are displayed in a sequence given by the text.
The inventive method enables a summarization of a text in that for each sentence of this text a probability that the sentence belongs to the summary is calculated. For each word in the sentence, the relevance measure is determined from a lexicon that contains all relevant words, with a predetermined relevance measure for each of these words. The cumulation of all relevance measures yields the probability that the sentence belongs to the summary. All sentences are thereupon sorted according to their probability. A predeterminable reduction measure that indicates what percentage of the original text is represented in the summary serves for the selection of the number of sentences given by this reduction measure from the sorted representation. If the most important x percent of sentences have been selected, these are displayed as a summary of the text in their original sequence given by this text.
An advantageous development of the inventive method is the introduction of an individual word frequency in addition to the relevance measure. This individual word frequency indicates how often the respectively indicated word occurs in the entire text to be summarized. Taking into account the relevance measure and this newly introduced individual word frequency, the probability that the respective sentence is contained in the summary can be indicated by the following rule:
WK
(
sentence
)
=
1
N
·
∑
i
=
1
N
tf
·
rlv
(
1
)
whereby
WK
(sentence)
is the probability that a sentence belongs to the summary,
N is the total number of words that occur in the sentence,
i is a count variable (i=1,2, . . . , N) for all the words in the sentence,
tf is the frequency of the occurrence of the respective word under consideration in the entire text being summarized (individual word frequency), and
rlv is the relevance measure for the respective word in the sentence.
Let it be hereby noted that the words occurring in the lexicon with their relevance measure rlv, known from the lexicon, are decisive. If a word that does not occur in the lexicon occurs n times, this word does not increase the probability that the sentence belongs to the summary.
A development of the inventive method is the use of an application-specific lexicon. This has the result that the summary is carried out with a predeterminable subject-matter-specific filter. Thus, for example, a lexicon specified for sport articles will, in a text to be summarized, evaluate sport-related words with a higher relevance than a lexicon that is specialized for summaries of economics contributions. It is thus advantageously possible to provide specific knowledge concerning predeterminable categories by means of lexica corresponding to the respective categories.
In addition, it is advantageous to allocate a text to one or more categories. This can be carried out automatically by using specific predeterminable words in the theme-related lexica as selection criteria for an allocation to the respective subject area. If several categories (subject areas), i.e. various viewpoints or, respectively, filters, are possible for the summarization of a text, different summaries —one for each category—can be produced automatically.
In the present application, the terms application-specific lexicon, subject-related lexicon, and theme-related lexicon are used as alternative terms for the lexicon according to the invention.
REFERENCES:
patent: 4965763 (1990-10-01), Zamora
patent: 5317507 (1994-05-01), Gallant
patent: 5325298 (1994-06-01), Gallant
patent: 5371673 (1994-12-01), Fan
patent: 5604910 (1997-02-01), Kojima et al.
patent: 5799299 (1998-08-01), Fujiwara
patent: 5946648 (1999-08-01), Halstead, Jr. et al.
patent: 5963940 (1999-10-01), Liddy et al.
patent: 6006221 (1999-12-01), Liddy et al.
patent: 6026388 (2000-02-01), Liddy et al.
patent: 6199034 (2001-03-01), Wical.
patent: 0361464 (1990-04-01), None
patent: 0 751 470 (1997-01-01), None
patent: 0751470 (1997-02-01), None
patent: 3 278270 (1991-12-01), None
patent: 8 305695 (1996-11-01), None
IBM Technical Bulletin, Method for Automatic Extraction of Relevant Sentences From Texts, Nov. 1990, vol. 33, pp. 338-339.
Coby Frantz
Siemens Aktiengesellschaft
Staas & Halsey , LLP
LandOfFree
Method for automatically generating a summarized text by a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for automatically generating a summarized text by a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for automatically generating a summarized text by a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2910666