-
Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983)
0.07
0.07163848 = product of:
0.14327696 = sum of:
0.096054144 = weight(_text_:26 in 2134) [ClassicSimilarity], result of:
0.096054144 = score(doc=2134,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.5462547 = fieldWeight in 2134, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.109375 = fieldNorm(doc=2134)
0.04722281 = product of:
0.09444562 = sum of:
0.09444562 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
0.09444562 = score(doc=2134,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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(2/4)
- Date
- 30. 3.2001 13:32:22
- Source
- Computer journal. 26(1983), S.239-246
-
Klas, C.-P.; Fuhr, N.; Schaefer, A.: Evaluating strategic support for information access in the DAFFODIL system (2004)
0.06
0.059781354 = product of:
0.11956271 = sum of:
0.04116606 = weight(_text_:26 in 2419) [ClassicSimilarity], result of:
0.04116606 = score(doc=2419,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.23410915 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.07839665 = sum of:
0.037919957 = weight(_text_:access in 2419) [ClassicSimilarity], result of:
0.037919957 = score(doc=2419,freq=2.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.22468945 = fieldWeight in 2419, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.046875 = fieldNorm(doc=2419)
0.040476695 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
0.040476695 = score(doc=2419,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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(2/4)
- Date
- 26. 5.1996 11:11:10
16.11.2008 16:22:48
-
Cross-language information retrieval (1998)
0.04
0.043540955 = product of:
0.058054607 = sum of:
0.029729806 = weight(_text_:description in 6299) [ClassicSimilarity], result of:
0.029729806 = score(doc=6299,freq=2.0), product of:
0.23150103 = queryWeight, product of:
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.04979191 = queryNorm
0.12842192 = fieldWeight in 6299, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.01953125 = fieldNorm(doc=6299)
0.017152525 = weight(_text_:26 in 6299) [ClassicSimilarity], result of:
0.017152525 = score(doc=6299,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.097545475 = fieldWeight in 6299, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.01953125 = fieldNorm(doc=6299)
0.011172275 = product of:
0.02234455 = sum of:
0.02234455 = weight(_text_:access in 6299) [ClassicSimilarity], result of:
0.02234455 = score(doc=6299,freq=4.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.13239953 = fieldWeight in 6299, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.01953125 = fieldNorm(doc=6299)
0.5 = coord(1/2)
0.75 = coord(3/4)
- Footnote
- Rez. in: Machine translation review: 1999, no.10, S.26-27 (D. Lewis): "Cross Language Information Retrieval (CLIR) addresses the growing need to access large volumes of data across language boundaries. The typical requirement is for the user to input a free form query, usually a brief description of a topic, into a search or retrieval engine which returns a list, in ranked order, of documents or web pages that are relevant to the topic. The search engine matches the terms in the query to indexed terms, usually keywords previously derived from the target documents. Unlike monolingual information retrieval, CLIR requires query terms in one language to be matched to indexed terms in another. Matching can be done by bilingual dictionary lookup, full machine translation, or by applying statistical methods. A query's success is measured in terms of recall (how many potentially relevant target documents are found) and precision (what proportion of documents found are relevant). Issues in CLIR are how to translate query terms into index terms, how to eliminate alternative translations (e.g. to decide that French 'traitement' in a query means 'treatment' and not 'salary'), and how to rank or weight translation alternatives that are retained (e.g. how to order the French terms 'aventure', 'business', 'affaire', and 'liaison' as relevant translations of English 'affair'). Grefenstette provides a lucid and useful overview of the field and the problems. The volume brings together a number of experiments and projects in CLIR. Mark Davies (New Mexico State University) describes Recuerdo, a Spanish retrieval engine which reduces translation ambiguities by scanning indexes for parallel texts; it also uses either a bilingual dictionary or direct equivalents from a parallel corpus in order to compare results for queries on parallel texts. Lisa Ballesteros and Bruce Croft (University of Massachusetts) use a 'local feedback' technique which automatically enhances a query by adding extra terms to it both before and after translation; such terms can be derived from documents known to be relevant to the query.
Christian Fluhr at al (DIST/SMTI, France) outline the EMIR (European Multilingual Information Retrieval) and ESPRIT projects. They found that using SYSTRAN to machine translate queries and to access material from various multilingual databases produced less relevant results than a method referred to as 'multilingual reformulation' (the mechanics of which are only hinted at). An interesting technique is Latent Semantic Indexing (LSI), described by Michael Littman et al (Brown University) and, most clearly, by David Evans et al (Carnegie Mellon University). LSI involves creating matrices of documents and the terms they contain and 'fitting' related documents into a reduced matrix space. This effectively allows queries to be mapped onto a common semantic representation of the documents. Eugenio Picchi and Carol Peters (Pisa) report on a procedure to create links between translation equivalents in an Italian-English parallel corpus. The links are used to construct parallel linguistic contexts in real-time for any term or combination of terms that is being searched for in either language. Their interest is primarily lexicographic but they plan to apply the same procedure to comparable corpora, i.e. to texts which are not translations of each other but which share the same domain. Kiyoshi Yamabana et al (NEC, Japan) address the issue of how to disambiguate between alternative translations of query terms. Their DMAX (double maximise) method looks at co-occurrence frequencies between both source language words and target language words in order to arrive at the most probable translation. The statistical data for the decision are derived, not from the translation texts but independently from monolingual corpora in each language. An interactive user interface allows the user to influence the selection of terms during the matching process. Denis Gachot et al (SYSTRAN) describe the SYSTRAN NLP browser, a prototype tool which collects parsing information derived from a text or corpus previously translated with SYSTRAN. The user enters queries into the browser in either a structured or free form and receives grammatical and lexical information about the source text and/or its translation.
-
Lalmas, M.: XML retrieval (2009)
0.04
0.04341299 = product of:
0.08682598 = sum of:
0.05945961 = weight(_text_:description in 4998) [ClassicSimilarity], result of:
0.05945961 = score(doc=4998,freq=2.0), product of:
0.23150103 = queryWeight, product of:
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.04979191 = queryNorm
0.25684384 = fieldWeight in 4998, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.0390625 = fieldNorm(doc=4998)
0.027366372 = product of:
0.054732744 = sum of:
0.054732744 = weight(_text_:access in 4998) [ClassicSimilarity], result of:
0.054732744 = score(doc=4998,freq=6.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.3243113 = fieldWeight in 4998, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.0390625 = fieldNorm(doc=4998)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Documents usually have a content and a structure. The content refers to the text of the document, whereas the structure refers to how a document is logically organized. An increasingly common way to encode the structure is through the use of a mark-up language. Nowadays, the most widely used mark-up language for representing structure is the eXtensible Mark-up Language (XML). XML can be used to provide a focused access to documents, i.e. returning XML elements, such as sections and paragraphs, instead of whole documents in response to a query. Such focused strategies are of particular benefit for information repositories containing long documents, or documents covering a wide variety of topics, where users are directed to the most relevant content within a document. The increased adoption of XML to represent a document structure requires the development of tools to effectively access documents marked-up in XML. This book provides a detailed description of query languages, indexing strategies, ranking algorithms, presentation scenarios developed to access XML documents. Major advances in XML retrieval were seen from 2002 as a result of INEX, the Initiative for Evaluation of XML Retrieval. INEX, also described in this book, provided test sets for evaluating XML retrieval effectiveness. Many of the developments and results described in this book were investigated within INEX.
-
Dominich, S.: Mathematical foundations of information retrieval (2001)
0.03
0.02558517 = product of:
0.05117034 = sum of:
0.03430505 = weight(_text_:26 in 1753) [ClassicSimilarity], result of:
0.03430505 = score(doc=1753,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.19509095 = fieldWeight in 1753, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0390625 = fieldNorm(doc=1753)
0.01686529 = product of:
0.03373058 = sum of:
0.03373058 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
0.03373058 = score(doc=1753,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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)
0.5 = coord(2/4)
- Date
- 22. 3.2008 12:26:32
-
Ciocca, G.; Schettini, R.: ¬A relevance feedback mechanism for content-based image retrieval (1999)
0.02
0.024013536 = product of:
0.096054144 = sum of:
0.096054144 = weight(_text_:26 in 6498) [ClassicSimilarity], result of:
0.096054144 = score(doc=6498,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.5462547 = fieldWeight in 6498, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.109375 = fieldNorm(doc=6498)
0.25 = coord(1/4)
- Date
- 27. 8.2005 13:26:48
-
Ziegler, B.: ESS: ein schneller Algorithmus zur Mustersuche in Zeichenfolgen (1996)
0.02
0.024013536 = product of:
0.096054144 = sum of:
0.096054144 = weight(_text_:26 in 7543) [ClassicSimilarity], result of:
0.096054144 = score(doc=7543,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.5462547 = fieldWeight in 7543, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.109375 = fieldNorm(doc=7543)
0.25 = coord(1/4)
- Date
- 26. 5.1997 21:19:14
-
Lalmas, M.; Ruthven, I.: Representing and retrieving structured documents using the Dempster-Shafer theory of evidence : modelling and evaluation (1998)
0.02
0.020810865 = product of:
0.08324346 = sum of:
0.08324346 = weight(_text_:description in 1076) [ClassicSimilarity], result of:
0.08324346 = score(doc=1076,freq=2.0), product of:
0.23150103 = queryWeight, product of:
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.04979191 = queryNorm
0.35958138 = fieldWeight in 1076, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.0546875 = fieldNorm(doc=1076)
0.25 = coord(1/4)
- Abstract
- Reports on a theoretical model of structured document indexing and retrieval based on the Dempster-Schafer Theory of Evidence. Includes a description of the model of structured document retrieval, the representation of structured documents, the representation of individual components, how components are combined, details of the combination process, and how relevance is captured within the model. Also presents a detailed account of an implementation of the model, and an evaluation scheme designed to test the effectiveness of the model
-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.02
0.019599162 = product of:
0.07839665 = sum of:
0.07839665 = sum of:
0.037919957 = weight(_text_:access in 5123) [ClassicSimilarity], result of:
0.037919957 = score(doc=5123,freq=2.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.22468945 = fieldWeight in 5123, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.040476695 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.040476695 = score(doc=5123,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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.25 = coord(1/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
-
Ruthven, I.; Lalmas, M.: Selective relevance feedback using term characteristics (1999)
0.02
0.017152525 = product of:
0.0686101 = sum of:
0.0686101 = weight(_text_:26 in 3824) [ClassicSimilarity], result of:
0.0686101 = score(doc=3824,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.3901819 = fieldWeight in 3824, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.078125 = fieldNorm(doc=3824)
0.25 = coord(1/4)
- Source
- Vocabulary as a central concept in digital libraries: interdisciplinary concepts, challenges, and opportunities : proceedings of the Third International Conference an Conceptions of Library and Information Science (COLIS3), Dubrovnik, Croatia, 23-26 May 1999. Ed. by T. Arpanac et al
-
Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004)
0.02
0.015481083 = product of:
0.06192433 = sum of:
0.06192433 = sum of:
0.038312923 = weight(_text_:access in 2509) [ClassicSimilarity], result of:
0.038312923 = score(doc=2509,freq=6.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.22701791 = fieldWeight in 2509, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.023611406 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
0.023611406 = score(doc=2509,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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.25 = coord(1/4)
- Abstract
- A relevancy-ranking algorithm for a natural language interface to Boolean online public access catalogs (OPACs) was formulated and compared with that currently used in a knowledge-based search interface called the E-Referencer, being developed by the authors. The algorithm makes use of seven weIl-known ranking criteria: breadth of match, section weighting, proximity of query words, variant word forms (stemming), document frequency, term frequency and document length. The algorithm converts a natural language query into a series of increasingly broader Boolean search statements. In a small experiment with ten subjects in which the algorithm was simulated by hand, the algorithm obtained good results with a mean overall precision of 0.42 and mean average precision of 0.62, representing a 27 percent improvement in precision and 41 percent improvement in average precision compared to the E-Referencer. The usefulness of each step in the algorithm was analyzed and suggestions are made for improving the algorithm.
- 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
-
Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014)
0.01
0.014864903 = product of:
0.05945961 = sum of:
0.05945961 = weight(_text_:description in 1338) [ClassicSimilarity], result of:
0.05945961 = score(doc=1338,freq=2.0), product of:
0.23150103 = queryWeight, product of:
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.04979191 = queryNorm
0.25684384 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.64937 = idf(docFreq=1149, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.25 = coord(1/4)
- Abstract
- A user's query is considered to be an imprecise description of their information need. Automatic query expansion is the process of reformulating the original query with the goal of improving retrieval effectiveness. Many successful query expansion techniques model syntagmatic associations that infer two terms co-occur more often than by chance in natural language. However, structural linguistics relies on both syntagmatic and paradigmatic associations to deduce the meaning of a word. Given the success of dependency-based approaches to query expansion and the reliance on word meanings in the query formulation process, we argue that modeling both syntagmatic and paradigmatic information in the query expansion process improves retrieval effectiveness. This article develops and evaluates a new query expansion technique that is based on a formal, corpus-based model of word meaning that models syntagmatic and paradigmatic associations. We demonstrate that when sufficient statistical information exists, as in the case of longer queries, including paradigmatic information alone provides significant improvements in retrieval effectiveness across a wide variety of data sets. More generally, when our new query expansion approach is applied to large-scale web retrieval it demonstrates significant improvements in retrieval effectiveness over a strong baseline system, based on a commercial search engine.
-
Gonnet, G.H.; Snider, T.; Baeza-Yates, R.A.: New indices for text : PAT trees and PAT arrays (1992)
0.01
0.01372202 = product of:
0.05488808 = sum of:
0.05488808 = weight(_text_:26 in 3500) [ClassicSimilarity], result of:
0.05488808 = score(doc=3500,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.31214553 = fieldWeight in 3500, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0625 = fieldNorm(doc=3500)
0.25 = coord(1/4)
- Date
- 7. 5.1999 15:26:04
-
Baeza-Yates, R.A.: String searching algorithms (1992)
0.01
0.01372202 = product of:
0.05488808 = sum of:
0.05488808 = weight(_text_:26 in 3505) [ClassicSimilarity], result of:
0.05488808 = score(doc=3505,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.31214553 = fieldWeight in 3505, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0625 = fieldNorm(doc=3505)
0.25 = coord(1/4)
- Date
- 7. 5.1999 15:53:26
-
Wilbur, W.J.: ¬A retrieval system based on automatic relevance weighting of search terms (1992)
0.01
0.01372202 = product of:
0.05488808 = sum of:
0.05488808 = weight(_text_:26 in 5269) [ClassicSimilarity], result of:
0.05488808 = score(doc=5269,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.31214553 = fieldWeight in 5269, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0625 = fieldNorm(doc=5269)
0.25 = coord(1/4)
- Source
- Proceedings of the 55th Annual Meeting of the American Society for Information Science, Pittsburgh, 26.-29.10.92. Ed.: D. Shaw
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.01
0.013492232 = product of:
0.05396893 = sum of:
0.05396893 = product of:
0.10793786 = sum of:
0.10793786 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.10793786 = score(doc=402,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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.25 = coord(1/4)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Chang, R.: ¬The development of indexing technology (1993)
0.01
0.012639986 = product of:
0.050559945 = sum of:
0.050559945 = product of:
0.10111989 = sum of:
0.10111989 = weight(_text_:access in 7024) [ClassicSimilarity], result of:
0.10111989 = score(doc=7024,freq=8.0), product of:
0.16876608 = queryWeight, product of:
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.04979191 = queryNorm
0.5991719 = fieldWeight in 7024, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.389428 = idf(docFreq=4053, maxDocs=44218)
0.0625 = fieldNorm(doc=7024)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Reviews the basic techniques of computerized indexing, including various file accessing methods such as: Sequential Access Method (SAM); Direct Access Method (DAM); Indexed Sequential Access Method (ISAM), and Virtual Indexed Sequential Access Method (VSAM); and various B-tree (balanced tree)structures. Illustrates how records are stored and accessed, and how B-trees are used to for improving the operations of information retrieval and maintenance
-
Lavrenko, V.: ¬A generative theory of relevance (2009)
0.01
0.012128668 = product of:
0.04851467 = sum of:
0.04851467 = weight(_text_:26 in 3306) [ClassicSimilarity], result of:
0.04851467 = score(doc=3306,freq=4.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.2759003 = fieldWeight in 3306, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0390625 = fieldNorm(doc=3306)
0.25 = coord(1/4)
- Date
- 26. 7.2000 20:00:49
- Series
- The information retrieval series ; 26
-
Brenner, E.H.: Beyond Boolean : new approaches in information retrieval; the quest for intuitive online search systems past, present & future (1995)
0.01
0.012006768 = product of:
0.048027072 = sum of:
0.048027072 = weight(_text_:26 in 2547) [ClassicSimilarity], result of:
0.048027072 = score(doc=2547,freq=2.0), product of:
0.17584132 = queryWeight, product of:
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.04979191 = queryNorm
0.27312735 = fieldWeight in 2547, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5315237 = idf(docFreq=3516, maxDocs=44218)
0.0546875 = fieldNorm(doc=2547)
0.25 = coord(1/4)
- Date
- 22.10.2006 18:20:26
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.01
0.011805703 = product of:
0.04722281 = sum of:
0.04722281 = product of:
0.09444562 = sum of:
0.09444562 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.09444562 = score(doc=3445,freq=2.0), product of:
0.17436278 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04979191 = 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.25 = coord(1/4)
- Date
- 25. 8.2005 17:42:22
