OPTIMAL APPROACH FOR TEXT SUMMARIZATION

ABSTRACT Large amount of unstructured information is available on the internet. Retrieving relevant documents containing the required information is difficult, because of huge amount of data. The query-specific document summarization has become an important problem. It is difficult task for the user to go through all these documents, as the number of documents available on particular topic will be more Evaluation of algorithms will be performing on the basis of parameters like precision, recall, time, space complexity, and quality of summary. After evaluating these algorithms suggest better algorithm for summarization. So it will help to find the better query dependent clustering algorithm for text document summarization