Davis, C.H.; McKim, G.W.: Systematic weighting and ranking : cutting the Gordian knot (1999)
0.08
0.07774002 = product of:
0.11661003 = sum of:
0.0664249 = weight(_text_:search in 3548) [ClassicSimilarity], result of:
0.0664249 = score(doc=3548,freq=4.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.38015217 = fieldWeight in 3548, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=3548)
0.05018513 = product of:
0.10037026 = sum of:
0.10037026 = weight(_text_:engines in 3548) [ClassicSimilarity], result of:
0.10037026 = score(doc=3548,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.39294976 = fieldWeight in 3548, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0546875 = fieldNorm(doc=3548)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- A powers-of-two algorithm is described that automatically creates discrete, well-defined, and unique result sets, displaying them in decreasing order of likely relevance. All computations are transparent, and a simple query form allows the searcher to focus on the choice of terms and their sequence - an implicit indicator of their relative importance. The program can be used with traditional databases or with search engines designed for the WWW. It also can be used with an intelligent agent to search the Web with a pushdown store, returning only those items that best reflect the searcher's stated interests
