Search (2 results, page 1 of 1)
-
×
author_ss:"Robertson, A.M."
-
×
theme_ss:"Semantisches Umfeld in Indexierung u. Retrieval"
-
×
year_i:[1990 TO 2000}
- Did you mean:
- themes%3a%22Klassifikationssysteme im online-retrieval%22 2
-
Ekmekcioglu, F.C.; Robertson, A.M.; Willett, P.: Effectiveness of query expansion in ranked-output document retrieval systems (1992)
0.01
0.009170066 = product of: 0.027510196 = sum of: 0.027510196 = product of: 0.08253059 = sum of: 0.08253059 = weight(_text_:retrieval in 5689) [ClassicSimilarity], result of: 0.08253059 = score(doc=5689,freq=8.0), product of: 0.15433937 = queryWeight, product of: 3.024915 = idf(docFreq=5836, maxDocs=44218) 0.051022716 = queryNorm 0.5347345 = fieldWeight in 5689, product of: 2.828427 = tf(freq=8.0), with freq of: 8.0 = termFreq=8.0 3.024915 = idf(docFreq=5836, maxDocs=44218) 0.0625 = fieldNorm(doc=5689) 0.33333334 = coord(1/3) 0.33333334 = coord(1/3)
- Abstract
- Reports an evaluation of 3 methods for the expansion of natural language queries in ranked output retrieval systems. The methods are based on term co-occurrence data, on Soundex codes, and on a string similarity measure. Searches for 110 queries in a data base of 26.280 titles and abstracts suggest that there is no significant difference in retrieval effectiveness between any of these methods and unexpanded searches
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval
-
Robertson, A.M.; Willett, P.: Applications of n-grams in textual information systems (1998)
0.01
0.0064842156 = product of: 0.019452646 = sum of: 0.019452646 = product of: 0.058357935 = sum of: 0.058357935 = weight(_text_:retrieval in 4715) [ClassicSimilarity], result of: 0.058357935 = score(doc=4715,freq=4.0), product of: 0.15433937 = queryWeight, product of: 3.024915 = idf(docFreq=5836, maxDocs=44218) 0.051022716 = queryNorm 0.37811437 = fieldWeight in 4715, product of: 2.0 = tf(freq=4.0), with freq of: 4.0 = termFreq=4.0 3.024915 = idf(docFreq=5836, maxDocs=44218) 0.0625 = fieldNorm(doc=4715) 0.33333334 = coord(1/3) 0.33333334 = coord(1/3)
- Abstract
- Provides an introduction to the use of n-grams in textual information systems, where an n-gram is a string of n, usually adjacent, characters, extracted from a section of continuous text. Applications that can be implemented efficiently and effectively using sets of n-grams include spelling errors detection and correction, query expansion, information retrieval with serial, inverted and signature files, dictionary look up, text compression, and language identification
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval