Search

This study introduces a hybrid text summarization technique designed to enhance the analysis of qualitative feedback from online educational surveys. The technique was implemented at the Hellenic Open University (HOU) to tackle the challenges of processing large volumes of student feedback. The TextRank and Walktrap algorithms along with GPT-4o mini were used to analyze student comments regarding positive experiences, study challenges, and suggestions for improvement. The results indicate that students are satisfied with tutor–student interactions but concerns were raised about educational content and scheduling issues. To evaluate the proposed summarization approach, the G-Eval and DeepEval summarization metrics were employed, assessing the relevance, coherence, consistency, fluency, alignment, and coverage of the summaries. This research addresses the increasing demand for effective qualitative data analysis in higher education and contributes to ongoing discussions on student feedback in distance learning environments. By effectively summarizing open-ended responses, universities can better understand student experiences and make informed decisions to improve the educational process. [ABSTRACT FROM AUTHOR]

Text summarisation reduces text length while retaining important information, helping individuals, especially students, in managing information overload during research or assignments. However, existing text summarisation methods often lose important details, generate irrelevant or redundant sentences, or produce incoherent summaries. This study introduces a hybrid approach, LongT5Rank (coined in this study), which combines TextRank, an extractive summarisation algorithm, with LongT5, an abstractive summarisation algorithm, to automate the summarisation process. TextRank utilizes GloVe, a pre-trained word embedding model, and PageRank, a graph-based ranking algorithm, to select representative sentences. LongT5, an encoder-decoder transformer model, condenses extracted sentences into a concise and coherent summary, handling input sequences up to 16,384 tokens, for long-range sequence-to-sequence tasks. The LongT5Rank approach has shown significant achievements, including a minimum 60% compression rate, a minimum 0.6 semantic textual similarity score, and an improved F-measure compared to employing TextRank alone. Furthermore, it received positive feedback from Human Level Performance (HLP), underlining the importance of evaluating results directly from human users. This emphasizes the belief that the performance of the proposed solution should be assessed natively by humans. By combining both extractive and abstractive methods, LongT5Rank excels in generating accurate and coherent summaries. [ABSTRACT FROM AUTHOR]

Software development would have to include automated testing to ensure the finished product and performs as intended. However, the process of test case generation and maintenance can be time-consuming and error-prone, especially when manual methods are used. This research proposes a new approach to improve the efficiency and accuracy of automated testing using latent semantic analysis (LSA)-based TextRank (TR) and particle swarm optimization (PSO) algorithms. The study aims to evaluate the effectiveness of these algorithms in generating and optimizing test cases based on requirements analysis. To retrieve key information from the criteria, methods including text classification (TC), named entity recognition (NER), and sentiment analysis (SA) are used to evaluate the text. Test cases are then generated using LSA-based TR for text summarization and PSO for optimization. The aim of this work is to identify any limitations that need to be addressed and to evaluate the overall efficiency and accuracy of automated testing (AT) using proposed algorithms. The results of this research are expected to have important implications for the software industry, helps to improve the overall efficiency and accuracy of AT. The findings could guide future research that led to the creation of more advanced and effective tools for AT. [ABSTRACT FROM AUTHOR]

The length of a news article may influence people’s interest to read the article. In this case, text summarization can help to create a shorter representative version of an article to reduce people’s read time. This paper proposes to use weighted word embedding based on Word2Vec, FastText, and bidirectional encoder representations from transformers (BERT) models to enhance the TextRank summarization algorithm. The use of weighted word embedding is aimed to create better sentence representation, in order to produce more accurate summaries. The results show that using (unweighted) word embedding significantly improves the performance of the TextRank algorithm, with the best performance gained by the summarization system using BERT word embedding. When each word embedding is weighed using term frequency-inverse document frequency (TF-IDF), the performance for all systems using unweighted word embedding further significantly improve, with the biggest improvement achieved by the systems using Word2Vec (with 6.80% to 12.92% increase) and FastText (with 7.04% to 12.78% increase). Overall, our systems using weighted word embedding can outperform the TextRank method by up to 17.33% in ROUGE-1 and 30.01% in ROUGE-2. This demonstrates the effectiveness of weighted word embedding in the TextRank algorithm for text summarization. [ABSTRACT FROM AUTHOR]

Text summarization techniques offer a way to address the significant challenges faced by clinicians and researchers due to the exponential growth of information in healthcare on the internet. By condensing lengthy text into concise summaries, these techniques facilitate faster, easier, and convenient access to relevant information. This is particularly beneficial in use cases such as online user feedback/reviews about drugs, where valuable insights can be obtained that extend beyond clinical trials and observational studies. This paper comprehensively evaluates six widely used text summarization techniques (LSA, Luhn's Method, Text Rank, T5 Transformer, and Kullback-Leibler, BERT) in extracting key insights, themes and patterns about drugs from online drug reviews. The evaluation considers both quantitative and qualitative aspects, focusing on their applicability to the challenging medical terminology, which is known for its inherent intricacies and complexities. The findings of this study showed the performance of text summarization techniques using metrics such as F1 score, Recall, and Precision, focused on the unigram, bigram, and trigram overlap between the generated text summaries and the reference summaries, utilizing the ROUGE-1, ROUGE-2, and ROUGE-L evaluation methods. It is shown that results showed TextRank to be the most effective text summarization method followed by BERT when working with Medical Terminology in Healthcare & Biomedical Informatics, given its complex hierarchy and extensive vocabulary of medical terms. [ABSTRACT FROM AUTHOR]

The research about automatic text summarization is common in English text. According to the previous study, automatic text summarization in Bahasa Indonesia is still challenging due to research in this area, especially the research which discusses TextRank algorithm performance, which is still meagerly. Accordingly, this research observes the performance of the TextRank algorithm to summarize the text in Bahasa Indonesia. The TextRank algorithm summarizes a text by sorting out the essential words and relevant sentences regardless of the source language. This algorithm uses a vertex to represent a word. The similarity measurement process will calculate the overlapping words (the same word between two vertices). These overlapping words are represented by the edge, which connects the vertices. Thus, the text forms a graph. This research focuses on the similarity measurement process to determine relevant sentences in a text. As the similarity measurement is critical for the summarization result, this research switches the original process to the Levenshtein Distance algorithm and observes its performance. This research uses the human-produced summarized text by the expert in Bahasa Indonesia linguistics to evaluate the result. The evaluation method is conducted by using ROUGE-1 and ROUGE-2. The result shows that the average of ROUGE-1 and ROUGE-2 for the TextRank algorithm is 0.439 and 0.3186, respectively. Meanwhile, the modified TextRank obtains 0.3999 and 0.2805, respectively. Both of the algorithms have not shown satisfactory results as expected. [ABSTRACT FROM AUTHOR]

Cross-Lingual Summarizer develops a gist of the extract written in English in the National Language of India Hindi. This helps non-anglophonic people to understand what the text says in Hindi. The extractive method of summarization is being used in this paper for summarizing the article. The summary generated in English is then translated into Hindi and made available for Hindi Readers. The Hindi readers get the heart of the article they want to read. Due to the Internet's explosive growth, access to a vast amount of information is now efficient but getting harder and harder. An approach to text extraction summarization that captures the aboutness of the text document was discussed in this paper. One of the many uses for natural language processing (NLP) that significantly affects our daily lives is text summarization. Who has the time to read through complete articles, documents, or books to determine whether they are helpful with the expansion of digital media and the profusion of articles published? The technique was created using TextRank, which was determined using the idea of PageRank established for each page on a website. The presented approach builds a graph with sentences as nodes and the weight of the edge connecting two sentences as its nodes. Modified inverse sentence-cosine frequency similarity gives different words in a sentence different weights. The success of the procedure is demonstrated by the performance evaluation that supported the summary technique. [ABSTRACT FROM AUTHOR]

Aiming at the traditional graph models for text summarization only focus on statistical features or shallow semantic features, and lack mining and utilization of deep topic semantic features, this paper proposed MDSR( multi-dimension summarization rank), an automatic text summarization method that combined topic feature. Specifically, this method adopted the LDA model to mine the semantic information of text topics and measured the impact of topic feature on a sentence by defining the importance of the topic. And it improved the construction mode of the probability transition matrix of graph model nodes by combining the topic feature with statistic features and inter-sentence similarity. Finally, it extracted and measured summarization according to the weight of sentence nodes. The results show that the ROUGE value evaluates by MDSR reaches the best when the weight ratio of topic feature, statistic feature and inter-sentence similarity is 3 : 4 : 3. The ROUGE-1, ROUGE-2, ROUGE-SU4 are 53. 35%,35. 18% and 33. 86%, which perform better than other comparisons. It shows that the text summarization method combining topic feature can effectively improve the accuracy of the summarization extraction. [ABSTRACT FROM AUTHOR]

The method of Chinese existing automatic text summarization mainly utilizes the text's own information, and its defect is that it cannot make full use of the related semantic information between the words. Therefore, this paper proposed an improved Chinese text summarization method. This method integrated the information of the external corpora into the TextRank algorithm in the form of a word vector. Combined TextRank with word2vec, it mapped each word in the sentence to the high dimensional lexicon to form a sentence vector. This method fully considered the similarity between sentences, the coverage of keywords and the similarity between sentence and title to calculate the influence weights among sentences, and choose the top-ranked sentences used as the summarization of the text. The results of experiment show that this method achieves good results in the data set of this paper, and is more effective than the original method in extracting Chinese summarization automatically. [ABSTRACT FROM AUTHOR]