{'fraction_non_alphanumeric': 0.0277602523659306, 'fraction_numerical': 0.005047318611987382, 'mean_word_length': 5.395161290322581, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Graph-Based Fuzzy Logic for Extractive Text Summarization (GFLES)

High accuracy models for automatic text summarization are increasingly required due to the overwhelming growth of available text on the internet. In this paper, a new unsupervised approach for Automatic Text Summarization (ATS) employing Fuzzy Logic (FL) to optimize summary generation is proposed. The approach is extractive, graph-based and is applicable for both single and multiple documents. Our Graph-based Fuzzy Logic Extractive Text Summarization (GFLES) approach consists of five main stages: text pre-processing, text representation using graph model, features extraction during graph construction, sentence clustering using our previously developed Graph-based Growing Self-Organizing Map (G-GSOM) and lastly, sentences are ranked using FL and a summary is generated. GFLES is distinctive from other approaches by its four advantages: 1) employment of the graph model for features extraction, 2) a better substitute of Vector Space Model (VSM), 3) appreciating the importance of sub-topics of text by taking them into account before generating the summary by clustering sentences and 4) applicable to both single and multiple documents. Moreover, the use of FL on each cluster at the same time provides a foundation for further development of GFLES to be applied on big data. Using the DUC 2004 dataset, our experimental results demonstrate that GFLES is able to generate comprehensive text summaries. These results establish the potential of GFLES as a high accuracy model for automatic text summarization.