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.

Input: Consider Input: This paper presents a system which creates and visualizes probabilistic semantic links between concepts in a thesaurus and classes in a classification system. For creating the links, we build on the Polylingual Labeled Topic Model (PLL-TM) [6]. PLL-TM identifies probable thesaurus descriptors for each class in the classification system by using information from the natural language text of documents, their assigned thesaurus descriptors and their designated classes. The links are then presented to users of the system in an interactive visualization, providing them with an automatically generated overview of the relations between the thesaurus and the classification system. Lisa Posch GESIS – Leibniz Institute for the Social Sciences Cologne, Germany Institute for Web Science and Technologies University of Koblenz-Landau, Germany E-mail: lisa.posch@gesis.org Philipp Schaer GESIS – Leibniz Institute for the Social Sciences Cologne, Germany E-mail: philipp.schaer@gesis.org Arnim Bleier GESIS – Leibniz Institute for the Social Sciences Cologne, Germany E-mail: arnim.bleier@gesis.org Markus Strohmaier GESIS – Leibniz Institute for the Social Sciences Cologne, Germany Institute for Web Science and Technologies University of Koblenz-Landau, Germany E-mail: markus.strohmaier@gesis.org

Output: A System for Probabilistic Linking of Thesauri and Classification Systems


Input: Consider Input: We study truthful mechanisms for matching and related problems in a partial information<lb>setting, where the agents’ true utilities are hidden, and the algorithm only has access to ordi-<lb>nal preference information. Our model is motivated by the fact that in many settings, agents<lb>cannot express the numerical values of their utility for different outcomes, but are still able<lb>to rank the outcomes in their order of preference. Specifically, we study problems where the<lb>ground truth exists in the form of a weighted graph of agent utilities, but the algorithm can<lb>only elicit the agents’ private information in the form of a preference ordering for each agent<lb>induced by the underlying weights. Against this backdrop, we design truthful algorithms to<lb>approximate the true optimum solution with respect to the hidden weights. Our techniques<lb>yield universally truthful algorithms for a number of graph problems: a 1.76-approximation<lb>algorithm for Max-Weight Matching, 2-approximation algorithm for Max k-matching, a 6-<lb>approximation algorithm for Densest k-subgraph, and a 2-approximation algorithm for Max<lb>Traveling Salesman as long as the hidden weights constitute a metric. We also provide im-<lb>proved approximation algorithms for such problems when the agents are not able to lie about<lb>their preferences. Our results are the first non-trivial truthful approximation algorithms for<lb>these problems, and indicate that in many situations, we can design robust algorithms even<lb>when the agents may lie and only provide ordinal information instead of precise utilities.

Output: Truthful Mechanisms for Matching and Clustering in an Ordinal World


Input: Consider Input: We develop a probabilistic latent-variable model to discover semantic frames—types of events and their participants—from corpora. We present a Dirichlet-multinomial model in which frames are latent categories that explain the linking of verb-subject-object triples, given document-level sparsity. We analyze what the model learns, and compare it to FrameNet, noting it learns some novel and interesting frames. This document also contains a discussion of inference issues, including concentration parameter learning; and a small-scale error analysis of syntactic parsing accuracy. Note: this work was originally posted online October 2012 as part of CMU MLD’s Data Analysis Project requirement. This version has no new experiments or results, but has added some discussion of new related work.


Output: Learning Frames from Text with an Unsupervised Latent Variable Model