-
Pfeifer, U.; Pennekamp, S.: Incremental processing of vague queries in interactive retrieval systems (1997)
0.04
0.044672765 = product of:
0.08934553 = sum of:
0.04138403 = weight(_text_:data in 735) [ClassicSimilarity], result of:
0.04138403 = score(doc=735,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.0479615 = product of:
0.095923 = sum of:
0.095923 = weight(_text_:processing in 735) [ClassicSimilarity], result of:
0.095923 = score(doc=735,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.5060184 = fieldWeight in 735, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0625 = fieldNorm(doc=735)
0.5 = coord(1/2)
0.5 = coord(2/4)
- 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
-
Information retrieval : data structures and algorithms (1992)
0.04
0.036463115 = product of:
0.07292623 = sum of:
0.05173004 = weight(_text_:data in 3495) [ClassicSimilarity], result of:
0.05173004 = score(doc=3495,freq=8.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.34936053 = fieldWeight in 3495, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=3495)
0.021196188 = product of:
0.042392377 = sum of:
0.042392377 = weight(_text_:processing in 3495) [ClassicSimilarity], result of:
0.042392377 = score(doc=3495,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 3495, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=3495)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The book consists of separate chapters by some 20 different authors. It covers many of the information retrieval algorithms, including methods of file organization, file search and access, and query processing
- Content
- An edited volume containing data structures and algorithms for information retrieval including a disk with examples written in C. for prgrammers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents. ------------------Enthält die Kapitel: FRAKES, W.B.: Introduction to information storage and retrieval systems; BAEZA-YATES, R.S.: Introduction to data structures and algorithms related to information retrieval; HARMAN, D. u.a.: Inverted files; FALOUTSOS, C.: Signature files; GONNET, G.H. u.a.: New indices for text: PAT trees and PAT arrays; FORD, D.A. u. S. CHRISTODOULAKIS: File organizations for optical disks; FOX, C.: Lexical analysis and stoplists; FRAKES, W.B.: Stemming algorithms; SRINIVASAN, P.: Thesaurus construction; BAEZA-YATES, R.A.: String searching algorithms; HARMAN, D.: Relevance feedback and other query modification techniques; WARTIK, S.: Boolean operators; WARTIK, S. u.a.: Hashing algorithms; HARMAN, D.: Ranking algorithms; FOX, E.: u.a.: Extended Boolean models; RASMUSSEN, E.: Clustering algorithms; HOLLAAR, L.: Special-purpose hardware for information retrieval; STANFILL, C.: Parallel information retrieval algorithms
-
Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999)
0.03
0.033504575 = product of:
0.06700915 = sum of:
0.031038022 = weight(_text_:data in 5777) [ClassicSimilarity], result of:
0.031038022 = score(doc=5777,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.2096163 = fieldWeight in 5777, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=5777)
0.035971127 = product of:
0.071942255 = sum of:
0.071942255 = weight(_text_:processing in 5777) [ClassicSimilarity], result of:
0.071942255 = score(doc=5777,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3795138 = fieldWeight in 5777, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046875 = fieldNorm(doc=5777)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing
- LCSH
- Text processing (Computer science)
- Subject
- Text processing (Computer science)
-
Faloutsos, C.: Signature files (1992)
0.03
0.03338095 = product of:
0.0667619 = sum of:
0.04138403 = weight(_text_:data in 3499) [ClassicSimilarity], result of:
0.04138403 = score(doc=3499,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.025377871 = product of:
0.050755743 = sum of:
0.050755743 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.050755743 = score(doc=3499,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = 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.5 = coord(1/2)
0.5 = coord(2/4)
- 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.03
0.0314639 = product of:
0.0629278 = sum of:
0.043894395 = weight(_text_:data in 5123) [ClassicSimilarity], result of:
0.043894395 = score(doc=5123,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.019033402 = product of:
0.038066804 = sum of:
0.038066804 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.038066804 = score(doc=5123,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = 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.5 = coord(1/2)
0.5 = coord(2/4)
- 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.03
0.030330349 = product of:
0.060660698 = sum of:
0.04479953 = weight(_text_:data in 3365) [ClassicSimilarity], result of:
0.04479953 = score(doc=3365,freq=6.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.01586117 = product of:
0.03172234 = sum of:
0.03172234 = weight(_text_:22 in 3365) [ClassicSimilarity], result of:
0.03172234 = score(doc=3365,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = 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.5 = coord(1/2)
0.5 = coord(2/4)
- 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
-
Stanfill, C.: Parallel information retrieval algorithms (1992)
0.02
0.023134377 = product of:
0.09253751 = sum of:
0.09253751 = weight(_text_:data in 3515) [ClassicSimilarity], result of:
0.09253751 = score(doc=3515,freq=10.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- 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.02
0.022399765 = product of:
0.08959906 = sum of:
0.08959906 = weight(_text_:data in 3082) [ClassicSimilarity], result of:
0.08959906 = score(doc=3082,freq=6.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- 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
-
Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995)
0.02
0.01852868 = product of:
0.07411472 = sum of:
0.07411472 = sum of:
0.042392377 = weight(_text_:processing in 5697) [ClassicSimilarity], result of:
0.042392377 = score(doc=5697,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.22363065 = fieldWeight in 5697, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=5697)
0.03172234 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
0.03172234 = score(doc=5697,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.19345059 = fieldWeight in 5697, 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=5697)
0.25 = coord(1/4)
- Date
- 22. 2.1996 13:14:10
- Source
- Information processing and management. 31(1995) no.4, S.605-620
-
Reddaway, S.: High speed text retrieval from large databases on a massively parallel processor (1991)
0.02
0.016956951 = product of:
0.067827806 = sum of:
0.067827806 = product of:
0.13565561 = sum of:
0.13565561 = weight(_text_:processing in 7745) [ClassicSimilarity], result of:
0.13565561 = score(doc=7745,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 7745, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=7745)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 27(1991), S.311-316
-
Ciocca, G.; Schettini, R.: ¬A relevance feedback mechanism for content-based image retrieval (1999)
0.01
0.014837332 = product of:
0.05934933 = sum of:
0.05934933 = product of:
0.11869866 = sum of:
0.11869866 = weight(_text_:processing in 6498) [ClassicSimilarity], result of:
0.11869866 = score(doc=6498,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.6261658 = fieldWeight in 6498, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.109375 = fieldNorm(doc=6498)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 35(1999) no.5, S.605-632
-
Koyama, M.: ¬A fast retrieving algorithm of hierarchical relationships using tree structures (1998)
0.01
0.014837332 = product of:
0.05934933 = sum of:
0.05934933 = product of:
0.11869866 = sum of:
0.11869866 = weight(_text_:processing in 6403) [ClassicSimilarity], result of:
0.11869866 = score(doc=6403,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.6261658 = fieldWeight in 6403, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.109375 = fieldNorm(doc=6403)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 34(1998) no.6, S.761-763
-
Lee, J.H.: Combining the evidence of different relevance feedback methods for information retrieval (1998)
0.01
0.014837332 = product of:
0.05934933 = sum of:
0.05934933 = product of:
0.11869866 = sum of:
0.11869866 = weight(_text_:processing in 6469) [ClassicSimilarity], result of:
0.11869866 = score(doc=6469,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.6261658 = fieldWeight in 6469, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.109375 = fieldNorm(doc=6469)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 34(1998) no.6, S.681-691
-
Harman, D.; Fox, E.; Baeza-Yates, R.; Lee, W.: Inverted files (1992)
0.01
0.014631464 = product of:
0.058525857 = sum of:
0.058525857 = weight(_text_:data in 3497) [ClassicSimilarity], result of:
0.058525857 = score(doc=3497,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- 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
-
Cole, C.: Intelligent information retrieval: diagnosing information need : Part I: the theoretical framework for developing an intelligent IR tool (1998)
0.01
0.012717713 = product of:
0.05087085 = sum of:
0.05087085 = product of:
0.1017417 = sum of:
0.1017417 = weight(_text_:processing in 6431) [ClassicSimilarity], result of:
0.1017417 = score(doc=6431,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.53671354 = fieldWeight in 6431, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.09375 = fieldNorm(doc=6431)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 34(1998) no.6, S.709-720
-
Cole, C.: Intelligent information retrieval: diagnosing information need : Part II: uncertainty expansion in a prototype of a diagnostic IR tool (1998)
0.01
0.012717713 = product of:
0.05087085 = sum of:
0.05087085 = product of:
0.1017417 = sum of:
0.1017417 = weight(_text_:processing in 6432) [ClassicSimilarity], result of:
0.1017417 = score(doc=6432,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.53671354 = fieldWeight in 6432, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.09375 = fieldNorm(doc=6432)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 34(1998) no.6, S.721-731
-
Chang, R.: Keyword searching and indexing (1993)
0.01
0.0103460075 = product of:
0.04138403 = sum of:
0.04138403 = weight(_text_:data in 7223) [ClassicSimilarity], result of:
0.04138403 = score(doc=7223,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- 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
-
Gonnet, G.H.; Snider, T.; Baeza-Yates, R.A.: New indices for text : PAT trees and PAT arrays (1992)
0.01
0.0103460075 = product of:
0.04138403 = sum of:
0.04138403 = weight(_text_:data in 3500) [ClassicSimilarity], result of:
0.04138403 = score(doc=3500,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Frakes, W.B.: Stemming algorithms (1992)
0.01
0.0103460075 = product of:
0.04138403 = sum of:
0.04138403 = weight(_text_:data in 3503) [ClassicSimilarity], result of:
0.04138403 = score(doc=3503,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
-
Baeza-Yates, R.A.: String searching algorithms (1992)
0.01
0.0103460075 = product of:
0.04138403 = sum of:
0.04138403 = weight(_text_:data in 3505) [ClassicSimilarity], result of:
0.04138403 = score(doc=3505,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
