AN IMPROVED INFORMATION RETRIEVAL SYSTEM UTILIZING PROBABILITIES

Abstract: Methods and systems consistent with the present invention provide an improved IR system that performs information retrieval by using probabilities. When performing information retrieval, the improved IR system utilizes both the prior probability (410) that a document is relevant independent of the query as well as the probability that the query was generated by a particular document given that the particular document is relevant (414). By using these probabilities, the improved IR system retrieves documents (416) in a more accurate manner than conventional systems which are based on an ad hoc approach.

Description: AN IMPROVED INFORMAΗON RETRIEVAL SYSTEM UTILIZING PROBABILITIES Technical Field The present invention relates generally to data processing systems and, more particularly, to an improved information retrieval system. Background Art Information retrieval (IR) systems have been developed that allow users to identify particular documents of interest from among a larger number of documents. IR systems are useful for finding an article in a digital library, a news story in a broadcast repository, or a particular web site on the worldwide -web. To use such systems, the user specifies a query containing several words or phrases specifying areas of interest, and the system then retrieves documents it determines may satisfy the query. - ' Conventional IR systems use an ad hoc approach for performing information retrieval. Ad hoc approaches match queries to documents by identifying documents that contain the same words as those in the query. In one conventional IR system, an ad hoc weight is assigned to each matching word, the weight being computed from an ad hoc function of the number of times the word occurs in the document divided by the logarithm of the number of different documents in which the word appears. This ad hoc function was derived through an empirical process of attempting retrievals using the system and then modifying the weight computation to improve performance. Because conventional information retrieval systems use an ad hoc approach, accuracy suffers. Disclosure of Invention Methods and systems consistent with the present invention provide an improved IR system that performs information retrieval by using probabilities. When performing information retrieval, the improved IR system utilizes both the prior probability that a document is relevant independent of the query as well as the probability that the query was generated by (would be used to retrieve) a particular document given that the particular document is relevant. By using these probabilities, the improved LR system retrieves documents in a more accurate manner than conventional systems which are based on an ad hoc approach. In accordance with methods consistent with the present invention, a method in a data processing system having information items is provided. This method receives a query containing a query word from a user, determines a likelihood that at least one of the information items is relevant given the query word, and provides an indication that the at least one information item is likely relevant to the query word. In accordance with systems consistent with the present invention, a data processing system is provided containing a secondary storage device with documents, a memory with a query engine, and a processor configured to run the query engine. The query engine is configured to receive a query with query words indicating a relevant one of the documents and configured to utilize a formula to determine which among the documents is the relevant document. The formula is based on a model for how the query words were generated to express a need for the relevant document. Brief Description of the Drawings Figure 1A depicts a hidden Markov model reflecting the process of creating a query; Figure IB depicts a more detailed diagram of the general words state in the hidden Markov model of Figure 1A; Figure IC depicts a more detailed diagram of the document word state depicted in the hidden Markov model of Figure 1A; Figure ID depicts a more detailed diagram of the topic state of the hidden Markov model depicted in Figure 1A; Figure 2 depicts a data processing system suitable for practicing methods and systems consistent with the present invention; Figures 3A and 3B depict a flow chart of the steps performed by the system trainer depicted in Figure 2; and Figure 4 depicts a flow chart of the steps performed by the query engine depicted in Figure 2. Best Mode for Carrying Out the Invention Methods and systems consistent with the present invention provide an improved IR system that uses probabilities to improve accuracy over conventional systems. Specifically, the improved LR system receives a query, determines the likelihood that each of a number of documents is relevant given the query, and returns a list of the documents determined to be most relevant. Methods and systems consistent with the present invention do not use an ad hoc approach like conventional systems; rather, they use an approach having a sound mathematical basis. As a result, the improved IR system typically achieves a greater accuracy than conventional, ad hoc IR systems. Methods and systems consistent with the present invention approach the problem of relating queries to documents as a statistical pattern recognition problem, finding all documents that are relevant to the query. In doing so, the improved IR system derives the posterior probability that each document is relevant given the query and then chooses all documents whose posterior probability (i.e., P(document is relevant | query)) is above a certain threshold or ranks them according to this probability. By reformulating the posterior probability using Bayes' rule, the following formula is derived: P(D is R I Q) = P(D is R)*P(Q I D is R) P(Q) Where the term "P(D is R)" refers to the prior probability that a document is relevant (independent of the query), which reflects that a given document may be more likely to be relevant than others. For example, based upon empirical data obtained from many retrievals, it can be determined that documents from a particular source tend to be more relevant than others. Also, the length of a document is directly related to the likelihood that it is relevant (i.e., the more words a document has, the more likely that it will contain information in which the user is interested). As an alternative to the prior probability, a bias (i.e., any positive value) could be used by methods and systems consistent with the present invention to optimize the accuracy of the improved IR system. The term "P(Q | D is R)" reflects a generative model of the probability that the query was generated by a particular document given the document is relevant. The generative model models the process of the user creating a query by using a hidden Markov model (discussed in further detail below), and based on this model, the improved IR system derives various probablistic formulae, which are used during the information retrieval process. The last term "P(Q)" reflects the likelihood of receiving a query independent of any of the documents. Because this probability is common to all documents, this term can be removed and the formula can be reformulated as follows: P(D is R | Q α P(D is R) * P(Q | D is R) Accordingly, the improved M system retrieves documents based on an estimation of the likelihood that the document is relevant given the query. Overview To improve the accuracy of the improved IR system, methods and systems consistent with the present invention model the IR process using a hidden Markov model. A hidden Markov model is a construct used to model various processes, such as speech recognition. It comprises a number of states, each with an associated probability distribution. A process is modeled by a hidden Markov model by transitioning through the states based on various observations. Fig. 1 A depicts a hidden Markov model 100 used by the improved IR system to model the process the user used when generating a query. According to the model, the user starts the process of query generation by selecting a word from one of three sources, represented as states 102-106, and looping back to select another word from the sources. This process continues until the query is complete. In accordance with methods and systems consistent with the present invention, the user may have used a word for one of three purposes: first, the word may be merely a general word not directed to the document in which he is interested. For example, the word may be part of the following phrase, "I would like documents relating to." Second, the word may have been derived from one or more of the documents, or third, the word may have been selected to indicate a topic or subject in which the user is interested. Based on this understanding of query generation, the hidden Markov model has three states: 102, 104, and 106. State 102 reflects that the query word was derived from among a set of general words. State 104 reflects that the query word was selected from one or more of the documents, and state 106 reflects that the query word was selected to indicate a topic in which the user is interested. Fig. IB depicts a more detailed diagram of general word state 102 of hidden Markov model 100. General word state 102 is represented as hidden Markov model 120. This model contains a number of states 122-126 representing the set of words that may be inserted into a query but which are not indicative of the kind of documents that a user would like. Each state (e.g., 122) represents one word from this set. Additionally, each state 122-126 has an associated probability of the word occurring in general language (i.e., in a random sampling of all of the words in all of the documents, how often this word appears). Although methods and systems consistent with the present invention are described relative to the English language, one skilled in the art will appreciate that they can work with other languages as well. Fig. IC depicts a more detailed diagram of document word state 104 of hidden Markov model 100. Hidden Markov model 140 contains a number of states 142-146, where each state represents one or more words in one of the documents. That is, a state may represent an entire phrase of words, and there is one hidden Markov model 140 for each document. Each state 142-146 not only contains one or more words from the document, but also contains all of its various forms and synonyms. In addition, each state 142-146 contains a probability "P (q n | d j )" for each form and synonym of the query word or words "q n " appearing in document which is based on the number of times the words appear in the document. Fig. ID depicts a more detailed diagram of topic state 106 in hidden Markov model 100 of Fig. 1A. Topic state 106 contains a hidden Markov model 160 for each document. Hidden Markov model 160 contains a number of states 162-166 reflecting the topics that a particular document discusses. Each state contains a probability for the particular query word being used to indicate that particular topic. Based on this theoretical model, methods and systems consistent with the present invention utilize various probabilistic formulae derived from this model as is further discussed below. In performing its processing, methods and systems consistent with the present invention perform various off -line processing by a system trainer and perform various run-time processing by a query engine. As part of the off-line processing, the system trainer performs topic identification and classification by generating a list of topics reflected by the documents and by generating a list of documents that are directed to each topic. The system trainer also performs system training by creating various statistics used during run-time processing. The query engine performs run-time processing by receiving a query and by using the derived probabilistic formulae to rank the documents based on the likelihood that they are relevant to the query. Another aspect of the improved LR system is that it performs relevance feedback to further improve performance. Relevance feedback allows for the improved LR system to identify documents that may be relevant to a query by using words received from some of the documents, not the user. In performing relevance feedback, the improved LR system uses the query received from the user to generate a ranked list of relevant documents and then creates additional queries by supplementing the original query with words found in common among a number of the relevant documents returned by the original query. In this manner, documents can be retrieved and determined to be likely relevant to the original query even though they did not contain some or all of the user's query words. Relevance feedback is described in further detail below. Although methods and systems consistent with the present invention are described below relative to retrieving documents that are considered relevant to a query, one skilled in the art will recognize that such techniques can be used to retrieve any items of information from among a larger body of items. Such items of information include web sites, articles, and other information sources. Implementation Details Fig. 2 depicts a data processing system 200 suitable for use with methods and systems consistent with the present invention. Data processing system 200 contains a memory 202, a secondary storage device 204, a video display 206, a central processing unit (CPU) 208, and an input device 210. Memory 202 contains the system trainer 212 and the query engine 214. Secondary storage device 204 contains the documents 216 that are searched, a database 218 containing various statistics used at runtime, and training data 220 containing mappings of queries onto some of the documents 216 that have been determined to be relevant to the queries. For example, one mapping may contain the query "President Clinton" and the documents "doc 1," "doc5," and "doc 12" because these documents discuss President Clinton. This training data is manually created by a user generating queries and then determining which of the documents are relevant to each query. Although data processing system 200 has been described with reference to various components, one skilled in the art will appreciate that the data processing system may contain additional or different components. Additionally, although various aspects of the present invention are described as being stored in memory, one skilled in the art will appreciate that these aspects may be stored on or read from other computer-readable media, such as hard disks, floppy disks, a carrier wave from a network, or other forms of RAM or ROM. Furthermore, one skilled in the art will appreciate that documents 216 may be located on a remote system. Figures 3A and 3B depict a flow chart of the steps performed by the system trainer in accordance with methods and systems consistent with the present invention. The system trainer first performs topic classification training (step 302). In this step, the system trainer performs topic classification in which each document is associated, with a list of topics that are believed to be discussed in the document and a probability P(t I d) indicating the likelihood that the document discusses a topic. Additionally, the system trainer examines documents 216, identifies all topics that the documents discuss, and generates "P(q I tj ) for each topic, which is the probability of particular words being related to a particular topic. The result of this step is a matrix T(d,i) containing a list of all documents, the topics which they discuss, and a probability that the document discusses this topic, which are stored in the database. An example of the matrix follows: docl Smoking 0.98 Civil Rights 0.54 Lung Cancer 0.34 doc2 Fidel Castro 0.72 Cuba 0.98 Florida 0.57 Any method for performing topic identification and classification could be performed in this step, such as that described in co-pending U.S. Patent Application No. 09/005,960, entitled "Topic indexing Method," filed on January 9, 1998. After performing topic identification and classification, the system trainer generates a matrix "T(i,d)" by inverting the matrix created in the previous step and stores the matrix into the database (step 304). For example, a portion the matrix T(i,d) may appear as follows: Smoking doc 1 0.98 doc 14 0.54 doc 101 0.78 Fidel Castro doc 2 0.72 doc 22 0.13 doc 78 0.91 Next, the system trainer compiles the lexicon (step 306). In this step, the system trainer examines the words in all of the documents, generates a list of all words in all the documents, ("the lexicon"), removes stop words, and stems each word to determine its root using well-known techniques. In removing the stop words, the system trainer removes all words not used to indicate a document, such as articles like "an" and "the." Alternatively, each stop word can be replaced with a token. When stemming the words, the system trainer identifies the root of the word. For example, the word "work" is the root for "work," "working," and "worked." After compiling the lexicon, the system trainer determines the number of times each word, appears in each document (step 308). In this step, the system trainer creates a matrix "C(d,w)," which is a count of the number of occurrences of each of the stemmed words in each document, and stores the matrix in the database. For example, a portion of the entries may be as follows: The system trainer then determines the length of each document "L(D)" (step 310) and counts the number of words in all documents (step 312). Next, the system trainer inverts the matrix C(d,w) to yield C(w,d) (step 314). For example, the entries in this matrix may be as follows: After inverting the matrix, the system trainer estimates the prior probability that a document is relevant as a function of various of the features of the document (step 316 in Figure 3B). This prior probability is indicated as "P(d is Rel | features (d))." In this step, the system trainer estimates the prior probability of the likelihood that the document is relevant over all queries by using attributes like the length and subject of the document. This processing is performed using the training data, which includes manually and empirically derived entries containing queries and the I documents considered relevant to those queries. In this step, the system trainer divides all documents into groups of documents based on source. For example, one group may include articles the Wall Street Journal and another group may include articles from the New York Times. After dividing all of the documents by source, the system trainer divides all of the documents by length. For example, one group may have <100words and another group may have >100words. Then, for each group, the system trainer determines the average number of times any of the documents within that group was returned as part of a query in the training data. This number is then divided by the total number of documents in the group, and the resulting probability is then assigned as the prior probability to each document in the group. The resulting probabilities can then be multiplied to obtain probabilities for various combinations of features (e.g., articles from the New York Times with less than 100 words). Although only source and length have been described, one skilled in the art will appreciate that this technique can be used for other features of the document, including the age of the document and the average length of the words in the document. Next, the system trainer estimates the probability that a query word is relevant based on various word features (step 318). The various word features that are used include the function of the word (e.g., noun, verb, etc.) or whether the word is capitalized. Identifying the function of the word and identifying whether it is capitalized are performed using well known techniques. In performing this step, the system trainer determines the features to be considered, such as form and capitalization, and then allocates storage ("a bin") for each combination. Thus, a bin is created for nouns that are capitalized, nouns that are uncapitalized, verbs that are capitalized, etc. Then, the system trainer examines all of the training data one query at a time. For each query word in a query, the system trainer determines with which bin the query word should be associated, determines in which of the relevant documents (i.e., the documents returned as part of the query) it is contained, and stores a fraction in the appropriate bin, where the numerator of the fraction reflects the number of relevant documents in which the word was found and the denominator reflects the total number of relevant documents. After each query word in each query is processed in this manner, the numerators of all fractions in a bin are added together, the denominators for all fractions in the bin are added together, and the fraction is divided out to yield a resulting probability, P(q is in d | d is rel, features (q)), that is assigned to each word in the bin. In addition to form and capitalization, other features of the word can also be used to influence this probability. For example, the fraction of all documents that contain this word ("document frequency") can be used. Additionally, the location of where the word is located in the document can be used. In this situation, when counting the number of relevant documents, if the word were located in the title or abstract of a document, the count can be increased by multiplying the count by a predetermined number (e.g., 5) indicating that it is more likely that this document is relevant to this word. After estimating the probability that a query word is relevant based on word features, the system trainer performs various processing to perform relevance feedback as reflected by steps 320-326. In performing relevance feedback, the system trainer runs the queries contained in the training data (step 320). In this step, the system trainer actually invokes the query engine to generate rankings for each of the queries in the training data, as is further described below. For example, if the training data had a query "President Clinton," this query would be performed on the query engine. Next, the system trainer generates a new query (step 322). In this step, the query engine has returned a predetermined number (e.g., 5) of the most relevant documents for each query found in the training data. The system trainer generates the new query by including the original query as received from the training data (e.g., "President Clinton") and all of the words found in common among a predetermined number of documents. For example, the system trainer may generate a new query containing the original query plus all of the words found in common among three of the five documents, four of the five documents, and five of the five documents. After generating the new query, the system trainer associates the new query with the documents associated with the original query (step 324). That is, the system trainer creates entries in the training data that include the new query and the documents associated with the original query. Next, the system trainer re-estimates the probability that a word is relevant based on word features (step 326). In this step, the system trainer performs the same processing as that described above relative to step 318 except that additional bins are created to include the frequency of the word (e.g., it was found in three of the five documents, four of the five documents, or five of the five documents). After re-estimating the probability, processing ends. In summary, the improved IR system estimates how much more likely a particular query word is to appear in a document given that the document is relevant to the query and given features of the query word, such as the form of the word, whether the word was in the original user query, how many of the original retrieved documents (e.g., 3 out of 5) in which this word occurs, and the fraction of the documents out of all of the documents that contain this word. This expression: H p(query word is in the doc | d is R, features [q]) - df [q] where df [q] is the document frequency of the query word, is used as the transition probability to the state 104 for the document words. Fig. 4 depicts a flowchart of the steps performed by the query engine in accordance with methods and systems, consistent with the present invention. The first step performed by the query engine is to receive a query (step 402). The query contains any number of words. After receiving a query, the query engine looks up each query word in the C(w,d) matrix (step 404). In this step, the query engine receives an indication of each document and the number of occurrences of that word in each document. For example, if the word "Clinton" were used as part of a query, the information returned may indicate that "doc 1 " contained two occurrences. After looking up each query word, the query engine computes a score for each document for each query word (step 406). In this step, the query engine utilizes the following formula: qscore(q,d) = Log(a*C(q,d)/L(d)+b*Σp(q | T;)*p(T'i | d) + (l-a-b)*C(q)/N) Where "a" = P(q is in d | d is rel, features (q)). It should be noted that the probabilities related to relevance feedback are not used at this time. They are used during a second pass, as discussed below. Where "b" is the weight for the topic state, which can be estimated in a manner similar to "a," as the probability that a query word that is not found in a relevant document will be found in the topic state for that document. Thus, the term " b*∑p(q | Tj)*p(Ti | d)" reflects the likelihood that a word wouldn't appear in a document, but it is still relevant to one or more topics discussed in the relevant document. And where the term "(l-a-b)*C(q)/N" reflects the probability that query word "q" is in any of the documents. Next, the query engine adds up the scores for each query word to obtain an overall score, score(d) (step 408). After adding up the scores, the query engine factors in the prior probability that the document is relevant given the features of the document (step 410). This step is performed by utilizing the following formula: Final Score (d) = score(d) + Log (P(d is rel | features(d)) After factoring in the prior probability, the query engine ranks each of the documents by the final score (step 412). In this step, the query engine may only display to the user a predetermined number of documents having the highest scores. Although a ranking has been generated, the query engine performs a second pass, as described below in steps 414 and 416, to perform relevance feedback and to identify documents that may be relevant to the query by using additional words 'Found in the top scoring documents. When performing relevance feedback, the query engine generates a new query based upon words found in the documents returned in step 412 (step 414). For example, in an embodiment where the top five documents are returned, the query engine generates a new query based upon words found in common among a number of the documents. In this example, the query engine may generate a new query comprising the original query plus all words found in common among three of the five documents, four of the five documents, and five of the five documents. Alternatively, the user may supervise the relevance feedback by selecting the most relevant ones of the returned documents (e.g., 5 out of I 0) and then by fashioning a new query out of these five documents. After creating the new query, the query engine retrieves documents based on the new query (step 416). In this step, the query engine repeats steps 404 through 412 using the new query and generates a new ranked list of documents. In ranking the documents, the query engine utilizes the probabilities related to relevance feedback in step 406,

Claims: Claims: 1. A method in a data processing system having information items, comprising the steps of: receiving a query containing a query word from a user; determining a posterior probability that at least one of the information items is relevant given the query word; and indicating to the user that the at least one information item is likely relevant to the query word. 2. The method of claim 1 wherein the information items are documents, and wherein the determining step includes: determining the likelihood that each of the documents is relevant given the query word, and wherein the indicating step further includes: ranking each of the documents based on the determined likelihood. 3. The method of claim I wherein the determining step includes: basing the determination on a prior probability that the at least one information item is relevant independent of the query word. 4. The method of claim 3 wherein the basing step includes: determining the prior probability based on features of the at least one of the information items. 5. The method of claim 3 wherein the basing step includes: determining the prior probability based on a source of the at least one information item. 6. The method of claim 3 wherein the basing step includes: determining the prior probability based on a length of the at least one information item. 7. The method of claim 3 wherein the basing step includes: determining the prior probability based on an age of the at least one information item. 8. The method of claim 3 wherein the basing step includes: determining the prior probability based on an average length of words in the at least one information item. 9. The method of claim I wherein the determining step includes: basing the determination on a likelihood of the query word given the at least one information item is determined to be relevant. 10. The method of claim 9 wherein the basing step includes: determining the likelihood of the query word given the at least one information item determined to be relevant and given features of the query word. 11. The method of claim 9 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a form of the query word. 12. The method of claim 9 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a capitalization of the query word. 13. The method of claim 9 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a frequency with which the query word appears in information items other than the at least one information item. 14. The method of claim 9 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a location of where the query word is located within the at least one information item. 15. The method of claim 9 wherein the basing steps includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and a number of times the query word appears in the at least one information item. 16. The method of claim 9 wherein the basing step includes: using a hidden Markov model to model the likelihood of the query word given the at least one information item is determined to be relevant. 17. The method of claim 16 wherein the hidden Markov model has a state for general words, and wherein the using step includes: estimating a likelihood that the query word was generated from a set of words unrelated to determining whether the at least one information item is relevant by using the general word state. 18. The method of claim 16 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated the query word by using the document word state. 19. The method of claim 16 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated a form of the query word by using the document word state. 20. The method of claim 16 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated a synonym of the query word by using the document word state. 21. The method of claim 16 wherein the hidden Markov model has a topic state, and wherein the using step includes: estimating a likelihood that the query word is relevant to a topic of the information item by using the topic word state. 22. The method of claim 1 wherein the receiving step includes: receiving the query containing a sequence of words, wherein the determining step includes: determining a likelihood that the information items are relevant given the sequence of query words, and wherein the indicating step includes: indicating to the user the determined likelihood that the information items are relevant given the sequence of query words. 23. The method of claim 1 wherein the determining step includes: determining a likelihood that the at least one information item is relevant given the query word and given at least one other query word obtained from an information item other than the at least one information item. 24. The method of claim 1 wherein the determining step includes: estimating a likelihood that a word obtained from a plurality of the information items will be found in the at least one information item. 25. The method of claim 1 wherein the determining step includes: estimating a likelihood that the at least one information item is relevant given the query word and given a plurality of other query words found in common among a plurality of the information items. 26. A data processing system containing: a secondary storage device with documents; a memory with a query engine configured to receive a query with query words indicating a relevant one of the documents and configured to utilize a formula to determine which among the documents is the relevant document, where the formula is based on a model for how the query words were generated to express a need for the relevant document; and a processor configured to run the query engine. 27. The data processing system of claim 26 wherein the model is a hidden Markov model. 28. The data processing system of claim 27 wherein the hidden Markov model has a state representing that a query word was selected from a group of words unrelated to indicating the relevant document. 29. The data processing system of claim 27 wherein the hidden Markov model has a state representing that a query word was selected from the relevant document. 30. The data processing system of claim 27 wherein the documents have associated topics and wherein the hidden Markov model has a state representing that a query word was selected to indicate one of the associated topics. 31. A method in a computer system for performing information retrieval, the computer system having a plurality of documents with document words, comprising: identifying topics associated with the documents; determining which of the identified topics are associated with each of the documents; determining a first probability for each of the documents indicating a likelihood that each associated topic is associated with the document; determining, for each document word in each document, a second probability for a likelihood that the document word is relevant to each of the topics associated with the document; receiving training data including training queries with training words and indications of which of the documents are determined relevant to each training query; estimating a third probability of a likelihood that each of the documents is relevant over all training queries by using features of each document; estimating a fourth probability of a likelihood, for each training query, that each training word in the training query is relevant to each document determined relevant to the training query based on features of the training word; receiving a user query with query words from a user; determining a fifth probability, for each query word and for each document, based on a percentage of the document that is the query word; and determining which of the documents are relevant to the user query by using the first probability, the second probability, the third probability, the fourth probability, and the fifth probability. 32. The method of claim 31 wherein the estimating a third probability step includes: estimating the third probability by using a source of each document. 33. The method of claim 31 wherein the estimating a third probability step includes: estimating the third probability by using a length of each document. 34. The method of claim 31 wherein the estimating a third probability step includes: estimating the third probability by using an average word length of each document. 35. The method of claim 31 wherein the estimating a third probability step includes: estimating the third probability by using an age of each document. 36. The method of claim 31 wherein the estimating a fourth probability step includes: estimating the fourth probability based on a function of the training word. 37. The method of claim 31 wherein the estimating a fourth probability step includes: estimating the fourth probability based on a capitalization of the training word. 38. The method of claim 31 wherein the estimating a fourth probability step includes: estimating the fourth probability based on a location of the training word in each training document. 39. The method of claim 31 wherein the estimating a fourth probability step includes: estimating the fourth probability based on a number of times that the training word appears in each training document. 40. A computer-readable medium containing instructions for controlling a data processing system having information items to perform a method, the method comprising the steps of: receiving a query containing a query word from a user; determining a posterior probability that at least one of the information items is relevant given the query word; and indicating to the user that the at least one information item is likely relevant to the query word. 41. The computer-readable medium of claim 40 wherein the information items are documents, and wherein the determining step includes: determining the likelihood that each of the documents is relevant given the query word, and wherein the indicating step further includes: ranking each of the documents based on the determined likelihood. 42. The computer-readable medium of claim 40 wherein the determining step includes: basing the determination on a prior probability that the at least one information item is relevant independent of the query word. 43. The computer-readable medium of claim 42 wherein the basing step includes: determining the prior probability based on features of the at least one of the information items. 44. The computer-readable medium of claim 42 wherein the basing step includes: determining the prior probability based on a source of the at least one information item. 45. The computer-readable medium of claim 42 wherein the basing step includes: determining the prior probability based on a length of the at least one information item. 46. The computer-readable medium of claim 42 wherein the basing step includes: determining the prior probability based on an age of the at least one information item. 47. The computer-readable medium of claim 42 wherein the basing step includes: determining the prior probability based on an average length of words in the at least one information item. 48. The computer-readable medium of claim 40 wherein the determining step includes: basing the determination on a likelihood of the query word given the at least one information item is determined to be relevant. 49. The computer-readable medium of claim 48 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given features of the query word. 50. The computer-readable medium of claim 48 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a form of the query word. 51. The computer-readable medium of claim 48 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a capitalization of the query word. 52. The computer-readable medium of claim 48 wherein the basing step includes: determining the likelihood of the query word given the at least one information items determined to be relevant and given a frequency with which the query word appears in information items other than the at least one information item. 53. The computer-readable medium of claim 48 wherein the basing step includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and given a location of where the query word is located within the at least one information item. 54. The computer-readable medium of claim 48 wherein the basing steps includes: determining the likelihood of the query word given the at least one information item is determined to be relevant and a number of times the query word appears in the at least one information item. 55. The computer-readable medium of claim 48 wherein the basing step includes: using a hidden Markov model to model the likelihood of the query word given the at least one information item is determined to be relevant. 56. The computer-readable medium of claim 55 wherein the hidden Markov model has a state for general words, and wherein the using step includes: estimating a likelihood that the query word was generated from a set of words unrelated to determining whether the at least one information item is relevant by using the general word state. 57. The computer-readable medium of claim 55 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated the query word by using the document word state. 58. The computer-readable medium of claim 55 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated a form of the query word by using the document word state. 59. The computer-readable medium of claim 55 wherein the hidden Markov model has a document word state, and wherein the using step includes: estimating a likelihood that the at least one information item generated a synonym of the query word by using the document word state. 60. The computer-readable medium of claim 55 wherein the hidden Markov model has a topic state, and wherein the using step includes: estimating a likelihood that the query word is relevant to a topic of the information item by using the topic word state. 61. The computer-readable medium of claim 40 wherein the receiving step includes: receiving the query containing a sequence of words, wherein the determining step includes: determining a likelihood that the information items are relevant given the sequence of query words, and wherein the indicating step includes: indicating to the user the determined likelihood that the information items are relevant given the sequence of query words. 62. The computer-readable medium of claim 40 wherein the determining step includes: determining a likelihood that the at least one information item is relevant given the query word and given at least one other query word obtained from an information item other than the at least one information item. 63. The computer-readable medium of claim. 40 wherein the determining step includes: estimating a likelihood that a word obtained from a plurality of the information items will be found in the at least one information item. 64. The computer-readable medium of claim 40 wherein the determining step includes: estimating a likelihood that the at least one information item is relevant given the query word and given a plurality of other query words found in common among a plurality of the information items.

Inventors: LEEK TIMOTHY R, MILLER DAVID R H, SCHWARTZ RICHARD M, LEEK, TIMOTHY, R., MILLER, DAVID, R., H., SCHWARTZ, RICHARD, M.
Applicants: GTE INTERNETWORKING INC, GTE INTERNETWORKING INCORPORATED
Application year: 1999
Main classification: G06F17
IPC codes: G06F17