-
Robertson, S.E.; Walker, S.; Hancock-Beaulieu, M.M.: Large test collection experiments of an operational, interactive system : OKAPI at TREC (1995)
0.16
0.16244806 = product of:
0.21659742 = sum of:
0.011652809 = product of:
0.046611235 = sum of:
0.046611235 = weight(_text_:based in 6964) [ClassicSimilarity], result of:
0.046611235 = score(doc=6964,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.3295462 = fieldWeight in 6964, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0546875 = fieldNorm(doc=6964)
0.25 = coord(1/4)
0.079044946 = weight(_text_:term in 6964) [ClassicSimilarity], result of:
0.079044946 = score(doc=6964,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.36086982 = fieldWeight in 6964, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0546875 = fieldNorm(doc=6964)
0.12589967 = weight(_text_:frequency in 6964) [ClassicSimilarity], result of:
0.12589967 = score(doc=6964,freq=2.0), product of:
0.27643865 = queryWeight, product of:
5.888745 = idf(docFreq=332, maxDocs=44218)
0.04694356 = queryNorm
0.45543438 = fieldWeight in 6964, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.888745 = idf(docFreq=332, maxDocs=44218)
0.0546875 = fieldNorm(doc=6964)
0.75 = coord(3/4)
- Abstract
- The Okapi system has been used in a series of experiments on the TREC collections, investiganting probabilistic methods, relevance feedback, and query expansion, and interaction issues. Some new probabilistic models have been developed, resulting in simple weigthing functions that take account of document length and within document and within query term frequency. All have been shown to be beneficial when based on large quantities of relevance data as in the routing task. Interaction issues are much more difficult to evaluate in the TREC framework, and no benefits have yet been demonstrated from feedback based on small numbers of 'relevant' items identified by intermediary searchers
-
Robertson, S.E.: On term selection for query expansion (1990)
0.04
0.039117105 = product of:
0.15646842 = sum of:
0.15646842 = weight(_text_:term in 2650) [ClassicSimilarity], result of:
0.15646842 = score(doc=2650,freq=6.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.71433705 = fieldWeight in 2650, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0625 = fieldNorm(doc=2650)
0.25 = coord(1/4)
- Abstract
- In the framework of a relevance feedback system, term values or term weights may be used to (a) select new terms for inclusion in a query, and/or (b) weight the terms for retrieval purposes once selected. It has sometimes been assumed that the same weighting formula should be used for both purposes. This paper sketches a quantitative argument which suggests that the two purposes require different weighting formulae
-
Robertson, S.E.: OKAPI at TREC-1 (1994)
0.03
0.028230337 = product of:
0.11292135 = sum of:
0.11292135 = weight(_text_:term in 7953) [ClassicSimilarity], result of:
0.11292135 = score(doc=7953,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.5155283 = fieldWeight in 7953, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.078125 = fieldNorm(doc=7953)
0.25 = coord(1/4)
- Abstract
- Describes the work carried out on the TREC-2 project following the results of the TREC-1 project. Experiments were conducted on the OKAPI experimental text information retrieval system which investigated a number of alternative probabilistic term weighting functions in place of the 'standard' Robertson Sparck Jones weighting functions used in TREC-1
-
Robertson, S.E.; Sparck Jones, K.: Simple, proven approaches to text retrieval (1997)
0.03
0.028230337 = product of:
0.11292135 = sum of:
0.11292135 = weight(_text_:term in 4532) [ClassicSimilarity], result of:
0.11292135 = score(doc=4532,freq=8.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.5155283 = fieldWeight in 4532, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=4532)
0.25 = coord(1/4)
- Abstract
- This technical note describes straightforward techniques for document indexing and retrieval that have been solidly established through extensive testing and are easy to apply. They are useful for many different types of text material, are viable for very large files, and have the advantage that they do not require special skills or training for searching, but are easy for end users. The document and text retrieval methods described here have a sound theoretical basis, are well established by extensive testing, and the ideas involved are now implemented in some commercial retrieval systems. Testing in the last few years has, in particular, shown that the methods presented here work very well with full texts, not only title and abstracts, and with large files of texts containing three quarters of a million documents. These tests, the TREC Tests (see Harman 1993 - 1997; IP&M 1995), have been rigorous comparative evaluations involving many different approaches to information retrieval. These techniques depend an the use of simple terms for indexing both request and document texts; an term weighting exploiting statistical information about term occurrences; an scoring for request-document matching, using these weights, to obtain a ranked search output; and an relevance feedback to modify request weights or term sets in iterative searching. The normal implementation is via an inverted file organisation using a term list with linked document identifiers, plus counting data, and pointers to the actual texts. The user's request can be a word list, phrases, sentences or extended text.
-
Hancock-Beaulieu, M.; Robertson, S.E.; Neilson, C.: Evaluation of online catalogues : an assessment of methods (1990)
0.03
0.027666723 = product of:
0.11066689 = sum of:
0.11066689 = product of:
0.22133379 = sum of:
0.22133379 = weight(_text_:assessment in 5262) [ClassicSimilarity], result of:
0.22133379 = score(doc=5262,freq=2.0), product of:
0.25917634 = queryWeight, product of:
5.52102 = idf(docFreq=480, maxDocs=44218)
0.04694356 = queryNorm
0.8539892 = fieldWeight in 5262, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.52102 = idf(docFreq=480, maxDocs=44218)
0.109375 = fieldNorm(doc=5262)
0.5 = coord(1/2)
0.25 = coord(1/4)
-
MacFarlane, A.; McCann, J.A.; Robertson, S.E.: Parallel methods for the update of partitioned inverted files (2007)
0.02
0.019961866 = product of:
0.07984746 = sum of:
0.07984746 = weight(_text_:term in 819) [ClassicSimilarity], result of:
0.07984746 = score(doc=819,freq=4.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.3645336 = fieldWeight in 819, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0390625 = fieldNorm(doc=819)
0.25 = coord(1/4)
- Abstract
- Purpose - An issue that tends to be ignored in information retrieval is the issue of updating inverted files. This is largely because inverted files were devised to provide fast query service, and much work has been done with the emphasis strongly on queries. This paper aims to study the effect of using parallel methods for the update of inverted files in order to reduce costs, by looking at two types of partitioning for inverted files: document identifier and term identifier. Design/methodology/approach - Raw update service and update with query service are studied with these partitioning schemes using an incremental update strategy. The paper uses standard measures used in parallel computing such as speedup to examine the computing results and also the costs of reorganising indexes while servicing transactions. Findings - Empirical results show that for both transaction processing and index reorganisation the document identifier method is superior. However, there is evidence that the term identifier partitioning method could be useful in a concurrent transaction processing context. Practical implications - There is an increasing need to service updates, which is now becoming a requirement of inverted files (for dynamic collections such as the web), demonstrating that a shift in requirements of inverted file maintenance is needed from the past. Originality/value - The paper is of value to database administrators who manage large-scale and dynamic text collections, and who need to use parallel computing to implement their text retrieval services.
-
Robertson, S.E.: OKAPI at TREC-3 (1995)
0.02
0.019761236 = product of:
0.079044946 = sum of:
0.079044946 = weight(_text_:term in 5694) [ClassicSimilarity], result of:
0.079044946 = score(doc=5694,freq=2.0), product of:
0.21904005 = queryWeight, product of:
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.04694356 = queryNorm
0.36086982 = fieldWeight in 5694, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.66603 = idf(docFreq=1130, maxDocs=44218)
0.0546875 = fieldNorm(doc=5694)
0.25 = coord(1/4)
- Abstract
- Reports text information retrieval experiments performed as part of the 3 rd round of Text Retrieval Conferences (TREC) using the Okapi online catalogue system at City University, UK. The emphasis in TREC-3 was: further refinement of term weighting functions; an investigation of run time passage determination and searching; expansion of ad hoc queries by terms extracted from the top documents retrieved by a trial search; new methods for choosing query expansion terms after relevance feedback, now split into methods of ranking terms prior to selection and subsequent selection procedures; and the development of a user interface procedure within the new TREC interactive search framework
-
MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004)
0.01
0.006360204 = product of:
0.025440816 = sum of:
0.025440816 = product of:
0.05088163 = sum of:
0.05088163 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
0.05088163 = score(doc=5108,freq=2.0), product of:
0.16438834 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04694356 = queryNorm
0.30952093 = fieldWeight in 5108, 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=5108)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 20. 1.2007 18:30:22
-
Huang, X.; Robertson, S.E.: Application of probilistic methods to Chinese text retrieval (1997)
0.00
0.0029132022 = product of:
0.011652809 = sum of:
0.011652809 = product of:
0.046611235 = sum of:
0.046611235 = weight(_text_:based in 4706) [ClassicSimilarity], result of:
0.046611235 = score(doc=4706,freq=4.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.3295462 = fieldWeight in 4706, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0546875 = fieldNorm(doc=4706)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- Discusses the use of text retrieval methods based on the probabilistic model with Chinese language material. Since Chinese text has no natural word boundaries, either a dictionary based word segmentation method must be applied to the text, or indexing and searching must be done in terms of single Chinese characters. In either case, it becomes important to have a good way of dealing with phrases or contoguous strings of characters; the probabilistic model does not at present have such a facility. Proposes some ad hoc modifications of the probabilistic weighting function and matching method for this purpose
-
Vechtomova, O.; Karamuftuoglum, M.; Robertson, S.E.: On document relevance and lexical cohesion between query terms (2006)
0.00
0.0017656671 = product of:
0.0070626684 = sum of:
0.0070626684 = product of:
0.028250674 = sum of:
0.028250674 = weight(_text_:based in 987) [ClassicSimilarity], result of:
0.028250674 = score(doc=987,freq=2.0), product of:
0.14144066 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.04694356 = queryNorm
0.19973516 = fieldWeight in 987, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.046875 = fieldNorm(doc=987)
0.25 = coord(1/4)
0.25 = coord(1/4)
- Abstract
- Lexical cohesion is a property of text, achieved through lexical-semantic relations between words in text. Most information retrieval systems make use of lexical relations in text only to a limited extent. In this paper we empirically investigate whether the degree of lexical cohesion between the contexts of query terms' occurrences in a document is related to its relevance to the query. Lexical cohesion between distinct query terms in a document is estimated on the basis of the lexical-semantic relations (repetition, synonymy, hyponymy and sibling) that exist between there collocates - words that co-occur with them in the same windows of text. Experiments suggest significant differences between the lexical cohesion in relevant and non-relevant document sets exist. A document ranking method based on lexical cohesion shows some performance improvements.
