In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation ...
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
A common task in many text mining applications is to generate a multi-faceted overview of a topic in a text collection. Such an overview not only directly serves as an informative...
Xu Ling, Qiaozhu Mei, ChengXiang Zhai, Bruce R. Sc...
Abstract. Textual reuse is an integral part of textual case-based reasoning (TCBR) which deals with solving new problems by reusing previous similar problem-solving experiences doc...
Ibrahim Adeyanju, Nirmalie Wiratunga, Juan A. Reci...