Word deletion for searches

Details Word deletion for searches Word deletion for searches

2011-01-04

2011-01-04

Ali, Mohammad (Department: 2158)

Data processing: database and file management or data structures

Database and file access

Search engines

C707S765000, C707SE17063

Reexamination Certificate

active

07865495

ABSTRACT:
A searcher can be configured to improve search results through the use of intelligent word deletion. A search auto categorizer (SAC) operates on the original query and returns a list of leaf categories and a distribution of probabilities among the leaf categories. The original query is parsed into word pairs and each word pair is run through the search engine. The search results for each word pair are weighted by the leaf category probabilities. A word pair is selected from the results and one of the two words is deleted from the original query. The searcher can perform exhaustive deletion where multiple truncated queries are generated from the original query and the results list from one truncated query is returned as the results list. The searcher can build up a truncated query from the original query by iteratively appending a word selected from the original query to the truncated query.

REFERENCES:
patent: 5875446 (1999-02-01), Brown et al.
patent: 6101491 (2000-08-01), Woods
patent: 6233575 (2001-05-01), Agrawal et al.
patent: 6401084 (2002-06-01), Ortega et al.
patent: 6463433 (2002-10-01), Baclawski
patent: 6675159 (2004-01-01), Lin et al.
patent: 6678694 (2004-01-01), Zimmermann et al.
patent: 6728704 (2004-04-01), Mao et al.
patent: 6772170 (2004-08-01), Pennock et al.
patent: 6954750 (2005-10-01), Bradford
patent: 7024407 (2006-04-01), Bradford
patent: 7213023 (2007-05-01), Hadzikadic et al.
patent: 7359898 (2008-04-01), Acton et al.
patent: 7424469 (2008-09-01), Ratnaparkhi
patent: 7472113 (2008-12-01), Watson et al.
patent: 2003/0014405 (2003-01-01), Shapiro et al.
patent: 2005/0149499 (2005-07-01), Franz et al.
patent: 2005/0289168 (2005-12-01), Green et al.
patent: 2006/0136405 (2006-06-01), Ducatel et al.
patent: 2006/0253427 (2006-11-01), Wu et al.
patent: 2006/0259482 (2006-11-01), Altevogt et al.
patent: 2007/0016574 (2007-01-01), Carmel et al.
E. Kapetanios and P. Groenewoud, “Query Construction through Meaningful Suggestions of Terms”, 2002, Springer-Verlag.
Claudio Carpineto and Giovanni Romano, “Effective Reformulation of Boolean Queries with Concept Latices”, 1998. Proof of publication date scanned separately.
Susan Gauch et al, “An Expert System for Automatic Query Reformulation”, 1993.
Anagnostopoulos et al., “Sampling Search-Engine Results,”Proc. of the 14th Int. Conf. on the World Wide Web, held May 10-14, 2005 in Chiba Japan, pp. 245-256, downloaded from http://doi.acm.org/10.1145/1060745.1060784 on Sep. 1, 2005.
Broder et al., “Efficient Query Evaluation using a Two-Level Retrieval Process,”Proc. of 12th Int. Conf. on Information and Knowledge Management, held Nov. 3-8, 2003 in New Orleans, LA, pp. 426-434, downloaded from http://doi.acm.org/10.1145/956863.956944 on Sep. 1, 2005.
Cao et al., “Efficient Top-K Query Calculation in Distributed Networks,”Proc. of 23rd Annual Symp. on Principles of Distributed Computing, held Jul. 25-28 in St. John's Newfoundland, Canada, pp. 206-215, downloaded from http://doi.acm.org/10.1145/1011767.1011798 on Sep. 1, 2005.
Chu et al., “Optimizing Data Aggregation for Cluster-based Internet Services,”Proc. of 9th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, held Jun. 11-13, 2003 in San Diego, CA, pp. 119-130, downloaded from http://doi.acm.org/10.1145/781498.781517 on Sep. 1, 2005.
Fagin et al., “Optimal Aggregation Algorithms for Middleware,”PODS '01, held in Santa Barbara, CA (2001) available at http://citeseer.ist.psu.edu/fagin01optimal.html or http://www.wisdom.weizmann.ac.il/˜Enaor/PAPERS/middle—agg.ps.
Ilyas et al., “Rank-aware Query Optimization,”Proc. of 2004 ACM SIGMOD Int. Conf. on Management of Data, held Jun. 13-18, 2004 in Paris France, downloaded from http://doi.acm.org/10.1145/1007568.1007593 on Sep. 1, 2005.
Liu et al., “Personalized Web Search by Mapping User Queries to Categories,”Proc. of 11th Int. Conf. on Information and Knowledge Management, held Nov. 4-9, 2002 in McLean, VA, pp. 558-565, downloaded from http://doi.acm.org/10.1145/584792.584884 on Sep. 1, 2005.
Theobald et al., “Efficient and Self-tuning Incremental Query Expansion for Top-k Query Processing,”Proc. of 28th Annual Int. ACM SIGIR Conf. on Research and Development in Information Retrieval, heldAug. 15-19, 2005 in Salvador Brazil, pp. 242-249, downloaded from http://doi.acm.org/10.1145/1076034.1076077 on Sep. 1, 2005.
Jones et al., “Query Word Deletion Prediction,”Proc. of 26th Annual Int. ACM SIGIR Conf. on REsearch and Development in Information Retrieval, held Jul. 28, 2003 to Aug. 1, 2003 in Toronto, Canada, pp. 435-436, downloaded from http://doi.acm.org/10.1145/860435.860538 on Sep. 1, 2005.
Theobald et al., “Top-k Query Evaluation with Probabilistic Guarantees”, 2004, pp. 648-659, Proceedings of the 30th VLDB Conference, Toronto, Canada.

Affiliated with

Also associated with

Rating

Word deletion for searches does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Word deletion for searches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Word deletion for searches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2690393