Searching web documents using a summarization approach

Author:

Qumsiyeh Rani,Ng Yiu-Kai

Abstract

Purpose The purpose of this paper is to introduce a summarization method to enhance the current web-search approaches by offering a summary of each clustered set of web-search results with contents addressing the same topic, which should allow the user to quickly identify the information covered in the clustered search results. Web search engines, such as Google, Bing and Yahoo!, rank the set of documents S retrieved in response to a user query and represent each document D in S using a title and a snippet, which serves as an abstract of D. Snippets, however, are not as useful as they are designed for, i.e. assisting its users to quickly identify results of interest. These snippets are inadequate in providing distinct information and capture the main contents of the corresponding documents. Moreover, when the intended information need specified in a search query is ambiguous, it is very difficult, if not impossible, for a search engine to identify precisely the set of documents that satisfy the user’s intended request without requiring additional information. Furthermore, a document title is not always a good indicator of the content of the corresponding document either. Design/methodology/approach The authors propose to develop a query-based summarizer, called QSum, in solving the existing problems of Web search engines which use titles and abstracts in capturing the contents of retrieved documents. QSum generates a concise/comprehensive summary for each cluster of documents retrieved in response to a user query, which saves the user’s time and effort in searching for specific information of interest by skipping the step to browse through the retrieved documents one by one. Findings Experimental results show that QSum is effective and efficient in creating a high-quality summary for each cluster to enhance Web search. Originality/value The proposed query-based summarizer, QSum, is unique based on its searching approach. QSum is also a significant contribution to the Web search community, as it handles the ambiguous problem of a search query by creating summaries in response to different interpretations of the search which offer a “road map” to assist users to quickly identify information of interest.

Publisher

Emerald

Subject

Computer Networks and Communications,Information Systems

Reference22 articles.

1. Automatic text documents summarization through sentences clustering;Automation and Information Science,2008

2. Ranking systems: the pagerank axioms,2005

3. Incorporating prior knowledge into a transductive ranking algorithm for multi-document summarization,2009

4. Latent dirichlet allocation based multi-document summarization,2008

5. Machine-made index for technical literature - an experiment;IBM Journal of Research and Development (JRD,1958

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Text Summarization based on Feature Extraction using GloVe and B-GRU;2024 2nd International Conference on Sustainable Computing and Smart Systems (ICSCSS);2024-07-10

2. Language-Independent Text Tokenization Using Unsupervised Deep Learning;Intelligent Automation & Soft Computing;2023

3. A Dual Attention Encoder-Decoder Text Summarization Model;Computers, Materials & Continua;2023

4. Multi-layered network model for text summarization using feature representation;Soft Computing;2022-11-05

5. A Novel Optimized Language-Independent Text Summarization Technique;Computers, Materials & Continua;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3