Prediction of query difficulty for a generic search engine

Details Prediction of query difficulty for a generic search engine Prediction of query difficulty for a generic search engine

2008-07-29

2008-07-29

Pham, Khanh B. (Department: 2166)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

07406462

ABSTRACT:
A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.

REFERENCES:
patent: 6760720 (2004-07-01), De Bellis
patent: 2001/0002132 (2001-05-01), Lee et al.
patent: 2002/0152199 (2002-10-01), Teng et al.
patent: 2003/0014405 (2003-01-01), Shapiro et al.
patent: 2003/0028520 (2003-02-01), Alpha
patent: 2004/0049478 (2004-03-01), Jasper et al.
patent: 2004/0064447 (2004-04-01), Simske et al.
patent: 2004/0083084 (2004-04-01), West
patent: 2004/0260692 (2004-12-01), Brill et al.
patent: 2006/0031195 (2006-02-01), Patterson
G. Amati and C. Carpineto and G. Romano (2004) “Query difficulty, robustness and selective application of query expansion”, Proceedings of the 25th European Conference on Information Retrieval (ECIR 2004), Sunderland, Great Britain, pp. 127-137.
Cronen-Townsend, S., Zhou, Y. and Croft, W.B., “Predicting Query Performance,” Proceedings of SIGIR 2002, Tampere, Finland, Aug. 11-15, 2002, pp. 299-306.

Affiliated with

Also associated with

Rating

Prediction of query difficulty for a generic search engine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Prediction of query difficulty for a generic search engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prediction of query difficulty for a generic search engine will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2815638