-
Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014)
0.02
0.02476748 = product of:
0.07430244 = sum of:
0.04816959 = weight(_text_:wide in 1338) [ClassicSimilarity], result of:
0.04816959 = score(doc=1338,freq=2.0), product of:
0.19679762 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.044416238 = queryNorm
0.24476713 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.026132854 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
0.026132854 = score(doc=1338,freq=2.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.18028519 = fieldWeight in 1338, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1338)
0.33333334 = coord(2/6)
- 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.
-
Frakes, W.B.: Stemming algorithms (1992)
0.01
0.010994123 = product of:
0.065964736 = sum of:
0.065964736 = product of:
0.13192947 = sum of:
0.13192947 = weight(_text_:programs in 3503) [ClassicSimilarity], result of:
0.13192947 = score(doc=3503,freq=2.0), product of:
0.25748047 = queryWeight, product of:
5.79699 = idf(docFreq=364, maxDocs=44218)
0.044416238 = queryNorm
0.5123863 = fieldWeight in 3503, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.79699 = idf(docFreq=364, maxDocs=44218)
0.0625 = fieldNorm(doc=3503)
0.5 = coord(1/2)
0.16666667 = coord(1/6)
- Abstract
- Desribes stemming algorithms - programs that relate morphologically similar indexing and search terms. Stemming is used to improve retrieval effectiveness and to reduce the size of indexing files. Several approaches to stemming are describes - table lookup, affix removal, successor variety, and n-gram. empirical studies of stemming are summarized. The Porter stemmer is described in detail, and a full implementation in C is presented
-
Radev, D.; Fan, W.; Qu, H.; Wu, H.; Grewal, A.: Probabilistic question answering on the Web (2005)
0.01
0.009052687 = product of:
0.054316122 = sum of:
0.054316122 = weight(_text_:web in 3455) [ClassicSimilarity], result of:
0.054316122 = score(doc=3455,freq=6.0), product of:
0.14495286 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.044416238 = queryNorm
0.37471575 = fieldWeight in 3455, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=3455)
0.16666667 = coord(1/6)
- Abstract
- Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that augments existing search engines so that they support natural language question answering. The process entails five steps: query modulation, document retrieval, passage extraction, phrase extraction, and answer ranking. In this article, we describe some probabilistic approaches to the last three of these stages. We show how our techniques apply to a number of existing search engines, and we also present results contrasting three different methods for question answering. Our algorithm, probabilistic phrase reranking (PPR), uses proximity and question type features and achieves a total reciprocal document rank of .20 an the TREC8 corpus. Our techniques have been implemented as a Web-accessible system, called NSIR.
-
Hoenkamp, E.; Bruza, P.D.; Song, D.; Huang, Q.: ¬An effective approach to verbose queries using a limited dependencies language model (2009)
0.00
0.0043693185 = product of:
0.02621591 = sum of:
0.02621591 = weight(_text_:computer in 2122) [ClassicSimilarity], result of:
0.02621591 = score(doc=2122,freq=2.0), product of:
0.16231956 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.044416238 = queryNorm
0.16150802 = fieldWeight in 2122, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.03125 = fieldNorm(doc=2122)
0.16666667 = coord(1/6)
- Series
- Lecture notes in computer science : advances in information retrieval theory; 5766
