Evans, R.: Beyond Boolean : relevance ranking, natural language and the new search paradigm (1994)
0.01
0.0059357807 = product of:
0.023743123 = sum of:
0.023743123 = product of:
0.047486246 = sum of:
0.047486246 = weight(_text_:software in 8578) [ClassicSimilarity], result of:
0.047486246 = score(doc=8578,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.2629875 = fieldWeight in 8578, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.046875 = fieldNorm(doc=8578)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- New full-text search engines that employ relevance ranking have become available online services. These software tools provide increased ease of use by making natural language queries possible, and deliver superior recall. Even inexperienced end users can execute searchers with good results. For experienced database searchers, the ranked search engines offer a technology that is complementary to structured Boolean strategy, not necessarily a replacement. Even traditional Boolean queries become useful when the results are ranked by probable relevance, such ranking can free users from overwhelming output. Relevance ranking also permits the use of statistical inference methods to find related terms. using such tools to their best advantage requires rethinking some basic techniques, such as progressively narrowing queries until the retrieved set is small enough. users should broaden their search to maximize recall, then browse retrieved documents or pare the set down from the top
