Greedy Algorithm

method ID: greedyalgorithm

Related Papers

Hypothesizing Word Association From Untagged Text

Authors: nan

Publication: TIPSTER (1993)

DOI: nan

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 …...

12905

Method for Improving Automatic Word Categorization

Authors: nan

Publication: TIPSTER (1997)

DOI: nan

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 …...

41410

Automatic Knowledge Representation using a Graph-based Algorithm for Language-Independent Lexical Chaining

Authors: nan

Publication: TIPSTER (2006)

DOI: nan

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 …...

26362

Text Summarization Model Based on Maximum Coverage Problem and its Variant

Authors: nan

Publication: TIPSTER (2009)

DOI: nan

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 …...

43277

Explore the Structure of Social Tags by Subsumption Relations

Authors: nan

Publication: TIPSTER (2010)

DOI: nan

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 …...

6325

Multi-document Summarization via Budgeted Maximization of Submodular Functions

Authors: nan

Publication: TIPSTER (2010)

DOI: nan

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 …...

23678

SATTY : Word Sense Induction Application in Web Search Clustering

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

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 …...

23210

Summarization Through Submodularity and Dispersion

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

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 …...

40184

Low-dimensional Embeddings for Interpretable Anchor-based Topic Inference

Authors: nan

Publication: TIPSTER (2014)

DOI: nan

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 …...

34456

Krimping texts for better summarization

Authors: nan

Publication: TIPSTER (2015)

DOI: nan

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 …...

34386

Monotone Submodularity in Opinion Summaries

Authors: nan

Publication: TIPSTER (2015)

DOI: nan

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 …...

34923

Phrase-based Compressive Cross-Language Summarization

Authors: nan

Publication: TIPSTER (2015)

DOI: nan

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 …...

34928

Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function

Authors: nan

Publication: TIPSTER (2018)

DOI: nan

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 …...

20878

Massively Multilingual Document Alignment with Cross-lingual Sentence-Mover’s Distance

Authors: nan

Publication: TIPSTER (2020)

DOI: nan

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 …...

353