Data processing: presentation processing of document – operator i – Presentation processing of document – Layout
Reexamination Certificate
1998-12-18
2004-09-07
Hong, Stephen S. (Department: 2178)
Data processing: presentation processing of document, operator i
Presentation processing of document
Layout
C715S252000, C715S252000
Reexamination Certificate
active
06789230
ABSTRACT:
TECHNICAL FIELD
This invention relates generally to a computer system for document processing, and more specifically for generating a summary of a document.
BACKGROUND OF THE INVENTION
The Internet is a collection of interconnected computer systems through which users can access a vast store of information. The information accessible through the Internet is stored in electronic files (i.e., documents) under control of the interconnected computer systems. It has been estimated that over 50 million documents are currently accessible through the Internet and that the number of documents is growing at the rate of 75% per year. Although a wealth of information is stored in these documents, it has been very difficult for users to locate documents relating to a subject of interest. The difficulty arises because documents are stored in many different computer systems, and the Internet provides no central mechanism for registering documents. Thus, a user may not even know of the existence of certain documents, let alone the subject matter of the documents. Each document that is accessible through the Internet is assigned a unique identifier, which is referred to as a uniform resource locator (“URL”). Once a user knows the identifier of a document, the user can access the document. However, even if a user knows the identifiers of all documents accessible through the Internet, the user may not know the subject matter of the document. Thus, the user may have no practical way to locate a document relating to a subject of interest.
Several search engines have been developed to assist users to locate documents relating to a subject of interest. Search engines attempt to locate and index as many of the documents provided by as many computer systems of the Internet as possible. The search engines index the documents by mapping terms that represent the subject matter of each document to the identifier of the document. For example, if a search engine determines that the terms “united” and “states” represent the subject matter of a document, then the search engine would map each of those terms to the URL for the document. When using a search engine to locate documents relating to a subject of interest, the user enters search terms that describe the subject of interest. The search engine then searches the index to identify those documents that are most relevant to the search terms. For example, if a user enters the search terms “united” and “states,” then the search engine searches the index to identify the documents that are most relevant to those search terms. In addition, the search engine may present the search results, that is the list of relevant documents, to the user in order based on the relevance to the search term. The user can then select and display the most relevant documents.
The accuracy of the search results depends upon the accuracy of the indexing used by a search engine. Unfortunately, there is no easy way for a search engine to determine accurately the subject matter of documents. The difficulty in determining the subject matter of a document is compounded by the wide variety of formats (e.g., as a word processing documents or as a hyper-text document) and the complexity of the formats of the documents accessible through the Internet. To make it easier for a search engine to determine the subject matter of a document, some document formats have a “keyword” section that provides words that are representative of the subject matter of the document. Unfortunately, creators of documents often fill the “keyword” section with words that do not accurately represent the subject matter of the document using what is referred to as “false promoting” or “spamming.” For example, a creator of a classified advertising web page for automobiles that may fill the “keyword” section with repetitions of the word “car.” The creator does this so that a search engine will identify that web page as very relevant whenever a user searches for the term “car.” However, a “keyword” section that more accurately represents the subject matter of the web page may include the words “automobile,” “car,” “classified,” “for,” and “sale.”
Because the document formats have no reliable way to identify the subject matter of a document, search engines use various algorithms to determine the actual subject matter of documents. Such algorithms may generate a numerical value for each term in a document that rates importance of the term within the document. For example, if the term “car” occurs in a document more times than any other term, then the algorithm may give a high numerical value to the term “car” for that document. Typical algorithms used to rate the importance of a term within a document often factor in not only the frequency of the occurrence of term within the document, but also the number of documents that contain that term. For example, if a term occurs two times in a certain document and also occurs in many other documents, then the importance of that term to the document may be relatively low. However, if the term occurs two times in that document, but occurs in no other documents, then the importance of that term within the document may be relatively high even though the term occurs only two times in the document. In general, these algorithms attempt to provide a high “information score” to the terms that best represent the subject matter of a document with respect to both the document itself and to the collection of documents.
To calculate the importance or “information score,” typical algorithms take into consideration what is referred to as the term frequency within a document and the document frequency. The term frequency of a term is the number of times that the term occurs in the document. The term frequency for term i within document j is represented as TF
ij
. The document frequency of a term is the number of documents in which the term occurs. The document frequency for term i is represented as n
i
. One such algorithm uses the Salton Buckley formula for calculating the importance of terms. The formula is given by the following equation:
W
ij
=
log
2
TF
ij
*
log
2
N
n
i
(
1
)
where W
ij
is the numerical value (i.e., weight) of the importance of the term i to the document j, where TF
ij
is the term frequency, where n
i
is the document frequency, and where N is the total number of documents in a collection of documents. The quotient N
i
is referred to as the inverse document frequency, which is the inverse of the ratio of the number of documents that contain the term to the total number of documents. As the term frequency increases, the weight calculated by this formula increases logarithmically. That is, as the term occurs more frequently in a document, the weight of that term within the document increases. Also, as the document frequency increases, the weight decreases logarithmically. That is, as a term occurs in more documents, the weight of the term decreases. It is, of course, desirable to use a formula that results in weights that most accurately reflect the importance or information score of terms.
Search engines typically identify and index only single terms. Search engines, however, do not typically index phrases, which are sequences of two or more terms. For example, a search engine may index the terms that comprise the phrase “United States,” separately. Thus, when a user wants to locate documents related to the “United States,” the search engine may locate many documents that contain the terms “united” and states,” but that do not contain the phrase “United States.” As a result, the search engine may locate many documents that are of no interest to the user. For example, the search engine may locate documents that contain the sentence: “He then states that united we stand.” Moreover, even if a search engine could index phrases, the search engines would calculate the importance of a phrase in a manner that is analogous the calculation of the importance of a term. That is, the search engines would treat the phrase as a single term and would use the formula as shown in e
Jones William P.
Katariya Sanjeev
Hong Stephen S.
Microsoft Corporation
Paula Cesar B
Woodcock & Washburn LLP
LandOfFree
Creating a summary having sentences with the highest weight,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Creating a summary having sentences with the highest weight,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Creating a summary having sentences with the highest weight,... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3241817