Search

The discussion in this paper is related to extracting a single lemma from different morphological variants related to a particular dictionary root word. The existing popular online lemmatizers like the Stanford LemmaProcessor, Spacy Lemmatizer, LemmaGen, MorphAdorner, etc. generate the correct lemmas for all singular-plural nouns and all verbal words existing in different tenses, but all these lemmatizers are not able to derive the correct lemma for any type of derived words; specially for nominalized derived words. The proposed lemmatizer – 'LemmaQuest' is designed and implemented to overcome these limitations. LemmaQuest first creates distinct groups for all allied morphed words like singular-plural nouns, verbs in all tenses, and nominalized words. These groups are created based on a combination of different statistical distance measures considering all possible pairs of input words. After that, lemmas are generated for each group. The main objective of this proposed model is to extract the correct lemma for a set of a large number of input words in an optimized time, which leads to a vast improvement in text simplification, keyword extraction, text summarization and other text mining applications. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Abstract In this study, we introduce and evaluate a novel extractive text summarization methodology, “SummarEyes,” based on the visual interaction of the user with the text, using eye-tracking data, as opposed to the traditional approaches based on analysis of textual content only. We conducted a large-scale user study aiming to collect eye-tracking data while reading the text to be summarized. We utilized various user’s implicit attention metrics to generate novel eye-tracking-based text summarization models and compared them both to eye-tracking models typically using only a single feature of the gaze duration and to traditional, as well as state-of-the-art summarization methods, based solely on textual features. The models’ quality was evaluated in terms of ROUGE scores using intrinsic evaluation on the datasets we had generated, relating gaze behavior to personalized and DUC gold-standard summaries. The experimental results showed that “SummarEyes” significantly outperformed the other summarizers in predicting both the user’s personalized summarization and the generic gold standard summaries. With the increasing availability of eye-tracking technology, this research can lead to a new generation of effective user-centric text summarization tools. [ABSTRACT FROM AUTHOR]

This work proposes a sentence network-based approach for performing the task of multi-document text summarization. The sentences of the input set of documents are represented by the nodes of the network. Weighted edges are added between the nodes to represent the semantic similarity between the corresponding sentences. The network has a multilayer structure, where each layer corresponds to an individual input document. This helps in effective differentiation between the inter-document and intra-document edges. A hyperparameter, namely layering factor, has been used to alter the strength of inter-document connections through reinforcement or weakening. It is hypothesized that the summary sentence nodes must act as effective information spreaders in the sentence network. Summary generation is performed by identifying the influential nodes of the network using VoteRank scheme. A comparative study with different network measures, such as Weighted Degree, PageRank, Betweenness centrality, and Closeness centrality reveals the efficacy of the proposed VoteSumm technique for multi-document text summarization. Improved performance is observed when an additional pre-processing step of syntactic simplification is applied on the raw text. Performance is further improved when keyword information is included in the simplified texts. [ABSTRACT FROM AUTHOR]

The need for automatic text summarization (ATS) is increased manifold in recent times due to the overwhelming growth of textual data available in electronic form. However, existing ATS systems suffer from two major shortcomings. Summarizers of extractive type, that is, the ones which select important sentences of the documents in their original form as the output, tend to copy some irrelevant or unimportant parts of the input text in the output summary. On the other hand, abstractive summarizers, that is, the ones that produce a gist of the limited size of the original document, often fail to include important contents in the generated summary. Simplification of the input texts before submitting them to the ATS system(s) may obliterate the above difficulties. The present work examines the effectiveness of simplification of input for five different known ATS systems. In this work, DEPSYM++ simplifier has been used for the above purpose, which carries out four different kinds of simplification on sentences of the input text corresponding to the presence of appositive clause, relative clause, conjoint clause, and passive voice. The results obtained are found to be very encouraging when experiments were carried out on three different gold data sets and under different evaluation metrics commonly used for performance evaluation for summarizers. [ABSTRACT FROM AUTHOR]

Fuzzy Rough Sets are designed for decision-making with uncertainty, imprecision, and incompleteness in data. We propose to use Fuzzy Rough Sets for the task of sentence similarity-based Text Summarization. Text data inherently possess uncertainty, imprecision, and incompleteness for data representation. Two sentences may be equivalent in their meanings despite having different vector space representation while Fuzzy Rough Sets incorporates the meanings of sentences. Fuzzy Rough Set-based sentence similarity for Text Summarization has not been proposed in literature before the present work. The contribution of the research is two-fold, namely (i) Fuzzy Rough Set-based sentence similarities has been proposed and validated on SICK2014 dataset. (ii) The proposed similarities between the sentences are thereby proposed for Single document Text Summarization and evaluated for DUC2002 dataset. Experimental results confirm the applicability and efficiency of using the proposed models for both sentence similarity computations as well as for summarization. [ABSTRACT FROM AUTHOR]