-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.11
0.105139755 = product of:
0.21027951 = sum of:
0.21027951 = sum of:
0.16825233 = weight(_text_:searching in 5123) [ClassicSimilarity], result of:
0.16825233 = score(doc=5123,freq=18.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.80450237 = fieldWeight in 5123, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.04202718 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.04202718 = score(doc=5123,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = 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)
- 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
-
Kelledy, F.; Smeaton, A.F.: Signature files and beyond (1996)
0.05
0.049055643 = product of:
0.09811129 = sum of:
0.09811129 = sum of:
0.05608411 = weight(_text_:searching in 6973) [ClassicSimilarity], result of:
0.05608411 = score(doc=6973,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.26816747 = fieldWeight in 6973, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.046875 = fieldNorm(doc=6973)
0.04202718 = weight(_text_:22 in 6973) [ClassicSimilarity], result of:
0.04202718 = score(doc=6973,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.23214069 = fieldWeight in 6973, 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=6973)
0.5 = coord(1/2)
- Abstract
- Proposes that signature files be used as a viable alternative to other indexing strategies such as inverted files for searching through large volumes of text. Demonstrates through simulation, that search times can be further reduced by enhancing the basic signature file concept using deterministic partitioning algorithms which eliminate the need for an exhaustive search of the entire signature file. Reports research to evaluate the performance of some deterministic partitioning algorithms in a non simulated environment using 276 MB of raw newspaper text (taken from the Wall Street Journal) and real user queries. Presents a selection of results to illustrate trends and highlight important aspects of the performance of these methods under realistic rather than simulated operating conditions. As a result of the research reported here certain aspects of this approach to signature files are shown to be found wanting and require improvement. Suggests lines of future research on the partitioning of signature files
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.05
0.049055643 = product of:
0.09811129 = sum of:
0.09811129 = sum of:
0.05608411 = weight(_text_:searching in 2419) [ClassicSimilarity], result of:
0.05608411 = score(doc=2419,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.26816747 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.04202718 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.04202718 = score(doc=2419,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.23214069 = fieldWeight in 2419, 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=2419)
0.5 = coord(1/2)
- Abstract
- The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.
- Date
- 16.11.2008 16:22:48
-
Dominich, S.: Mathematical foundations of information retrieval (2001)
0.04
0.040879704 = product of:
0.08175941 = sum of:
0.08175941 = sum of:
0.04673676 = weight(_text_:searching in 1753) [ClassicSimilarity], result of:
0.04673676 = score(doc=1753,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.22347288 = fieldWeight in 1753, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.035022654 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
0.035022654 = score(doc=1753,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.19345059 = fieldWeight in 1753, 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=1753)
0.5 = coord(1/2)
- Abstract
- This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.
- Date
- 22. 3.2008 12:26:32
-
Uratani, N.; Takeda, M.: ¬A fast string-searching algorithm for multiple patterns (1993)
0.04
0.03738941 = product of:
0.07477882 = sum of:
0.07477882 = product of:
0.14955764 = sum of:
0.14955764 = weight(_text_:searching in 6275) [ClassicSimilarity], result of:
0.14955764 = score(doc=6275,freq=8.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.7151132 = fieldWeight in 6275, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=6275)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The string-searching problem is to find all occurrences of pattern(s) in a text string. The Aho-Corasick string searching algorithm simultaneously finds all occurrences of multiple patterns in one pass through the text. The Boyer-Moore algorithm is the fastest algorithm for a single pattern. By combining the ideas of these two algorithms, presents an efficient string searching algorithm for multiple patterns. The algorithm runs in sublinear time, on the average, as the BM algorithm achieves, and its preprocessing time is linear proportional to the sum of the lengths of the patterns like the AC algorithm
-
Tenopir, C.: Online databases : natural language searching with WIN (1993)
0.04
0.03738941 = product of:
0.07477882 = sum of:
0.07477882 = product of:
0.14955764 = sum of:
0.14955764 = weight(_text_:searching in 7038) [ClassicSimilarity], result of:
0.14955764 = score(doc=7038,freq=8.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.7151132 = fieldWeight in 7038, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=7038)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- WESTLAW is one of the first major commercial online systems to embrace both natural language input and partial match searching. Provides a backgroud to WESTLAW. Explains how the WESTLAW Is Natural (WIN) search engine works. Some searchers find that when searching with commands and Boolean logic, results differ drastically from those produces by searching with WIN. Discusses exact match Boolean logic search engines
-
Willett, P.: Best-match text retrieval (1993)
0.03
0.03304788 = product of:
0.06609576 = sum of:
0.06609576 = product of:
0.13219152 = sum of:
0.13219152 = weight(_text_:searching in 7818) [ClassicSimilarity], result of:
0.13219152 = score(doc=7818,freq=4.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.6320768 = fieldWeight in 7818, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.078125 = fieldNorm(doc=7818)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Provides an introduction to the computational techniques that underlie best match searching retrieval systems. Discusses: problems of traditional Boolean systems; characteristics of best-match searching; automatic indexing; term conflation; matching of documents and queries (dealing with similarity measures, initial weights, relevance weights, and the matching algorithm); and describes operational best-match systems
-
Perry, R.; Willett, P.: ¬A revies of the use of inverted files for best match searching in information retrieval systems (1983)
0.03
0.03271573 = product of:
0.06543146 = sum of:
0.06543146 = product of:
0.13086292 = sum of:
0.13086292 = weight(_text_:searching in 2701) [ClassicSimilarity], result of:
0.13086292 = score(doc=2701,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.6257241 = fieldWeight in 2701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.109375 = fieldNorm(doc=2701)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Bovey, J.D.; Robertson, S.E.: ¬An algorithm for weighted searching on a Boolean system (1984)
0.03
0.03271573 = product of:
0.06543146 = sum of:
0.06543146 = product of:
0.13086292 = sum of:
0.13086292 = weight(_text_:searching in 788) [ClassicSimilarity], result of:
0.13086292 = score(doc=788,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.6257241 = fieldWeight in 788, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.109375 = fieldNorm(doc=788)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Boyer, R.; Moore, S.: ¬A fast string searching algorithm (1977)
0.03
0.03271573 = product of:
0.06543146 = sum of:
0.06543146 = product of:
0.13086292 = sum of:
0.13086292 = weight(_text_:searching in 3507) [ClassicSimilarity], result of:
0.13086292 = score(doc=3507,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.6257241 = fieldWeight in 3507, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.109375 = fieldNorm(doc=3507)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Jones, K.: Linguistic searching versus relevance ranking : DR-LINK and TARGET (1999)
0.03
0.03271573 = product of:
0.06543146 = sum of:
0.06543146 = product of:
0.13086292 = sum of:
0.13086292 = weight(_text_:searching in 6423) [ClassicSimilarity], result of:
0.13086292 = score(doc=6423,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.6257241 = fieldWeight in 6423, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.109375 = fieldNorm(doc=6423)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004)
0.03
0.028615793 = product of:
0.057231586 = sum of:
0.057231586 = sum of:
0.03271573 = weight(_text_:searching in 2509) [ClassicSimilarity], result of:
0.03271573 = score(doc=2509,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.15643102 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.024515856 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
0.024515856 = score(doc=2509,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.1354154 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.5 = coord(1/2)
- Content
- "Most Web search engines accept natural language queries, perform some kind of fuzzy matching and produce ranked output, displaying first the documents that are most likely to be relevant. On the other hand, most library online public access catalogs (OPACs) an the Web are still Boolean retrieval systems that perform exact matching, and require users to express their search requests precisely in a Boolean search language and to refine their search statements to improve the search results. It is well-documented that users have difficulty searching Boolean OPACs effectively (e.g. Borgman, 1996; Ensor, 1992; Wallace, 1993). One approach to making OPACs easier to use is to develop a natural language search interface that acts as a middleware between the user's Web browser and the OPAC system. The search interface can accept a natural language query from the user and reformulate it as a series of Boolean search statements that are then submitted to the OPAC. The records retrieved by the OPAC are ranked by the search interface before forwarding them to the user's Web browser. The user, then, does not need to interact directly with the Boolean OPAC but with the natural language search interface or search intermediary. The search interface interacts with the OPAC system an the user's behalf. The advantage of this approach is that no modification to the OPAC or library system is required. Furthermore, the search interface can access multiple OPACs, acting as a meta search engine, and integrate search results from various OPACs before sending them to the user. The search interface needs to incorporate a method for converting the user's natural language query into a series of Boolean search statements, and for ranking the OPAC records retrieved. The purpose of this study was to develop a relevancyranking algorithm for a search interface to Boolean OPAC systems. This is part of an on-going effort to develop a knowledge-based search interface to OPACs called the E-Referencer (Khoo et al., 1998, 1999; Poo et al., 2000). E-Referencer v. 2 that has been implemented applies a repertoire of initial search strategies and reformulation strategies to retrieve records from OPACs using the Z39.50 protocol, and also assists users in mapping query keywords to the Library of Congress subject headings."
- Source
- Electronic library. 22(2004) no.2, S.112-120
-
Belkin, N.J.; Cool, C.; Koenemann, J.; Ng, K.B.; Park, S.: Using relevance feedback and ranking in interactive searching (1996)
0.03
0.028042056 = product of:
0.05608411 = sum of:
0.05608411 = product of:
0.11216822 = sum of:
0.11216822 = weight(_text_:searching in 7588) [ClassicSimilarity], result of:
0.11216822 = score(doc=7588,freq=2.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.53633493 = fieldWeight in 7588, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.09375 = fieldNorm(doc=7588)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.03
0.02801812 = product of:
0.05603624 = sum of:
0.05603624 = product of:
0.11207248 = sum of:
0.11207248 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.11207248 = score(doc=402,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.61904186 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Al-Hawamdeh, S.; Smith, G.; Willett, P.; Vere, R. de: Using nearest-neighbour searching techniques to access full-text documents (1991)
0.03
0.026438305 = product of:
0.05287661 = sum of:
0.05287661 = product of:
0.10575322 = sum of:
0.10575322 = weight(_text_:searching in 2300) [ClassicSimilarity], result of:
0.10575322 = score(doc=2300,freq=4.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.5056614 = fieldWeight in 2300, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=2300)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Summarises the results to date of a continuing programme of research at Sheffield Univ. to investigate the use of nearest-neighbour retrieval algorithms for full text searching. Given a natural language query statement, the research methods result in a ranking of the paragraphs comprising a full text document in order of decreasing similarity with the query, where the similarity for each paragraph is determined by the number of keyword stems that it has in common with the query
-
Chang, R.: Keyword searching and indexing (1993)
0.03
0.026438305 = product of:
0.05287661 = sum of:
0.05287661 = product of:
0.10575322 = sum of:
0.10575322 = weight(_text_:searching in 7223) [ClassicSimilarity], result of:
0.10575322 = score(doc=7223,freq=4.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.5056614 = fieldWeight in 7223, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=7223)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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
-
O'Leary, M.: DIALOG TARGET's new age searching (1993)
0.03
0.026438305 = product of:
0.05287661 = sum of:
0.05287661 = product of:
0.10575322 = sum of:
0.10575322 = weight(_text_:searching in 7951) [ClassicSimilarity], result of:
0.10575322 = score(doc=7951,freq=4.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.5056614 = fieldWeight in 7951, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=7951)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Relevance search engines, which measure the occurrence of search terms in a group of retrieved records and rank them accordingly, often produce better results than refined Boolean searches. Relevance searching has emerged from the research stage to be on the verge of becoming the standard retrieval method. Describes and evaluates the operation of DIALOG's TARGET, a major accomplishment, despite some rough edges
-
Baeza-Yates, R.A.: String searching algorithms (1992)
0.03
0.026438305 = product of:
0.05287661 = sum of:
0.05287661 = product of:
0.10575322 = sum of:
0.10575322 = weight(_text_:searching in 3505) [ClassicSimilarity], result of:
0.10575322 = score(doc=3505,freq=4.0), product of:
0.2091384 = queryWeight, product of:
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.051699217 = queryNorm
0.5056614 = fieldWeight in 3505, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.0452914 = idf(docFreq=2103, maxDocs=44218)
0.0625 = fieldNorm(doc=3505)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Survey of several algorithms for searching a string in a text. Includes are theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is included
-
Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983)
0.02
0.024515856 = product of:
0.049031712 = sum of:
0.049031712 = product of:
0.098063424 = sum of:
0.098063424 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
0.098063424 = score(doc=2134,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.5416616 = fieldWeight in 2134, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=2134)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 30. 3.2001 13:32:22
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.02
0.024515856 = product of:
0.049031712 = sum of:
0.049031712 = product of:
0.098063424 = sum of:
0.098063424 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.098063424 = score(doc=3445,freq=2.0), product of:
0.18104185 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051699217 = queryNorm
0.5416616 = fieldWeight in 3445, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=3445)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 25. 8.2005 17:42:22
