Analytical study of Text Summarization Techniques

The method of reducing information from an original text document while maintaining the vital information is known as text summarizing. The amount of text data available has increased dramatically in recent years from a variety of sources. A large volume of text is an excellent source of information and knowledge of the source is essential for efficiently summarizing information that must be useful. Summarization facilitates the acquisition of vital and required information in a short period of time. Text summarization is required in a variety of domains, including news article summaries, email summaries and information summaries in the medical profession to track a patient's medical history for future treatment and so on. In summarization, there are two methods: extractive summarization and abstractive summarization. In this work, extractive summarization is used on the COVID-19 dataset. Different models and their results have been discussed.

Text summarization is referred to the process of rewriting a particular content into its brief version by understanding it. It is a serious need to obtain concise and relevant information from huge information. Automatic text summarization is fast-growing research area in natural language processing from last few years. It has improved from simple heuristics to neural network-based text summarization techniques. The extractive and abstractive text summarization generate the condensed text which saves time in reading the entire document. The abstractive approach is more complex as it needs natural language processing and neural network. Due to the availability of huge unsupervised data, traditional approach fails to provide accuracy in text summarization. The deep learning-based text summarization model gives a good performance as compared to the conventional techniques. In this paper, we have reviewed the recent work on text summarization based on deep learning techniques.

Manual Summarization of large bodies of text involves a lot of human effort and time, especially in the legal domain. Lawyers spend a lot of time preparing legal briefs of their clients' case files. Automatic Text summarization is a constantly evolving field of Natural Language Processing(NLP), which is a subdiscipline of the Artificial Intelligence Field. In this paper a hybrid method for automatic text summarization of legal cases using k-means clustering technique and tf-idf(term frequency-inverse document frequency) word vectorizer is proposed. The summary generated by the proposed method is compared using ROGUE evaluation parameters with the case summary as prepared by the lawyer for appeal in court. Further, suggestions for improving the proposed method are also presented.

Text summarization is a challenging task in the field of Natural Language Processing. In the case of lower resource language like Bengali is also a difficult task to make an automatic text summarization system. This paper is based on the extractive summarization of Bengali text. Text summarization deletes the less useful information in a piece of text or a paragraph and summarizes it into a confined text. This helps in finding the required text more effectively and quickly. There are many types of algorithms used for summarizing the text. Here in this paper, we have used TF-IDF and BERT-SUM technologies for the Bengali extractive text summarization.

This chapter discusses the concept of natural language processing (NLP), specifically how the NLP is applied. The chapter further outlines the typical functions of the NLP. In addition, it explores the NLP in strategy and strategy implementation.The NLP is a branch of computer science, AI and linguistics that focuses on the interaction between computer programs and human language. There are three functions of the NLP, namely, machine translation (MT), text summarisation and sentiment analysis (SA). MT is a branch of computer linguistics that analyses the use of computerised tools to translate the context derived from this, from one language to the next. The language that is being translated is the human language.Automatic text summarisation refers to a process of bringing about a succinct and meaningful summary of the text. SA is a way of finding out the polarity or strength of the opinion that is expressed in written text. The opinion could be either positive or negative. MT has three major approaches, namely, rule-based MT, statistical MT and neural MT. A rule-based system would typically require the expert to know both the source and the target languages. This knowledge is then used to develop syntactic, semantic and morphological rules to achieve the translation. The statistical approach uses statistical models based on the analysis of bilingual text corpora. The neural MT approach uses neural networks to achieve machine translation. There are two broad categories of text summarisation approaches, namely, extractive summarisation and abstractive summarisation. Furthermore, there are four popular types of SA, namely, the fine-grained SA, emotion detection, aspect-based SA and multilingual SA. The firm that deploys the NLP and ML in Big Data Analytics would gain crucial and better insights, setting the firm apart from its competitors.

In the past half century, automatic summarization has been a hot topic in the field of natural language processing, and it will be paid more and more attention to with the rapid development of the mobile network technology. Most of the automatic summarization research today is on extractive summarization, which mainly ranks the sentences according to their simple heuristic features such as the frequency of words they contain, their position in the text or paragraph and so on. Inspired by the great performance of LexRank, we manage to introduce LexRank to Chinese texts. In order to make up the deficiency of LexRank, spectral clustering is adopted to process the component analysis. All in all, we propose an approach of extractive summarization for Chinese text based on the combination of spectral clustering and LexRank, which is of high coverage and low redundancy. It is demonstrated by experiments that our approach has been greatly improved compared to the original LexRank. In addition, our approach is easy to implement and robust to noise.

In graph-based extractive text summarization techniques, the weight assigned to the edges of the graph is the crucial parameter for the sentence ranking. The weights associated with the edges are based on the similarity between sentences (nodes). Most of the graph-based techniques use the common words based similarity measure to assign the weight. In this paper, we propose a new graph-based summarization technique, which, besides taking into account the similarity among the individual sentences, also considers the similarity between the sentences and the overall (input) document. While assigning the weight among the edges of the graph, we consider two attributes. The first attribute is the similarity among the nodes, which forms the edges of the graph. The second attribute is the weight given to a component that represents how much the particular edge is similar to the topics of the overall document for which we incorporate the topic modeling. Along with these modifications, we use the semantic measure to find the similarity among the nodes. The evaluation results of the proposed method demonstrate a significant improvement of the summary quality over the existing text summarization techniques.

Identifying that the same meaning is expressed by, or can be inferred from, various language expressions is a major challenge for natural language understanding applications such as information extraction, question answering and automatic summarization. Dagan and Glickman [5] proposed Textual Entailment, the task of deciding whether a target text follows from a source text, as a unifying framework for modeling language variability, which has often been addressed in an application-specific manner. In this paper we describe the series of benchmarks developed for the textual entailment recognition task, known as the PASCAL RTE Challenges. As a concrete example, we describe in detail the second RTE challenge, in which our methodology was consolidated, and served as a basis for the subsequent RTE challenges. The impressive success of these challenges established textual entailment as an active research area in natural language processing, attracting a growing community of researchers.KeywordsQuestion AnsweringComputational LinguisticsInformation Extraction SystemTextual EntailmentEntailment SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Increased availability of the Internet and social media has created another ‘world of data’ comprised of text, audio and video files. It is very difficult for a user to get the accurate summary or to comprehend the relevant and important items from the available media. Additionally, readers or evaluators of these data files are interested only in the relevant content or summary to be retrieved in the less duration from the source files. Automatic text summarization (ATS) is the only way to summarize single or multiple documents to obtain relevant content from the source files. Available ATS systems generate bad summaries and take a lot of time and space for long documents due to inaccurate encoding. Therefore, in this work, we have introduced an approach for extractive text summarization using sentence ranking. Experiments have been performed over BBC and CNN news datasets and evaluated in terms of ROUGE using N-gram Language Model. The quantitative values of the metrics show the effectiveness of the proposed approach for news datasets.

Generating meaningful summary for the given natural language text is one of the challenging and popular task in present era. Researchers have come up with various techniques for the abstractive and extractive summarization. This experimental study is focused on the extractive summarization. In graph-based extractive text summarization techniques, the sentences of the input document are used as the nodes of the graph and various similarity measurements are used to weight the edges of the graph. Each node’s rating is determined using the graph ranking algorithms, and the top-ranked nodes (sentences) are then added to the output extractive summary. In this work, we first translate the publicly available dataset into Hindi text using the Google Translate service. Next, we apply a pre-trained multi-lingual transformer to generate embedding vectors of each sentence of the document. We use these embedding vectors as the nodes of the graph. Rest of the approach remains unchanged. At last, we evaluate the generated extractive summaries on the basis on ROUGE score. Evaluation results indicate that the use of pre-trained multi-lingual transformer can be effective to generate more meaningful extractive summaries.

Automatic text summarization is an emerging field of research in Natural Language Processing. This work is a novel attempt to include a low-resource language to the domain of Automatic Text Summarization. We use supervised machine learning algorithms to perform single document extractive automatic text summarization on documents in a low-resource language, Konkani. In particular, we propose using language independent features to train supervised machine learning algorithms using a Konkani dataset, specifically devised for the experimentation using books on Konkani folktale literature. We approach the automatic text summarization task as a binary classification problem, and the algorithms, once trained, classify the sentences based on their relevance to generate a summary. Thereafter, the performance of popular linear and non-linear supervised machine learning algorithms is evaluated using K-fold cross-validation. The summary generated by the systems is compared with human-generated summaries to verify its effectiveness. The results show that the linear models exhibit better performance in comparison with the non-linear models; however, all the models could beat the baselines. The output produced by the proposed methodology generates promising summaries without the need for any language-specific domain knowledge.

Graph theory and the fields of natural language processing and information retrieval are well-studied disciplines. Traditionally, these areas have been perceived as distinct, with different algorithms, different applications and different potential end-users. However, recent research has shown that these disciplines are intimately connected, with a large variety of natural language processing and information retrieval applications finding efficient solutions within graph-theoretical frameworks. This book extensively covers the use of graph-based algorithms for natural language processing and information retrieval. It brings together topics as diverse as lexical semantics, text summarization, text mining, ontology construction, text classification and information retrieval, which are connected by the common underlying theme of the use of graph-theoretical methods for text and information processing tasks. Readers will come away with a firm understanding of the major methods and applications in natural language processing and information retrieval that rely on graph-based representations and algorithms.

How to Improve Text Summarization and Classification by Mutual Cooperation on an Integrated Framework

Existence of large amount of textual information available on the internet emerged serious research in the area of machine generated summarization. Manual summarization of these online text documents is a very difficult task for human beings. So we need an automatic text summarizer. Automatic Text Summarization (ATS) is “condensing the source text into a shorter version, while preserving its information content and overall meaning”. Even though the work of automatic text summarization started in 1950's, still it is lacking to achieve more coherent and meaningful summaries. The proposed approach provides automatic feature based extractive heading wise text summarizer to improve the coherence thereby improving the understandability of the summary text. It summarizes the given input document using local scoring and local ranking that is it provides heading wise summary. Headings of a document give contextual information and permit visual scanning of the document to find the search contents. The proposed approach applies the same features to all document sentences. But it ranks the sentences heading wise and selects top n sentences from each heading where n depends upon compression ratio. The final heading wise summary produced by this approach is a collection of summary of individual headings. Since the heading wise summary contains the equal proportion of sentences from each heading, it reduces the coherent gap of the summary text. Also it improves the overall meaning and understanding of the summary text. The outcomes of the experiment clearly show that heading wise summarizer provides better precision, recall and f-measure over the main summarizer, Ms-word summarizer, free summarizer and Auto summarizer.

In this era of growing digital media, the volume of text data increases day by day from various sources and may contain entire documents, books, articles, etc. This amount of text is a source of information that may be insignificant, redundant, and sometimes may not carry any meaningful representation. Therefore, we require some techniques and tools that can automatically summarize the enormous amounts of text data and help us to decide whether they are useful or not. Text summarization is a process that generates a brief version of the document in the form of a meaningful summary. It can be classified into abstractive text summarization and extractive text summarization. Abstractive text summarization generates an abstract type of summary from the given document. In extractive text summarization, a summary is created from the given document that contains crucial sentences of the document. Many authors proposed various techniques for both types of text summarization. This paper presents a survey of extractive text summarization on graphical-based techniques. Specifically, it focuses on unsupervised and supervised techniques. This paper shows the recent works and advances on them and focuses on the strength and weaknesses of surveys of previous works in tabular form. At last, it concentrates on the evaluation measure techniques of summary.