Search

Copyright of Revista Facultad de Ingeniería - UPTC is the property of Universidad Pedagogica y Tecnologica de Colombia, Facultad de Ingenieria and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, a novel hybrid Swin-T transformer based automatic text summarization model is proposed for both short and long documents. It involves various phases namely data acquisition, preprocessing, Word to Vector conversion, semantic feature extraction using Swin-T transformer, clustering the similar sentences using K-medoid clustering and finally ranking the sentences and summary generation using Bi-directional Gated Recurrent Unit (Bi-GRU). This setup outperforms the existing state-of-the-art systems in terms of evaluation score named ROUGE score such as ROUGE 1, ROUGE 2 and ROUGE L for the short benchmark datasets as well as a long user created arXiv dataset. [ABSTRACT FROM AUTHOR]

Update summarization is a relatively recent summarization task concerned with creating a short summary from news articles, assuming the user has already read a number of previous articles. It is useful for users who want to know the latest information about a specific topic. The availability of systems that provide update summaries saves user time and effort. Unfortunately, such resources are lacking for the Arabic language. This paper aims to provide an update summarization system that generates an update summary containing the latest information requested by a user from multiple documents. This paper provides an Arabic query-based Update-Summarization System (AUSS). We use a graph-based ranking model to represent the similarity, through a combination of lexical and semantic relations between words. Our experiments show that AUSS achieves promising results, achieving a best F-Measure of 0.5405. To test AUSS, we created a new corpus especially for Arabic Update Summaries, which we call (AUS-DB). AUS-DB contains 183 articles and their corresponding reference summaries.

This study aims to design a model for automatic text summarization in Indonesian. Automatic text summarization is a system that reduces the number of sentences without losing important information in the document. There are three approaches in making automatic text summarization, namely: extractive, abstractive, and hybrid. The extractive approach is to select a core sentence without changing it to a new sentence. The abstractive approach is to construct new sentences that describe the contents of the document. Meanwhile, the hybrid approach designed in this study is a combination of extractive and abstractive approaches. By designing automatic text summarization in Indonesian with a hybrid approach, it is hoped that the results issued by the system will be more like man-made summaries and have higher readability. The design made is specifically for the input of a document. The stages of automatic text summarization are divided into two, namely preprocessing and process. In the Preprocessing stage, sentence separation, tokenization, coreference resolution, stop words removal, feature extraction are carried out. There are two stages of making the summary, namely the extraction stage, to select important sentences and the abstraction stage, to select words and arrange them into summary sentences. Further research can be carried out for input of longer documents and the input is in the form of multi documents

Copyright of Domínios de Lingu@gem is the property of Dominios de Lingu@gem and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

A novel methodology is introduced for extracting entities from noisy scanned documents by using end-to-end data and reformulating the entity extraction task as a text summarization problem. This approach offers two significant advantages over traditional entity extraction methods while maintaining comparable performance. First, it utilizes preexisting data to construct datasets, thereby eliminating the need for labor-intensive annotation procedures. Second, it employs multitask learning, enabling the training of a model via a single dataset. To evaluate our approach against state-of-the-art methods, we adapted three commonly used datasets, namely, Conference on Natural Language Learning (CoNLL++), few-shot named entity recognition (Few-NERD), and WikiNEuRal domain adaptation (WikiNEuRal + DA), to the format required by our methodology. We subsequently fine-tuned four sequence-to-sequence models: text-to-text transfer transformer (T5), fine-tuned language net T5 (FLAN-T5), bidirectional autoregressive transformer (BART), and pretraining with extracted gap sentences for abstractive summarization sequence-to-sequence models (PEGASUS). The results indicate that, in the absence of optical character recognition (OCR) noise, the BART model performs comparably to state-of-the-art methods. Furthermore, the performance degradation was limited to 3.49–5.23% when 39–62% of the sentences contained OCR noise. This performance is significantly superior to that of previous studies, which reported a 10–20% decrease in the F1 score with texts that had a 20% OCR error rate. Our experimental results demonstrate that a single model trained via our methodology can reliably extract entities from noisy OCRed texts, unlike existing state-of-the-art approaches, which require separate models for correcting OCR errors and extracting entities. [ABSTRACT FROM AUTHOR]

Video summarization has attracted extensive attention benefiting from its valuable capability to facilitate video browsing. While achieving notable improvement, existing methods still fail to sufficiently and effectively model contextual information within videos, hindering the summarization performance owing to a deficiency in powerful contextual representations. To address this limitation, we present a novel Attention-Guided Multi-Granularity Fusion Model (AMFM), which allows for optimizing the modeling process from the context capturing and fusion perspective. AMFM comprises three dominant components including a content-aware enhancement (CAE) module, a multi-granularity encoder (MGE), and a scale-adaptive fusion (SAF) module. More specifically, CAE dynamically enhances pre-trained visual features by learning the potential visual relationship across frame-level and video-level embeddings. Subsequently, coarse-grained and fine-grained contextual information is simultaneously modeled in the same representation space by MGE with the combination of self-attention and temporal convolution scheme. Furthermore, the multi-granularity representations with a significant difference in the semantic scale are adaptively fused by SAF. Our method can precisely pinpoint key segments by effectively modeling and processing rich temporal representations. Extensive comparisons with state-of-the-art methods on standard datasets demonstrate the effectiveness of the proposed method, and the ablation studies further verify the positive impact of each module in our model. • We propose a novel feature enhancement method to learn effective representations. • A multi-granularity encoder is built to robustly model global and local contexts. • We devise a scale-adaptive fusion module to achieve sufficient context fusion. • Our method outperforms existing methods on popular benchmark datasets. [ABSTRACT FROM AUTHOR]

Text summarization research is significant and challenging in the domain of natural language processing. Abstractive text summarization mainly uses the encoder-decoder framework, wherein the encoder component does not have a sufficient semantic comprehension of the input text, and there are exposure biases and semantic inconsistencies between the reference and generated summaries during the training process. We propose an improved encoder-decoder model that incorporates a hierarchical attention mechanism and multiobjective reinforcement learning. The encoder introduces a multihead self-attention mechanism to allow for the acquisition of more comprehensive semantic information from multiple angles and dimensions, while the decoder introduces a pointer-generator network to solve the out-of-vocabulary problem. Multiobjective reinforcement learning methods are constructed throughout the training process to optimize the model in terms of addressing exposure bias, maintaining semantic consistency, and enhancing readability. The results of the comparative experiments demonstrate that the proposed model significantly improved in terms of the ROUGE evaluation metric, and the generated summaries were semantically similar to the reference summaries. [ABSTRACT FROM AUTHOR]

Abstractive Text summarization aims to generate a short summary for a document while preserving salient information. Recently, contrastive learning has been extended from visual representation to summarization tasks. At present, the methods of contrastive learning summarization focus on modeling the global semantics of source documents, targets and candidate summaries to maximize their similarities. However, they ignore the influence of sentence semantics in the document. In this paper, we propose a sentence-level salience contrastive learning method to help the model capture salient information and denoise. The model expresses the sentence salience according to the semantic similarity between the summaries and sentences of the source document, and integrates the similarity distance into the contrastive loss in the form of soft weights. Therefore, our model maximize the similarity between summaries and salient information, while minimizing the similarity between summaries and potential noise. We have verified our method in three widely used datasets, CNN/Daily Mail, XSum and PubMed. The experimental results show that the proposed method can significantly improve the baseline performance and achieve competitive performance in the existing contrastive learning methods. • We propose a contrastive learning method for abstractive text summarization. • We construct contrastive samples in the source sentences. • We incorporate the salient distance-aware weightsinto the contrastive loss. • Experiments show that our model has obviously better performance. [ABSTRACT FROM AUTHOR]

The need for automatic text summarization is natural: there is a huge volume of information available online, which prompts for a widespread interest in extracting relevant information in a concise and understandable manner. Here, automated text summarization has been treated as an extractive single-document summarization problem in the proposed system. To solve this problem, a particle swarm optimisation (PSO) algorithm-based approach is suggested, with the goal of producing good summaries in terms of content coverage, informativeness, and readability. This paper introduces XSumm-PSO: a new approach based on PSO optimization technique in a supervised manner for extractive summarization. Further, this paper also contributes a new feature "incorrect word" that captures misspelled words in the candidate sentences. This feature is combined with nine existing features used by proposed model to generate error free summaries. As a result, the proposed XSumm-PSO framework produces superior performance achieving improvements of +2.7%, +0.8%, and +0.8% for ROUGE-1, ROUGE-2, and ROUGE-L scores, respectively, on DUC 2002 dataset, over state-of-the-art techniques. The corresponding improvements on the CNN/DailyMail dataset are +0.97%, +0.25%, and +0.49%. We also performed sample t-test, showing the proposed approach is statistically consistent across various runs. • A PSO-based technique optimized in a supervised manner using ROGUE-1 is proposed. • The suggested model solves a single-document extractive text summarization task. • A new feature "incorrect word" is also introduced in this work. • We evaluate our proposed model on DUC-2002 and CNN/DailyMail benchmark datasets. • The suggested model generalizes better and produces better accuracy than SOTA. [ABSTRACT FROM AUTHOR]

As the phenomenon of knowledge overload becomes more and more obvious, the automatic summarization technology still needs to break through the bottleneck in order to improve the application value and expand the scope of the application. Traditional training paradigms for extractive summarization systems suffer from the inconsistency in training and evaluation. In this paper, we propose an innovative and interpretable contrastive learning based framework for extractive summarization called DCDSum , which comprises a D iverse Oracle evaluator, a C ontrastive learning extractor, and a D ynamic Top-k selector. Different from previous models that consider the extractive summarization task as a sequence labeling problem, our contrastive learning extractor treats it as a sentence reranking problem and introduces contrastive loss to achieve it, which can bridge the gap between objective function and evaluation metrics. The experimental results demonstrate the outstanding performance of our approach on the CNN/DailyMail, XSum, and PubMed datasets, achieving highly competitive results. In particular, our method achieves ROUGE-1 of 44.65, ROUGE-2 of 21.32, and ROUGE-L of 40.87 on the CNN/DailyMail dataset. The outcomes across various evaluation metrics substantiate that the Diverse Oracle extraction algorithm adeptly captures a broader array of sentences with reduced redundancy, consequently enhancing the interpretability of the DCDSum framework. [ABSTRACT FROM AUTHOR]

In this study, we conceptualize two approaches, model-based and text-based, grounded on mental models and discourse comprehension theories, to computerized summary analysis. We juxtapose the model-based approach with the text-based approach to explore shared knowledge dimensions and associated measures from both approaches and use them to examine changes in students' summaries over time. We used 108 cases in which we computed model-based and text-based measures for two versions of students' summaries (i.e., initial and final revisions), resulting in a total of 216 observations. We used correlations, Principal Components Analysis (PCA), and Linear Mixed-Effects models. This exploratory investigation suggested a shortlist of text-based measures, and the findings of the PCA demonstrated that both model-based and text-based measures explained the three-dimensional model (i.e., surface, structure, and semantic). Overall, model-based measures were better for tracking changes in the surface dimension, while text-based measures were descriptive of the structure dimension. Both approaches worked well for the semantic dimension. The tested text-based measures can serve as a cross-reference to evaluate students' summaries along with the model-based measures. The current study shows the potential of using multidimensional measures to provide formative feedback on students' knowledge structure and writing styles along the three dimensions. • This study introduces two types of Automated Summary Evaluation (ASE) approaches. • We explored shareable knowledge dimensions and their measures in both ASE approaches. • We employed PCA and Mixed-Effects models to assess 216 observations across 108 cases. • PCA showed measures from both approaches explained the three-dimensional model. • Both approaches' measures could enable multidimensional assessment and feedback. [ABSTRACT FROM AUTHOR]

The original article can be found online at https://doi.org/10.1007/s00521-023-08680-0.Correction to: Neural Computing and Applications (2023) 35:18553–18570https://doi.org/10.1007/s00521-023-08680-0In this article the author's name Shuaimin Li was incorrectly written as Shuimin Li.The original article has been corrected.Publisher's NoteSpringer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.By Shuaimin Li and Jungang XuReported by Author; Author [Extracted from the article]

Text summarization is a widely-researched problem among scholars in the field of natural language processing. Multiple techniques have been proposed to help tackle this problem, yet some of these methodologies may still exhibit limitations such as the requirements for large training datasets, which might not always be possible, but more importantly, the lack of interpretability or transparency of the model. In this paper, we propose using meta-learning algorithm to train a deep learning model for extractive text summarization and then using various explanatory techniques such as SHAP (Shapley, 1953), linear regression (Lederer, 2022), decision trees (Fürnkranz, 2010), and input modification to gain insights into the model's decision making process. To evaluate the effectiveness of our approach, we will compare it to other popular natural language processing models like BERT (Miller, 2019) or XLNET (Yang et al., 2020) using the ROUGE metrics (Lin, 2004). Overall, our proposed approach provides a promising solution to the limitations of existing methods and a framework for improving the explainability of deep learning models in other natural language processing tasks. • Bi-LSTM and Meta-learning produce better results compared to other popular models. • Meta-learning can be utilized to improve performance in data-scarce scenarios. • Use SHAP, regression, decision tree, and text mutation to enhance interpretability. [ABSTRACT FROM AUTHOR]

In the rapidly evolving field of natural language processing, the demand for efficient automated text summarization systems that not only distill extensive documents but also capture their nuanced thematic elements has never been greater. This paper introduces the FuzzyTP-BERT framework, a novel approach in extractive text summarization that synergistically combines Fuzzy Topic Modeling (FuzzyTM) with the advanced capabilities of Bidirectional Encoder Representations from Transformers (BERT). Unlike traditional extractive methods, FuzzyTP-BERT integrates fuzzy logic to refine topic modeling, enhancing the semantic sensitivity of summaries by allowing a more nuanced representation of word-topic relationships. This integration results in summaries that are not only coherent but also thematically rich, addressing a significant gap in current summarization technology. Extensive evaluations on benchmark datasets demonstrate that FuzzyTP-BERT significantly outperforms existing models in terms of ROUGE scores, effectively balancing topical relevance with semantic coherence. Our findings suggest that incorporating fuzzy logic into deep learning frameworks can markedly improve the quality of automated text summaries, potentially benefiting a wide range of applications in the information overload age. [ABSTRACT FROM AUTHOR]

At present,the automatic summarization model for Chinese content applied to legal judgement documents mainly adopts the extraction method.However,due to the lengthiness and low level of structure of legal texts,the accuracy and reliability of extraction method is insufficient for practical application.In order to obtain high quality summaries of legal judgment documents,in this paper,we propose an abstractive automatic summarization model based on multi-model fusion.Based on Seq2Seq model,we apply attention mechanism and selective gates to better process the data input.Specifically,we combine Bert pre-trai-ning and reinforcement learning policy to optimize our model.The corpus we built consists of 50 000 legal judgment documents regarding small claims procedure and summary procedure.Evaluations on the corpus demonstrate that the proposed model outperforms all of the baseline model,and the mean ROUGE score is 5.81% higher than that of conventional Seq2seq+Attentionmodel.

With the development of science and technology,people need to access a large number of scientific and technological information quickly,and scientific paper is one of the main ways to carry scientific and technological information.As an important part of scientific paper,abstract is an effective tool for readers to retrieve literature.Therefore,the quality of abstract affects the retrieval rate of paper directly.However,due to the lack of writing experience,the quality of abstracts written by many authors is not high.Automatic generation of summary for scientific paper can help the author grasp the important content of paper more effectively,so as to write high-quality abstract.At the same time,the automatically generated abstract can also control the number of words in the abstract,which can bring more content to readers and help them understand the paper better.Generating automa-tic summarization for scientific paper can help author write abstract faster,which is one of the research contents in automatic summarization.Compared with common news document,scientific paper has the characteristics of strong structure and clear logical relationship.As far as the mainstream abstractive summarization such as encoder-decoder model is concerned,it mainly consi-ders the serialized information in the document,and rarely explores the text structure information in the document.For this reason,according to the characteristics in scientific papers,this paper proposes an automatic summarization model based on the hie-rarchical structure of "word-section-document",which uses the association between word and section to enhance the level of text structure and the interaction between levels,so as to screen out the key information in scientific paper.In addition,a context gate unit is extended to update the optimized context vector,thus capturing context information more comprehensively.The experimental results show that the proposed model can effectively improve the performance of the generated summarization in the ROUGE evaluation method.

Automatic summarization is a task to condense the data to a shorter version while preserving key informational components and the meaning of content. In this paper, we introduce Tech-Talk-Sum, which is the combination of BERT (Bidirectional Encoder Representations from Transformers) and the attention mechanism to summarize the technological talk videos. We first introduce the technology talk datasets that were constructed from YouTube including short- and long-talk videos. Second, we explored various sentence representations from BERT's output. Using the top hidden layer to represent sentences is the best choice for our datasets. The outputs from BERT were fed forward to the Bi-LSTM network to build local context vectors. Besides, we built the document encoder layer that leverages BERT and the self-attention mechanism to express the semantics of a video caption and to form the global context vector. Third, the undirected LSTM was added to bridge the local and global sentence's contexts to predict the sentence's salience score. Finally, the video summaries were generated based on the scores. We trained a single unified model on long-talk video datasets. ROUGE was utilized to evaluate our proposed methods. The experimental results demonstrate that our model has generalization ability, and achieves the baselines and state-of-the-art results for both long and short videos. [ABSTRACT FROM AUTHOR]

Opinion summarization recapitulates the opinions about a common topic automatically. The primary motive of summarization is to preserve the properties of the text and is shortened in a way with no loss in the semantics of the text. The need of automatic summarization efficiently resulted in increased interest among communities of Natural Language Processing and Text Mining. This paper emphasis on building an extractive summarization system combining the features of principal component analysis for dimensionality reduction and bidirectional Recurrent Neural Networks and Long Short-Term Memory (RNN-LSTM) deep learning model for short and exact synopsis using seq2seq model. It presents a paradigm shift with regard to the way extractive summaries are generated. Novel algorithms for word extraction using assertions are proposed. The semantic framework is well-grounded in this research facilitating the correct decision making process after reviewing huge amount of online reviews, considering all its important features into account. The advantages of the proposed solution provides greater computational efficiency, better inferences from social media, data understanding, robustness and handling sparse data. Experiments on the different datasets also outperforms the previous researches and the accuracy is claimed to achieve more than the baselines, showing the efficiency and the novelty in the research paper. The comparisons are done by calculating accuracy with different baselines using Rouge tool. [ABSTRACT FROM AUTHOR]

In the natural language processing family, learning representations is a pioneering study, especially in sequence-to-sequence tasks where outputs are generated, totally relying on the learning representations of source sequence. Generally, classic methods infer that each word occurring in the source sequence, having more or less influence on the target sequence, should all be considered when generating outputs. As the summarization task requires the output sequence to only retain the essence, classic full consideration of the source sequence may not work well on it, which calls for more suitable methods with the ability to discard the misleading noise words. Motivated by this, with both relevance retaining and redundancy removal in mind, we propose a summarization learning model by implementing an encoder with copious contextual information represented and a decoder with a selecting mechanism integrated. Specifically, we equip the encoder with an asynchronous bi directional parallel structure, in order to obtain abundant semantic representation. The decoder, different from the classic attention-based works, employs a self-aware context selecting mechanism to generate summary in a more productive way. We evaluate the proposed methods on three benchmark summarization corpora. The experimental results demonstrate the effectiveness and applicability of the proposed framework in relation to several well-practiced and state-of-the-art summarization methods. [ABSTRACT FROM AUTHOR]

OBJECTIVEIt is crucial for clinicians to stay up to date on current literature in order to apply recent evidence to clinical decision making. Automatic summarization systems can help clinicians quickly view an aggregated summary of literature on a topic. Casama, a representation and summarization system based on “contextualized semantic maps,” captures the findings of biomedical studies as well as the contexts associated with patient population and study design. This paper presents a user-oriented evaluation of Casama in comparison to a context-free representation, SemRep.MATERIALS AND METHODSThe effectiveness of the representation was evaluated by presenting users with manually annotated Casama and SemRep summaries of ten articles on driver mutations in cancer. Automatic annotations were evaluated on a collection of articles on EGFR mutation in lung cancer. Seven users completed a questionnaire rating the summarization quality for various topics and applications.RESULTSCasama had higher median scores than SemRep for the majority of the topics (p ≤ 0.00032), all of the applications (p ≤ 0.00089), and in overall summarization quality (p ≤ 1.5e-05). Casama’s manual annotations outperformed Casama’s automatic annotations (p = 0.00061).DISCUSSIONCasama performed particularly well in the representation of strength of evidence, which was highly rated both quantitatively and qualitatively. Users noted that Casama’s less granular, more targeted representation improved usability compared to SemRep.CONCLUSIONThis evaluation demonstrated the benefits of a contextualized representation for summarizing biomedical literature on cancer. Iteration on specific areas of Casama’s representation, further development of its algorithms, and a clinically-oriented evaluation are warranted.

Update summarization is a relatively recent summarization task concerned with creating a short summary from news articles, assuming the user has already read a number of previous articles. It is useful for users who want to know the latest information about a specific topic. The availability of systems that provide update summaries saves user time and effort. Unfortunately, such resources are lacking for the Arabic language. This paper aims to provide an update summarization system that generates an update summary containing the latest information requested by a user from multiple documents. This paper provides an Arabic query-based Update-Summarization System (AUSS). We use a graph-based ranking model to represent the similarity, through a combination of lexical and semantic relations between words. Our experiments show that AUSS achieves promising results, achieving a best F-Measure of 0.5405. To test AUSS, we created a new corpus especially for Arabic Update Summaries, which we call (AUS-DB). AUS-DB contains 183 articles and their corresponding reference summaries. [ABSTRACT FROM AUTHOR]

In order to solve the problem of how to explore potential information in massive data and make effective use of it, this paper mainly studies news text clustering and proposes a news clustering algorithm based on improved K -Means. Then, the MapReduce programming model is used to parallelize the TIM- K -Means algorithm, so that it can run on the Hadoop platform. The accuracy and error are used as measurement indicators, and the collected datasets are used for experiments to verify the correctness and effectiveness of the TI value and TIM- K -Means algorithm. In addition, the Alibaba cloud server is used to build the Hadoop cluster, and the feasibility of parallelization transformation of TIM- K -Means algorithm is verified by accelerated comparison. The results show that the parallelized TIM- K -Means has a good acceleration ratio, can save about 30% of the time under the same conditions, and can meet the actual needs of processing massive data in the context of big data. In multidocument automatic summarization, news clustering algorithm can gather the news with the same topic and provide cleaner and accurate data for visual automatic summarization, which is of great significance in the fields of public opinion supervision, hot topic discovery, emergency real-time tracking, and so on. [ABSTRACT FROM AUTHOR]

Summarizing trending topics in large collections of Facebook posts is particularly relevant to profile social user activities and interests. However, automatically generating these summaries poses significant challenges due to the high heterogeneity of the input data, the limited fluency of extractive summaries, and the absence of abstractive summarization methods capable of handling multiple posts simultaneously. Existing abstractive models are either not suited to handle large post collections or disregard topic-level text relations. In this work, we present TASP , a novel tool for trending topic detection and summarization from English-written Facebook posts. It trains abstractive summarization models on multi-post collections by leveraging a shortlist of authoritative posts published by renowned newspapers. At inference time, TASP first creates clusters of semantically similar social posts, each one representing a distinct topic, using pre-trained transformer-based language models. Then, it generates abstractive summaries of the clusters for which authoritative information is missing. To the best of our knowledge, TASP is the first available tool suited to abstractive multi-post summarization. We test our approach on a large-scale dataset of real Facebook posts. The results show (1) The higher effectiveness of transformer-based approaches in generating topic-specific post clusters compared to traditional methods. (2) The importance of attending long pieces of text in multi-post abstractive summary generation. • A tool for abstractive summarization of multi-post collections is proposed. • It exploits topic modeling techniques to handle post heterogeneity. • It overcomes the limitations of existing approaches summarizing one post at a time. • It leverages transformers for both topic modeling and summarization. • It reports a showcase of a real large-scale data collection of UK Facebook posts. [ABSTRACT FROM AUTHOR]

Opinion mining aims to detect and extract relevant information from large quantity of customer reviews. Automatic opinion summarization then seeks to create a consensual point of view often oriented toward the main sentiment of clients to render their experience. Although factual information is valuable for companies to understand what works or not in their products, summarization approaches that convey objectivity, and constructive feedback from customer reviews have yet to be explored. We propose an adversarial multi-task learning model for document summarization to address this new issue. Our algorithm combines an autoencoder for document summarization with a gradient reversal layer to learn independent representations of subjective and sentiment-based material. We assess and compare our method on the Amazon product review dataset where we introduce an original evaluation dataset for objective summarization. We further completed the analysis with neutrality and objectivity metrics. This study demonstrates that the generated summaries carry out relevant and objective content but also emphasize the importance of various processes and layers in multi-task learners to control the information effectively. • Objective opinion summarization of customer reviews. • Unsupervised autoencoder for summarization. • Sentiment disentanglement with gradient reversal layer. • Dataset and metrics to assess neutrality and objectivity of summaries. [ABSTRACT FROM AUTHOR]

The enormous quantity of text makes it challenging for users to obtain the key information and knowledge. Automatic text summarization can alleviate this problem by providing reliable summaries for massive text documents. During the last decade, significant achievements have been made in text summarization. We conduct this survey to explore what research community is focused on, the application scenarios of summarization, the state-of-the-art techniques and methods, and to analyze the challenges and future direction. We summarize that incorporating with natural language processing, previous text summarization research applied knowledge-based methods, graph-based methods, statistical learning methods, and deep learning methods. Applying large language model to text summarization is still in its early stages. By analyzing current research progress, we conclude that understand semantic information and specific domain knowledge is required for text summarization, and the conciseness and readability of the summary should be ensured. The future research opportunity is automatic knowledge summarization, and more research effort is urgently needed to explore. • Significant achievements of automatic text summarization have been made. • We aim to explore the research community of automatic text summarization. • Incorporating with NLP, text summarization applied knowledge-based, graph-based and machine learning methods. • The combination of extractive and abstractive strategies is required, which can ensure the quality of the summary. • The future research opportunity is automatic knowledge summarization. [ABSTRACT FROM AUTHOR]

Specifically focusing on the landscape of abstractive text summarization, as opposed to extractive techniques, this survey presents a comprehensive overview, delving into state-of-the-art techniques, prevailing challenges, and prospective research directions. We categorize the techniques into traditional sequence-to-sequence models, pre-trained large language models, reinforcement learning, hierarchical methods, and multi-modal summarization. Unlike prior works that did not examine complexities, scalability and comparisons of techniques in detail, this review takes a comprehensive approach encompassing state-of-the-art methods, challenges, solutions, comparisons, limitations and charts out future improvements — providing researchers an extensive overview to advance abstractive summarization research. We provide vital comparison tables across techniques categorized — offering insights into model complexity, scalability and appropriate applications. The paper highlights challenges such as inadequate meaning representation, factual consistency, controllable text summarization, cross-lingual summarization, and evaluation metrics, among others. Solutions leveraging knowledge incorporation and other innovative strategies are proposed to address these challenges. The paper concludes by highlighting emerging research areas like factual inconsistency, domain-specific, cross-lingual, multilingual, and long-document summarization, as well as handling noisy data. Our objective is to provide researchers and practitioners with a structured overview of the domain, enabling them to better understand the current landscape and identify potential areas for further research and improvement. [Display omitted] • Overview of state-of-the-art techniques in abstractive text summarization. • Comparative analysis of models in abstractive summarization. • Identification of challenges and potential improvements in the field. • Exploration of future research directions and emerging frontiers. • Holistic survey of abstractive text summarization. [ABSTRACT FROM AUTHOR]

Automatic Text Summarization (ATS) involves estimating the salience of information and creating coherent summaries that include all relevant and important information from the original text. Extensive research has been carried out on ATS since 1958, gradually evolving from simple to advanced techniques, including machine learning-based, neural network-based, and deep learning-based techniques. Progress has been made in both extractive and abstractive methods throughout this development. Despite numerous surveys on ATS, there remains a notable absence of a comprehensive literature review encompassing the latest advancements in deep learning techniques for text summarization. Therefore, this paper provides a Systematic Literature Review (SLR) of deep learning-based text summarization in both types (extractive and abstractive) between 2014 and 2023. To the best of our knowledge, this is the first SLR that offers a comprehensive overview of extractive and abstractive text summarization techniques based on Deep Learning models. According to the defined inclusion and exclusion criteria, 73 deep learning-based text summarization studies are selected for further investigation. The structure of the review is organized as follows. Firstly, it identifies and examines the deep learning models employed in both extractive and abstractive text summarization. Then, the input text's representation methods are identified and discussed clearly. Next, training strategies used in supervised extractive summarization techniques are identified. Furthermore, mechanisms that improve the abstractive summarization process are identified. Additionally, the most commonly used datasets and their advantages and disadvantages are discussed. The most commonly used evaluation metrics are also identified. Finally, the challenges and possible solutions to guide future research in the field are discussed. • Analyze the latest deep learning-based text summarization techniques. • Introduce a new taxonomy of deep learning models for text summarization. • Identify methods for representing input text clearly. • Identify training strategies for supervised extractive summarization techniques. • Identify the mechanisms used in abstractive summarization techniques. [ABSTRACT FROM AUTHOR]

Abstract: Automatic summaries commonly present diverse linguistic problems that affect textual quality and thus their understanding by users. Few studies have tried to characterize such problems and their relation with the performance of the summarization systems. In this paper, we investigated the problems in multi-document extracts (i.e., summaries produced by concatenating several sentences taken exactly as they appear in the source texts) generated by systems for Brazilian Portuguese that have different approaches (i.e., superficial and deep) and performances (i.e., baseline and state-of-the art methods). For that, we first reviewed the main characterization studies, resulting in a typology of linguistic problems more suitable for multi-document summarization. Then, we manually annotated a corpus of automatic multi-document extracts in Portuguese based on the typology, which showed that some of linguistic problems are significantly more recurrent than others. Thus, this corpus annotation may support research on linguistic problems detection and correction for summary improvement, allowing the production of automatic summaries that are not only informative (i.e., they convey the content of the source material), but also linguistically well structured. Keywords: automatic summarization; multi-document summary; linguistic problem; corpus annotation. Resumo: Sumários automáticos geralmente apresentam vários problemas linguísticos que afetam a sua qualidade textual e, consequentemente, sua compreensão pelos usuários. Alguns trabalhos caracterizam tais problemas e os relacionam ao desempenho dos sistemas de sumarização. Neste artigo, investigaram-se os problemas em extratos (isto é, sumários produzidos pela concatenação de sentenças extraídas na íntegra dos textos-fonte) multidocumento em Português do Brasil gerados por sistemas que apresentam diferentes abordagens (isto é, superficial e profunda) e desempenho (isto é, métodos baseline e do estado-da-arte). Para tanto, as principais caracterizações dos problemas linguísticos em sumários automáticos foram investigadas, resultando em uma tipologia mais adequada à sumarização multidocumento. Em seguida, anotou-se manualmente um corpus de extratos com base na tipologia, evidenciando que alguns tipos de problemas são significativamente mais recorrentes que outros. Assim, essa anotação gera subsídios para as tarefas automáticas de detecção e correção de problemas linguísticos com vistas à produção de sumários automáticos não só mais informativos (isto é, que cobrem o conteúdo do material de origem), como também linguisticamente bem-estruturados. Palavras-chave: sumarização automática; sumário multidocumento; problema linguístico; anotação de corpus.

Automatic text summarization extracts important information from texts and presents the information in the form of a summary. Abstractive summarization approaches progressed significantly by switching to deep neural networks, but results are not yet satisfactory, especially for languages where large training sets do not exist. In several natural language processing tasks, a cross-lingual model transfer is successfully applied in less-resource languages. For summarization, the cross-lingual model transfer was not attempted due to a non-reusable decoder side of neural models that cannot correct target language generation. In our work, we use a pre-trained English summarization model based on deep neural networks and sequence-to-sequence architecture to summarize Slovene news articles. We address the problem of inadequate decoder by using an additional language model for the evaluation of the generated text in target language. We test several cross-lingual summarization models with different amounts of target data for fine-tuning. We assess the models with automatic evaluation measures and conduct a small-scale human evaluation. Automatic evaluation shows that the summaries of our best cross-lingual model are useful and of quality similar to the model trained only in the target language. Human evaluation shows that our best model generates summaries with high accuracy and acceptable readability. However, similar to other abstractive models, our models are not perfect and may occasionally produce misleading or absurd content. [ABSTRACT FROM AUTHOR]

Broad amount of information is accessible online on the internet. The purpose of search engines like Google and Bing is to retrieve data from archives. The actual results have not yet been reached due to the rapid growth in number of computerized data. Subsequently, the default summary is much needed. The default summary takes several pages as insert and output an abridged version, saving both information and time. In the current age, where immense amount of information is present online, it is much important to give the improved mechanism to draw out the information quickly and more efficiently. It is very tough that people can draw out a summary of large text documents on their own. So, there is a problem in inquiring for appropriate document from all the documents available, and consuming relevant information from it. In order to solve the problem above, the automatic text summarization is very much needed. The practice of extracting the most significant and meaningful information from a document or group of related papers and condensing it while retaining its overall meaning is known as text summarization. Natural Language Processing is defined as the capability of a computer program to acknowledge human language when speaking and writing a language. Natural Language Processing is one of the key components of practical wisdom. It has many applications in various fields and we use it in many real-world applications such as Business Intelligence medical research and much more. We have been using Natural Language Processing for 50 years now. The research was done in one volume and accumulated in many volumes. This research is centered on an idea build on the abbreviations of text summaries. [ABSTRACT FROM AUTHOR]

Abstract Background Automated summarization of scientific literature and patient records is essential for enhancing clinical decision-making and facilitating precision medicine. Most existing summarization methods are based on single indicators of relevance, offer limited capabilities for information visualization, and do not account for user specific interests. In this work, we develop an interactive content extraction, recognition, and construction system (CERC) that combines machine learning and visualization techniques with domain knowledge for highlighting and extracting salient information from clinical and biomedical text. Methods A novel sentence-ranking framework multi indicator text summarization, MINTS, is developed for extractive summarization. MINTS uses random forests and multiple indicators of importance for relevance evaluation and ranking of sentences. Indicative summarization is performed using weighted term frequency-inverse document frequency scores of over-represented domain-specific terms. A controlled vocabulary dictionary generated using MeSH, SNOMED-CT, and PubTator is used for determining relevant terms. 35 full-text CRAFT articles were used as the training set. The performance of the MINTS algorithm is evaluated on a test set consisting of the remaining 32 full-text CRAFT articles and 30 clinical case reports using the ROUGE toolkit. Results The random forests model classified sentences as “good” or “bad” with 87.5% accuracy on the test set. Summarization results from the MINTS algorithm achieved higher ROUGE-1, ROUGE-2, and ROUGE-SU4 scores when compared to methods based on single indicators such as term frequency distribution, position, eigenvector centrality (LexRank), and random selection, p

Most current automatic summarization methods are for English texts. The distinction between words in Chinese text is large, the types of parts of speech are many and complex, and polysemy or ambiguous words appear frequently. Therefore, compared with English text, Chinese text is more difficult to extract useful feature words. Due to the complex syntax of Chinese, there are currently relatively few automatic summarization methods for Chinese text. In the past, only the important sentences in the original text can be selected and simply arranged to obtain a summary with chaotic sentences and insufficient coherence. Meanwhile, because Chinese short text usually contains more redundant information and the sentence structure is not neat, we propose a topic-based automatic summary method for Chinese short text. Firstly, a key sentence selection method is proposed combining topic words and TF-IDF to obtain the score of each text corresponding to the topic in the original text data. Then the sentence with the highest score as the topic sentence of the topic is selected. Considering that the short text of Weibo may contain a lot of irrelevant information and sometimes even lack some important components of topic, three retouching mechanisms are proposed to improve the conciseness, richness and readability of topic sentence extraction results. We validate our approach on natural disaster and social hot event datasets from Sina Weibo. The experimental results show that the polished topic summary not only reflects the exact relationship between topic sentences and natural disasters or social hot events, but also has rich semantic information. More importantly, we can almost grasp the basic elements of natural disaster or social hot event from the topic sentence, so as to help the government guide disaster relief or meet the needs of users for quickly obtaining information of social hot events.

This paper describes the information retrieval step in Casama (Contextualized Semantic Maps), a project that summarizes and contextualizes current research papers on driver mutations in non-small cell lung cancer. Casama׳s representation of lung cancer studies aims to capture elements that will assist an end-user in retrieving studies and, importantly, judging their strength. This paper focuses on two types of study metadata: study objective and study design. 430 abstracts on EGFR and ALK mutations in lung cancer were annotated manually. Casama׳s support vector machine (SVM) automatically classified the abstracts by study objective with as much as 129% higher F-scores compared to PubMed׳s built-in filters. A second SVM classified the abstracts by epidemiological study design, suggesting strength of evidence at a more granular level than in previous work. The classification results and the top features determined by the classifiers suggest that this scheme would be generalizable to other mutations in lung cancer, as well as studies on driver mutations in other cancer domains.

Automatic summaries commonly present diverse linguistic problems that affect textual quality and thus their understanding by users. Few studies have tried to characterize such problems and their relation with the performance of the summarization systems. In this paper, we investigated the problems in multi-document extracts (i.e., summaries produced by concatenating several sentences taken exactly as they appear in the source texts) generated by systems for Brazilian Portuguese that have different approaches (i.e., superficial and deep) and performances (i.e., baseline and state-of-the art methods). For that, we first reviewed the main characterization studies, resulting in a typology of linguistic problems more suitable for multi-document summarization. Then, we manually annotated a corpus of automatic multi-document extracts in Portuguese based on the typology, which showed that some of linguistic problems are significantly more recurrent than others. Thus, this corpus annotation may support research on linguistic problems detection and correction for summary improvement, allowing the production of automatic summaries that are not only informative (i.e., they convey the content of the source material), but also linguistically well structured. [ABSTRACT FROM AUTHOR]

Abstractive dialogue summarization requires distilling and rephrasing key information from noisy multi-speaker documents. Combining pre-trained language models with input augmentation techniques has recently led to significant research progress. However, existing solutions still struggle to select relevant chat segments, primarily relying on open-domain and unsupervised annotators not tailored to the actual needs of the summarization task. In this paper, we propose DearWatson , a task-aware utterance-level annotation framework for improving the effectiveness and interpretability of pre-trained dialogue summarization models. Precisely, we learn relevant utterances in the source document and mark them with special tags, that then act as supporting evidence for the generated summary. Quantitative experiments are conducted on two datasets made up of real-life messenger conversations. The results show that DearWatson allows model attention to focus on salient tokens, achieving new state-of-the-art results in three evaluation metrics, including semantic and factuality measures. Human evaluation proves the superiority of our solution in semantic consistency and recall. Finally, extensive ablation studies confirm each module's importance, also exploring different annotation strategies and parameter-efficient fine-tuning of large generative language models. [ABSTRACT FROM AUTHOR]

Development of effective automatic summarization approaches for legal documents suffer from several challenges like extremely long document-summary pairs, lack of large scale training datasets with tractable document-summary token lengths, etc. In this work, we deal with the problem of legal document summarization by building a modified abstractive dataset from the original dataset. This ensures that the length of each document-summary pair is manageable and can be processed by the state of the art summarization approaches (such as BART). Secondly, we deal with the data scarcity problem by creating more number of training samples, from each of the original document-summary pair. This is done by creating multiple extractive summaries from each sample in the original dataset, following which ground-truth summary sentences are assigned to each of the extractive summary to generate new training samples. This results in a larger training dataset that can be utilized for fine-tuning summarization models. Our proposed approach has been evaluated on two different legal datasets- BillSum and Forum of Information Retrieval Evaluation (FIRE). With respect to the ROUGE metrics, the proposed approach is able to outperform pre-trained BART model fine-tuned on original dataset by (3 − 8) % for FIRE test sets, and by (1 − 3) % for the BillSum test sets. Considering the BERTScore metrics, the proposed approach obtains (1 − 2) % improvements on the FIRE test sets, while for the BillSum test sets (3 − 8) % improvements are observed. Such improvements suggest that the proposed dataset building approach can help achieve improved abstractive summarization of lengthy legal documents. • Lengthy nature and data scarcity are the two main challenges with legal documents. • Lengthy legal document summarization is handled by the proposed approach. • The data scarcity problem is handled by creating a feasible abstractive dataset. • A novel Extract-Then-Assign (ETA) approach is proposed. • ETA approach can greatly improve abstractive summarization of legal documents. [ABSTRACT FROM AUTHOR]