Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016)
0.00
0.0025760243 = product of:
0.010304097 = sum of:
0.010304097 = weight(_text_:information in 3188) [ClassicSimilarity], result of:
0.010304097 = score(doc=3188,freq=6.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.16796975 = fieldWeight in 3188, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=3188)
0.25 = coord(1/4)
- Abstract
- Across the world, millions of users interact with search engines every day to satisfy their information needs. As the Web grows bigger over time, such information needs, manifested through user search queries, also become more complex. However, there has been no systematic study that quantifies the structural complexity of Web search queries. In this research, we make an attempt towards understanding and characterizing the syntactic complexity of search queries using a multi-pronged approach. We use traditional statistical language modeling techniques to quantify and compare the perplexity of queries with natural language (NL). We then use complex network analysis for a comparative analysis of the topological properties of queries issued by real Web users and those generated by statistical models. Finally, we conduct experiments to study whether search engine users are able to identify real queries, when presented along with model-generated ones. The three complementary studies show that the syntactic structure of Web queries is more complex than what n-grams can capture, but simpler than NL. Queries, thus, seem to represent an intermediate stage between syntactic and non-syntactic communication.
- Source
- Information processing and management. 52(2016) no.5, S.923-948
