Query Segmentation for Web Search
Knut Magne Risvik, Tomasz Mikolajewski, Péter Boros · 2003
This paper describes a query segmentation method for search en-gines supporting inverse lookup of words and phrases. Data min-ing in query logs and document corpora is used to produce segment candidates and compute connexity measures. Candidates are con-sidered in context of the whole query, and a list of the most likely segmentations is generated, with each segment attributed with a connexity value. For each segmentation a segmentation score is computed from connexity values of non-trivial segments, which can be used as a sorting criterion for the segmentations. We also point to a relevancy improvement in query evaluation model by means of proximity penalty. Keywords web search, query processing, data mining, query segmentation, query evaluation 1.