In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

[Q]: We consider the problem of using sentence compression techniques to facilitate queryfocused multi-document summarization. We present a sentence-compression-based framework for the task, and design a series of learning-based compression models built on parse trees. An innovative beam search decoder is proposed to efficiently find highly probable compressions. Under this framework, we show how to integrate various indicative metrics such as linguistic motivation and query relevance into the compression process by deriving a novel formulation of a compression scoring function. Our best model achieves statistically significant improvement over the state-of-the-art systems on several metrics (e.g. 8.0% and 5.4% improvements in ROUGE-2 respectively) for the DUC 2006 and 2007 summarization task.
[A]: A Sentence Compression Based Framework to Query-Focused Multi-Document Summarization

[Q]: Dawid, Kjrerulff & Lauritzen (1994) provided a preliminary description of a hybrid between Monte-Carlo sampling methods and exact lo cal computations in junction trees. Utiliz ing the strengths of both methods, such hy brid inference methods has the potential of expanding the class of problems which can be solved under bounded resources as well as solving problems which otherwise resist ex act solutions. The paper provides a detailed description of a particular instance of such a hybrid scheme; namely, combination of ex act inference and Gibbs sampling in discrete Bayesian networks. We argue that this com bination calls for an extension of the usual message passing scheme of ordinary junction trees.
[A]: HUGS: Combining Exact Inference and Gibbs Sampling in Junction Trees

[Q]: There is a vast amount of unstructured Arabic information on the Web, this data is always organized in semi-structured text and cannot be used directly. This research proposes a semi-supervised technique that extracts binary relations between two Arabic named entities from the Web. Several works have been performed for relation extraction from Latin texts and as far as we know, there isn't any work for Arabic text using a semi-supervised technique. The goal of this research is to extract a large list or table from named entities and relations in a specific domain. A small set of a handful of instance relations are required as input from the user. The system exploits summaries from Google search engine as a source text. These instances are used to extract patterns. The output is a set of new entities and their relations. The results from four experiments show that precision and recall varies according to relation type. Precision ranges from 0.61 to 0.75 while recall ranges from 0.71 to 0.83. The best result is obtained for (player, club) relationship, 0.72 and 0.83 for precision and recall respectively.
[A]:
EXTRACTING ARABIC RELATIONS FROM THE WEB