Greedy Algorithm
Related Papers
Hypothesizing Word Association From Untagged Text
This paper reports a new method for suggesting word associations, based on a greedy algorithm that employs Chi- square statistics on joint frequencies of pairs of word groups compared against …...
Method for Improving Automatic Word Categorization
This paper presents a new approach to automatic word categorization which im- proves both the efficiency of the algorithm and the quality of the formed clusters. The unigram and the …...
Automatic Knowledge Representation using a Graph-based Algorithm for Language-Independent Lexical Chaining
Lexical Chains are powerful representa- tions of documents. In particular, they have successfully been used in the field of Automatic Text Summarization. How- ever, until now, Lexical Chaining algo- rithms …...
Text Summarization Model Based on Maximum Coverage Problem and its Variant
We discuss text summarization in terms of maximum coverage problem and its vari- ant. We explore some decoding algorithms including the ones never used in this sum- marization formulation, such …...
Explore the Structure of Social Tags by Subsumption Relations
Thanks to its simplicity, social tagging system has accumulated huge amount of user contributed tags. However, user contributed tags lack explicit hierarchi- cal structure, while many tag-based ap- plications would …...
Multi-document Summarization via Budgeted Maximization of Submodular Functions
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 efficiently solve the budgeted …...
SATTY : Word Sense Induction Application in Web Search Clustering
The aim of this paper is to perform Word Sense induction (WSI); which clusters web search results and produces a diversified list of search results. It describes the WSI system …...
Summarization Through Submodularity and Dispersion
We propose a new optimization frame- work for summarization by generalizing the submodular framework of (Lin and Bilmes, 2011). In our framework the sum- marization desideratum is expressed as a …...
Low-dimensional Embeddings for Interpretable Anchor-based Topic Inference
The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy al- gorithm often selects …...
Krimping texts for better summarization
Automated text summarization is aimed at extracting essential information from orig- inal text and presenting it in a minimal, often predefined, number of words. In this paper, we introduce a …...
Monotone Submodularity in Opinion Summaries
Opinion summarization is the task of pro- ducing the summary of a text, such that the summary also preserves the sentiment of the text. Opinion Summarization is thus a trade-off …...
Phrase-based Compressive Cross-Language Summarization
The task of cross-language document summarization is to create a summary in a target language from documents in a dif- ferent source language. Previous meth- ods only involve direct extraction …...
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
AbstractSubmodular maximization with the greedy algorithm has been studied as an effective approach to extractive summarization. This approach is known to have three advantages: its applicability to many useful submodular …...
Massively Multilingual Document Alignment with Cross-lingual Sentence-Mover’s Distance
AbstractDocument alignment aims to identify pairs of documents in two distinct languages that are of comparable content or translations of each other. Such aligned data can be used for a …...