-
Carpineto, C.; Romano, G.: Information retrieval through hybrid navigation of lattice representations (1996)
0.03
0.028094485 = product of:
0.07023621 = sum of:
0.052814763 = weight(_text_:bibliographic in 7434) [ClassicSimilarity], result of:
0.052814763 = score(doc=7434,freq=2.0), product of:
0.17541347 = queryWeight, product of:
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.04505818 = queryNorm
0.30108726 = fieldWeight in 7434, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.0546875 = fieldNorm(doc=7434)
0.01742145 = product of:
0.0348429 = sum of:
0.0348429 = weight(_text_:data in 7434) [ClassicSimilarity], result of:
0.0348429 = score(doc=7434,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.24455236 = fieldWeight in 7434, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=7434)
0.5 = coord(1/2)
0.4 = coord(2/5)
- Abstract
- Presents a comprehensive approach to automatic organization and hybrid navigation of text databases. An organizing stage builds a particular lattice representation of the data, through text indexing followed by lattice clustering of the indexed texts. The lattice representation supports the navigation state of the system, a visual retrieval interface that combines 3 main retrieval strategies: browsing, querying, and bounding. Such a hybrid paradigm permits high flexibility in trading off information exploration and retrieval, and had good retrieval performance. Compares information retrieval using lattice-based hybrid navigation with conventional Boolean querying. Experiments conducted on 2 medium-sized bibliographic databases showed that the performance of lattice retrieval was comparable to or better than Boolean retrieval
-
Faloutsos, C.: Signature files (1992)
0.02
0.01773171 = product of:
0.08865855 = sum of:
0.08865855 = sum of:
0.03982046 = weight(_text_:data in 3499) [ClassicSimilarity], result of:
0.03982046 = score(doc=3499,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.04883809 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.04883809 = score(doc=3499,freq=2.0), product of:
0.15778607 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04505818 = queryNorm
0.30952093 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.2 = coord(1/5)
- Date
- 7. 5.1999 15:22:48
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.02
0.015772909 = product of:
0.078864545 = sum of:
0.078864545 = sum of:
0.042235978 = weight(_text_:data in 5123) [ClassicSimilarity], result of:
0.042235978 = score(doc=5123,freq=4.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.29644224 = fieldWeight in 5123, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.036628567 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.036628567 = score(doc=5123,freq=2.0), product of:
0.15778607 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04505818 = queryNorm
0.23214069 = fieldWeight in 5123, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.2 = coord(1/5)
- Abstract
- Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching
- Date
- 12. 9.1996 13:56:22
-
Burgin, R.: ¬The retrieval effectiveness of 5 clustering algorithms as a function of indexing exhaustivity (1995)
0.01
0.014726144 = product of:
0.07363072 = sum of:
0.07363072 = sum of:
0.043106914 = weight(_text_:data in 3365) [ClassicSimilarity], result of:
0.043106914 = score(doc=3365,freq=6.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.30255508 = fieldWeight in 3365, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=3365)
0.030523809 = weight(_text_:22 in 3365) [ClassicSimilarity], result of:
0.030523809 = score(doc=3365,freq=2.0), product of:
0.15778607 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04505818 = queryNorm
0.19345059 = fieldWeight in 3365, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=3365)
0.2 = coord(1/5)
- Abstract
- The retrieval effectiveness of 5 hierarchical clustering methods (single link, complete link, group average, Ward's method, and weighted average) is examined as a function of indexing exhaustivity with 4 test collections (CR, Cranfield, Medlars, and Time). Evaluations of retrieval effectiveness, based on 3 measures of optimal retrieval performance, confirm earlier findings that the performance of a retrieval system based on single link clustering varies as a function of indexing exhaustivity but fail ti find similar patterns for other clustering methods. The data also confirm earlier findings regarding the poor performance of single link clustering is a retrieval environment. The poor performance of single link clustering appears to derive from that method's tendency to produce a small number of large, ill defined document clusters. By contrast, the data examined here found the retrieval performance of the other clustering methods to be general comparable. The data presented also provides an opportunity to examine the theoretical limits of cluster based retrieval and to compare these theoretical limits to the effectiveness of operational implementations. Performance standards of the 4 document collections examined were found to vary widely, and the effectiveness of operational implementations were found to be in the range defined as unacceptable. Further improvements in search strategies and document representations warrant investigations
- Date
- 22. 2.1996 11:20:06
-
Couvreur, T.R.; Benzel, R.N.; Miller, S.F.; Zeitler, D.N.; Lee, D.L.; Singhal, M.; Shivaratri, N.; Wong, W.Y.P.: ¬An analysis of performance and cost factors in searching large text databases using parallel search systems (1994)
0.01
0.010562953 = product of:
0.052814763 = sum of:
0.052814763 = weight(_text_:bibliographic in 7657) [ClassicSimilarity], result of:
0.052814763 = score(doc=7657,freq=2.0), product of:
0.17541347 = queryWeight, product of:
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.04505818 = queryNorm
0.30108726 = fieldWeight in 7657, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.0546875 = fieldNorm(doc=7657)
0.2 = coord(1/5)
- Abstract
- The results of modelling the performance of searching large text databases (>10 GBytes) via various parallel hardware architectures and search algorithms are discussed. The performance under load and the cost of each configuration are compared. Strengths, weaknesses, performance sensitivities, and search features supported for each configuration are also addressed. In addition, a common search workload used in the modelling is described. The search workload is derived from a set of searches run against the Chemical Abstracts file of bibliographic and abstract text available on STN International. This common workload is applied to all configurations modelled to provide a common basis of comparison
-
Rada, R.; Barlow, J.; Potharst, J.; Zanstra, P.; Bijstra, D.: Document ranking using an enriched thesaurus (1991)
0.01
0.0090539595 = product of:
0.045269795 = sum of:
0.045269795 = weight(_text_:bibliographic in 6626) [ClassicSimilarity], result of:
0.045269795 = score(doc=6626,freq=2.0), product of:
0.17541347 = queryWeight, product of:
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.04505818 = queryNorm
0.2580748 = fieldWeight in 6626, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.046875 = fieldNorm(doc=6626)
0.2 = coord(1/5)
- Abstract
- A thesaurus may be viewed as a graph, and document retrieval algorithms can exploit this graph when both the documents and the query are represented by thesaurus terms. These retrieval algorithms measure the distance between the query and documents by using the path lengths in the graph. Previous work witj such strategies has shown that the hierarchical relations in the thesaurus are useful but the non-hierarchical are not. This paper shows that when the query explicitly mentions a particular non-hierarchical relation, the retrieval algorithm benefits from the presence of such relations in the thesaurus. Our algorithms were applied to the Excerpta Medica bibliographic citation database whose citations are indexed with terms from the EMTREE thesaurus. We also created an enriched EMTREE by systematically adding non-hierarchical relations from a medical knowledge base. Our algorithms used at one time EMTREE and, at another time, the enriched EMTREE in the course of ranking documents from Excerpta Medica against queries. When, and only when, the query specifically mentioned a particular non-hierarchical relation type, did EMTREE enriched with that relation type lead to a ranking that better corresponded to an expert's ranking
-
Savoy, J.: Ranking schemes in hybrid Boolean systems : a new approach (1997)
0.01
0.0090539595 = product of:
0.045269795 = sum of:
0.045269795 = weight(_text_:bibliographic in 393) [ClassicSimilarity], result of:
0.045269795 = score(doc=393,freq=2.0), product of:
0.17541347 = queryWeight, product of:
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.04505818 = queryNorm
0.2580748 = fieldWeight in 393, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.893044 = idf(docFreq=2449, maxDocs=44218)
0.046875 = fieldNorm(doc=393)
0.2 = coord(1/5)
- Abstract
- In most commercial online systems, the retrieval system is based on the Boolean model and its inverted file organization. Since the investment in these systems is so great and changing them could be economically unfeasible, this article suggests a new ranking scheme especially adapted for hypertext environments in order to produce more effective retrieval results and yet maintain the effectiveness of the investment made to date in the Boolean model. To select the retrieved documents, the suggested ranking strategy uses multiple sources of document content evidence. The proposed scheme integrates both the information provided by the index and query terms, and the inherent relationships between documents such as bibliographic references or hypertext links. We will demonstrate that our scheme represents an integration of both subject and citation indexing, and results in a significant imporvement over classical ranking schemes uses in hybrid Boolean systems, while preserving its efficiency. Moreover, through knowing the nearest neighbor and the hypertext links which constitute additional sources of evidence, our strategy will take them into account in order to further improve retrieval effectiveness and to provide 'good' starting points for browsing in a hypertext or hypermedia environement
-
Stanfill, C.: Parallel information retrieval algorithms (1992)
0.01
0.008904126 = product of:
0.044520628 = sum of:
0.044520628 = product of:
0.089041255 = sum of:
0.089041255 = weight(_text_:data in 3515) [ClassicSimilarity], result of:
0.089041255 = score(doc=3515,freq=10.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.6249551 = fieldWeight in 3515, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3515)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Data Parallel computers, such as the connection Machine CM-2, can provide interactive access to text databases containign tens, hundreds or even thousands of Gigabytes of data. Starts by presenting a brief overview of data parallel computing, a performance model of the CM-2, and a model of the workload involved in searching text databases. Discusses various algorithms used in information retrieval and gives performance estimates based on the data and procssing models presented
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Baeza-Yates, R.A.: Introduction to data structures and algorithms related to information retrieval (1992)
0.01
0.0086213825 = product of:
0.043106914 = sum of:
0.043106914 = product of:
0.08621383 = sum of:
0.08621383 = weight(_text_:data in 3082) [ClassicSimilarity], result of:
0.08621383 = score(doc=3082,freq=6.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.60511017 = fieldWeight in 3082, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.078125 = fieldNorm(doc=3082)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- In this chapter we review the main concepts and data structures used in information retrieval, and we classify information retrieval related algorithms
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Harman, D.; Fox, E.; Baeza-Yates, R.; Lee, W.: Inverted files (1992)
0.01
0.0056314636 = product of:
0.028157318 = sum of:
0.028157318 = product of:
0.056314636 = sum of:
0.056314636 = weight(_text_:data in 3497) [ClassicSimilarity], result of:
0.056314636 = score(doc=3497,freq=4.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.3952563 = fieldWeight in 3497, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3497)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- This chaper presents a survey of the various structures (techniques) that can be used in building inverted files, and gives the details for producing an inverted file using sorted arrays. The chapter ends with 2 modifications to this basic method that are affective for large data collections
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.00
0.004273333 = product of:
0.021366665 = sum of:
0.021366665 = product of:
0.04273333 = sum of:
0.04273333 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.04273333 = score(doc=1319,freq=2.0), product of:
0.15778607 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04505818 = queryNorm
0.2708308 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Date
- 1. 8.1996 22:08:06
-
Chang, R.: Keyword searching and indexing (1993)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 7223) [ClassicSimilarity], result of:
0.03982046 = score(doc=7223,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 7223, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=7223)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- Explains how a computer indexing system works. Reviews fundamentals of how data are stored and retrieved by computers. Describes B-Tree and B+-Tree indexing structures. Gives basic keyword searching techniques that the user must apply to make use of the indexing programs. The demand for keyword retrieval is increasing and librarians should expect to see the keyword-indexing feature become commonly available
-
Pfeifer, U.; Pennekamp, S.: Incremental processing of vague queries in interactive retrieval systems (1997)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 735) [ClassicSimilarity], result of:
0.03982046 = score(doc=735,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 735, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=735)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Abstract
- The application of information retrieval techniques in interactive environments requires systems capable of effeciently processing vague queries. To reach reasonable response times, new data structures and algorithms have to be developed. In this paper we describe an approach taking advantage of the conditions of interactive usage and special access paths. To have a reference we investigate text queries and compared our algorithms to the well known 'Buckley/Lewit' algorithm. We achieved significant improvements for the response times
-
Gonnet, G.H.; Snider, T.; Baeza-Yates, R.A.: New indices for text : PAT trees and PAT arrays (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3500) [ClassicSimilarity], result of:
0.03982046 = score(doc=3500,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3500, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3500)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Frakes, W.B.: Stemming algorithms (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3503) [ClassicSimilarity], result of:
0.03982046 = score(doc=3503,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3503, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Baeza-Yates, R.A.: String searching algorithms (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3505) [ClassicSimilarity], result of:
0.03982046 = score(doc=3505,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3505, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3505)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Harman, D.: Relevance feedback and other query modification techniques (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3508) [ClassicSimilarity], result of:
0.03982046 = score(doc=3508,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3508, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3508)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Wartik, S.: Boolean operators (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3509) [ClassicSimilarity], result of:
0.03982046 = score(doc=3509,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3509)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3510) [ClassicSimilarity], result of:
0.03982046 = score(doc=3510,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3510, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Harman, D.: Ranking algorithms (1992)
0.00
0.003982046 = product of:
0.01991023 = sum of:
0.01991023 = product of:
0.03982046 = sum of:
0.03982046 = weight(_text_:data in 3511) [ClassicSimilarity], result of:
0.03982046 = score(doc=3511,freq=2.0), product of:
0.14247625 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.04505818 = queryNorm
0.2794884 = fieldWeight in 3511, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0625 = fieldNorm(doc=3511)
0.5 = coord(1/2)
0.2 = coord(1/5)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
