By Topic

Tolerant Retrieval and Query Processing in Search Engine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kai Gao ; Sch. of Inf. Sci. & Eng., Hebei Univ. of Sci. & Technol., Shijiazhuang ; Yong-jun Miao

Tolerant retrieval and query processing in search engine can enhance the robustness and users feel convenient. Based on the similar comparison between the right terms and terms proposed by users, the proposed approach can not only tolerant misspelling, but also present relevant retrieval advice. If more than two correctly spelled terms are nearly tied, it can also select the one that is more common. The proposed algorithms are useful in the case when user may not know how a proper term is spelled. Experimental results and the analysis show the feasible of the approach, and existing problems and further works are also present in the end.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:4 )

Date of Conference:

12-14 Dec. 2008