Extractive Summarization Technique Research Articles

Extractive Arabic Text Summarization Using PageRank and Word Embedding

Research on graph-based automatic text summarization for Arabic, the official language of 26 nations with over 200 million speakers, as well as other prevalent languages, has recently increased due to the ability of these approaches to handle linguistic peculiarities such as complex morphological linkages. The present paper proposes a graph-based extractive Arabic text summarization (GEATS) technique that employs word embedding and PageRank algorithms for feature extraction and sentence ordering. The efficiency of the GEATS approach versus the state-of-the-art methods is analyzed based on the quality of the produced summaries over the F-measure values. The findings indicated that it outperformed the nearest alternative by an advantage of over 7.5%.

EXPLORING THE USE OF NLP TO AUTO-ALIGN MASTER SCHEDULES WITH SUPERINTENDENT’S LOOK-AHEADS IN CONSTRUCTION PROJECTS

In construction, there has always been a painful disconnect in reconciling parameters set in the master plan to what is actually happening in real-time on a project against the superintendent’s look-ahead. In the absence of an integrated solution, superintendents spend hours manually attempting to connect the master schedule with the look-ahead tasks written on trailer walls and sticky notes using papers or spreadsheets. This leads to frequent human error, poor communication between field and office and missing jobsite information created by the realities of weekly re-planning on-site. To address these inefficiencies, this paper explores the use of natural language processing (NLP) on both long-term (master) schedule and short-term (lookahead) plans to automatically learn and map their activities and tasks against one another. Using preliminary results from several commercial building projects, the potential of using an NLP seq2seq model as an Extractive and Abstractive Text Summarization technique is discussed in detail.

Automatic text summarization based on extractive-abstractive method

The choice of this study has a significant impact on daily life. In various fields such as journalism, academia, business, and more, large amounts of text need to be processed quickly and efficiently. Text summarization is a technique used to generate a precise and shortened summary of spacious texts. The generated summary sustains overall meaning without losing any information and focuses on those parts that contain useful information. The goal is to develop a model that converts lengthy articles into concise versions. The task to be solved is to select an effective procedure to develop the model. Although the present text summarization models give us good results in many recognized datasets such as cnn/daily- mail, newsroom, etc. All the problems can not be resolved by these models. In this paper, a new text summarization method has been proposed: combining the Extractive and Abstractive Text Summarization technique. In the extractive-based method, the model generates a summary using Sentence Ranking Algorithm and passes this generated summary through an abstractive method. When using the sentence ranking algorithm, after rearranging the sentences, the relationship between one sentence and another sentence is destroyed. To overcome this situation, Pronoun to Noun conversion has been proposed with the new system. After generating the extractive summary, the generated summary is passed through the abstractive method. The proposed abstractive model consists of three pre-trained models: google/pegusus-xsum, face-book/bart-large-cnn model, and Yale-LILY/brio-cnndm-uncased, which generates a final summary depending on the maximum final score. The following results were obtained: experimental results on CNN/daily-mail dataset show that the proposed model obtained scores of ROUGE-1, ROUGE-2 and ROUGE-L are respectively 42.67 %, 19.35 %, and 39.57 %. Then, the result has been compared with three state-of-the-art methods: JEANS, DEATS and PGAN-ATSMT. The results outperform state-of-the-art models. Experimental results also show that the proposed model is qualitatively readable and can generate abstract summaries. Conclusion: In terms of ROUGE score, the model outperforms some art-of-the-state models for ROUGE-1 and ROUGE-L, but doesn’t achieve good result in ROUGE-2.

An answer recommendation framework for an online cancer community forum.

Health community forums are a kind of online platform to discuss various matters related to management of illness. People are increasingly searching for answers online, particularly when they are diagnosed with cancer like life-threatening diseases. People seek suggestions or advice through these platforms to make decisions during their treatments. However, locating the correct information or similar people is often a great challenge for them. In this scenario, this paper proposes an answer recommendation system in an online breast cancer community forum that provide guidance and valuable references to users while making decisions. The answer is the summary of already discussed topic in the forum, so that they do not need to go through all the answer posts which spans over multiple pages or initiate a thread once again. There are three phases for the answer recommendation system, including query similarity model to retrieve the past similar query, query-answer pair generation and answer recommendation. Query similarity model is employed by a Siamese network with Bi-LSTM architecture which could achieve an F1-score of 85.5%. Also, the paper shows the efficacy of transfer learning technique to generalize the model well in our breast cancer query-query pair data set. The query-answer pairs are generated by an extractive summarization technique that is based on an optimization algorithm. The effectiveness of the generated summary is evaluated based on a manually generated summary, and the result shows a ROUGE-1 score of 49%.

Extractive Summarization on Food Reviews

Text summarization is a technique to summarize the content of a sizeable text but meanwhile it keep the key information. Extractive summarization and abstractive summarization are the main techniques for text summarization. TextRank algorithm, an extractive summarization technique is applied to perform automatic text summarization in this study. Furthermore, GloVe pre-trained word embedding model is used to map each word from the reviews to vector representation. In the end, PageRank algorithm is applied to rank the sentences based on their sentence ranking scores. The more important and relevant sentences which can be the representatives of summary will be placed in a higher rank. The objective of our study is to extract top five reviews with the highest sentence ranking scores which can form a summary to provide a conspectus of a cookies brand in Amazon food reviews. An analysis of the customer perception based on the summary generated is conducted to understand their needs and level of satisfactions. The final summary demonstrates that Amazon customer reviews for certain cookies brand are generally positive.

TEXT SUMMARIZATION USING MACHINE LEARNING AND DEEP NEURAL NETWORK

The creation of summaries and their evaluation have grown in popularity over time. The two primary techniques for creating summaries from a given text corpus are extractive text summarization and abstractive text summarization. To create abstractive and extractive summaries, a variety of techniques and methodologies are available. Using machine learning and deep neural networks, an automatic extractive and abstractive text summarization technique is developed. To produce a summary from a given text, the Extractive model utilizes (Spacy, TF-IDF Vectorizer, and Latent semantic Analysis algorithm (LSA)) and the Abstract model employs (Encoder-decoder RNN with LSTM units and attention mechanism). The goal of the model is to demonstrate the benefits of applying the Extractive and Abstractive approach to text summarization in practical settings.

A Novel Optimized Language-Independent Text Summarization Technique

A substantial amount of textual data is present electronically in several languages. These texts directed the gear to information redundancy. It is essential to remove this redundancy and decrease the reading time of these data. Therefore, we need a computerized text summarization technique to extract relevant information from group of text documents with correlated subjects. This paper proposes a language-independent extractive summarization technique. The proposed technique presents a clustering-based optimization technique. The clustering technique determines the main subjects of the text, while the proposed optimization technique minimizes redundancy, and maximizes significance. Experiments are devised and evaluated using BillSum dataset for the English language, MLSUM for German and Russian and Mawdoo3 for the Arabic language. The experiments are evaluated using ROUGE metrics. The results showed the effectiveness of the proposed technique compared to other language-dependent and language-independent summarization techniques. Our technique achieved better ROUGE metrics for all the utilized datasets. The technique accomplished an F-measure of 41.9% for Rouge-1, 18.7% for Rouge-2, 39.4% for Rouge-3, and 16.8% for Rouge-4 on average for all the dataset using all three objectives. Our system also exhibited an improvement of 26.6%, 35.5%, 34.65%, and 31.54% w.r.t. The recent model contributed in the summarization of BillSum in terms of ROUGE metric evaluation. Our model’s performance is higher than the compared models, especially in the metric results of ROUGE_2 which is bi-gram matching.

Hybrid Model For Abstractive Text Summarization

Text Summarization is a method to reduce a huge text into a meaningful condensed form. Today’s era is technological era. The people are always in the need of instant information in the concise form. As well as World Wide Web has expanded now-a-days so there is tremendous amount of data is created and available online. The today’s life is a very fast likes a machine. People do not have time to read a large document and conclude whether the document contain information which they want, So here text summary generator is a solution for this problem. Summary can help by providing the condensed form which can be read in minimum time. The paper presents a rigorous literature survey to study the different methods used to obtain the summary. As the issue of data over-burden has developed, what's more, as the amount of information has expanded, so has enthusiasm for programmed synopsis. It is hard for individuals to physically sum up enormous records of text documents. Text Summarization techniques can be divided into extractive text summarization and abstractive text summarization method. An extractive text summarization technique involves selection of significant words, sentences or passages and after that which is most significant sentences or passages form the summary by taking as it is words, sentences or passages. On the other hand Abstractive technique also involves selection of significant words, sentences or passages and after that which is most significant sentences or passages form the summary by forming it own words.

Evolutionary Algorithm based Ensemble Extractive Summarization for Developing Smart Medical System.

The amount of information in the scientific literature of the bio-medical domain is growing exponentially, which makes it difficult in developing a smart medical system. Summarization techniques help for efficient searching and understanding of relevant information from the medical documents. In the paper, an evolutionary algorithm based ensemble extractive summarization technique is devised as a smart medical application with the idea of hybrid artificial intelligence on natural language processing. We have considered the abstracts of the target article and its cited articles as the base summaries and a multi-objective evolutionary algorithm is applied for generating the ensemble summary of the target article. Each sentence of the base summaries is represented by a concept vector of the medical terms contained in it with the help of the Unified Modelling Language System (UMLS) tool which is widely used in various smart medical applications. These terms carry the key information of the sentence which is very useful to find out the semantic similarity among the sentences. Fitness functions of the evolutionary algorithm are mainly defined using clustering coefficient and sparsity index, the concepts of graph theory. After the convergence of the algorithm, the best solution of the final population gives the ensemble summary. Next, the semantic similarity of each sentence in the target article with the ensemble summary is calculated and the sentences which are most similar to the ensemble summary are considered as the summary of the target article. The method is applied to the articles available in the PubMed MEDLINE database system and experimental results are compared with some state of the art methods applied in the Bio-medical domain. Experimental results and comparative study based on the performance evaluation show that the method competes with some recently proposed summarization methods and outperforms others, which express the effectiveness of the proposed methodology. Different statistical tests have also been made to observe that the method is statistically significant.

News Text Summarization Based on Multi-Feature and Fuzzy Logic

Text Summarization as a phenomenon has always been present and rather an evolving one with the advent of new technologies both in terms of data collection as well for the processing of this data. One reason of using text summarization is the huge amount of data floating over the internet in the form of text files, comments which is though potent enough to be used to extract useful information. but since the amount of text present in these sources is too huge, so the need of text summarization becomes justified by every argument. Some of the areas where text summarization is vastly used is applications involved in providing capsule information such as compact news applications, or websites providing academic notes for various examinations This paper presents an auto text summarizer application which takes the URL of a web page as input, performs summarization on the selected elements and then presents this summarized text content on the front end of a web application. At the backend, the process of scraping of web page content (if an http URL is provided as input) using beautiful soup library or reading of text provided takes place. news in short forms, or micro blogging websites. The scraped content after being preprocessed properly is summarized using a suitable library which in our case is one among NLTK, Spacy, Genism and Sumy. The summarized content is presented at the frontend using flask framework of Python. The results produced using different libraries are compared in the end in terms of reading time of the summarized content. The application uses extractive text summarization technique in order to achieve its result which is a compact summary of the textual data prepared from the keywords already present in the document.

Extractive Text Summarization Using Graph Based Ranking Algorithm And Mean Shift Clustering

Text summarization is the process of converting a huge text file into a summarized version preserving its meaning and context. The major aspect of any extractive text summarization technique is to provide precise and accurate summary by using any sentence ranking algorithms. The text is first tokenized and preprocessed. The sentences in the text are ranked according to the corresponding graph based ranking algorithm and finally the top K-scored sentences are included in the summary. Combining the graph based ranking algorithm along with mean shift clustering enables us to efficiently summarize the articles increasing the precision of the system generated summary and also reduces the execution time. The efficiency of these approaches are evaluated using rouge metrics and execution time.

Effective aggregation of various summarization techniques

A large number of extractive summarization techniques have been developed in the past decade, but very few enquiries have been made as to how these differ from each other or what are the factors that actually affect these systems. Such meaningful comparison if available can be used to create a robust ensemble of these approaches, which has the possibility to consistently outperform each individual summarization system. In this work we examine the roles of three principle components of an extractive summarization technique: sentence ranking algorithm, sentence similarity metric and text representation scheme. We show that using a combination of several different sentence similarity measures, rather than only one, significantly improves performance of the resultant meta-system. Even simple ensemble techniques, when used in an informed manner, prove to be very effective in improving the overall performance and consistency of summarization systems. A statistically significant improvement of about 5% to 10% in ROUGE-1 recall was achieved by aggregating various sentence similarity measures. As opposed to this aggregation of several ranking algorithms did not show a significant improvement in ROUGE score, but even in this case the resultant meta-systems were more robust than candidate systems. The results suggest that new extractive summarization techniques should particularly focus on defining a better sentence similarity metric and use multiple sentence similarity scores and ranking algorithms in favour of a particular combination.

Evaluation of Unsupervised Learning based Extractive Text Summarization Technique for Large Scale Review and Feedback Data

Background/Objectives: Supervised techniques uses human generated summary to select features and parameter for summarization. The main problem in this approach is reliability of summary based on human generated parameters and features. Many researches have shown the conflicts in summary generated. Due to diversity of large scale datasets, supervised techniques based summarization also fails to meet the requirements. Big data analytics for text dataset also recommends unsupervised techniques than supervised techniques. Unsupervised techniques based summarization systems finds representative sentences from large amount of text dataset. Methods/Statistical Analysis: Co-selection based evaluation measure is applied for evaluating the proposed research work. The value of recall, precision, f-measure and similarity measure are determined for concluding the research outcome for the respective objective. Findings: The algorithms like KMeans, MiniBatchKMeans, and Graph based summarization techniques are discussed with all technical details. The results achieved by applying Graph Based Text Summarization techniques with large scale review and feedback data found improvement over previously published results based on sentence scoring using TF and TF-IDF. Graph based sentence scoring method is much efficient than other unsupervised learning techniques applied for extractive text summarization. Application/Improvements: The execution of graph based algorithm with Spark's Graph X programming environment will secure execution time for this types of large scale review and feedback dataset which is considered under Big Data Problem.

Extractive Summarization Technique Based on Fuzzy Membership Calculation Using Rough Sets

Selection of important sentences from a document is an important task in Automatic text summarization systems. When these sentences are presented without any modification in their syntax and semantics, they form extractive summary of the given text document. Extractive summarization techniques based on statistical methods like word frequency, indicator phrases and word co-occurrence are language independent. Recent studies have shown that word co-occurrence information can improve the quality of extractive summaries. This paper presents a statistical technique to identify important sentences of a text document using word co-occurrence information. The proposed technique adopts the rough set approach of Reduct and Core calculation for a given data. Fuzzy core concept is used, when the Core is empty or whenever the Core has to be enhanced. The proposed technique is tested with DUC 2002 data Sets and has given good results.