SemEval-2013 Task 4: Free Paraphrases of Noun Compounds
نویسندگان
چکیده
In this paper, we describe SemEval-2013 Task 4: the definition, the data, the evaluation and the results. The task is to capture some of the meaning of English noun compounds via paraphrasing. Given a two-word noun compound, the participating system is asked to produce an explicitly ranked list of its free-form paraphrases. The list is automatically compared and evaluated against a similarly ranked list of paraphrases proposed by human annotators, recruited and managed through Amazon’s Mechanical Turk. The comparison of raw paraphrases is sensitive to syntactic and morphological variation. The “gold” ranking is based on the relative popularity of paraphrases among annotators. To make the ranking more reliable, highly similar paraphrases are grouped, so as to downplay superficial differences in syntax and morphology. Three systems participated in the task. They all beat a simple baseline on one of the two evaluation measures, but not on both measures. This shows that the task is difficult.
منابع مشابه
MELODI: A Supervised Distributional Approach for Free Paraphrasing of Noun Compounds
This paper describes the system submitted by the MELODI team for the SemEval-2013 Task 4: Free Paraphrases of Noun Compounds (Hendrickx et al., 2013). Our approach combines the strength of an unsupervised distributional word space model with a supervised maximum-entropy classification model; the distributional model yields a feature representation for a particular compound noun, which is subseq...
متن کاملSemEval-2 Task 9: The Interpretation of Noun Compounds Using Paraphrasing Verbs and Prepositions
Previous research has shown that the meaning of many noun-noun compoundsN1 N2 can be approximated reasonably well by paraphrasing clauses of the form ‘N2 that . . . N1’, where ‘. . . ’ stands for a verb with or without a preposition. For example, malaria mosquito is a ‘mosquito that carries malaria’. Evaluating the quality of such paraphrases is the theme of Task 9 at SemEval-2010. This paper d...
متن کاملSFS-TUE: Compound Paraphrasing with a Language Model and Discriminative Reranking
This paper presents an approach for generating free paraphrases of compounds (task 4 at SemEval 2013) by decomposing the training data into a collection of templates and fillers and recombining/scoring these based on a generative language model and discriminative MaxEnt reranking. The system described in this paper achieved the highest score (with a very small margin) in the (default) isomorphi...
متن کاملIIIT-H: A Corpus-Driven Co-occurrence Based Probabilistic Model for Noun Compound Paraphrasing
This paper presents a system for automatically generating a set of plausible paraphrases for a given noun compound and rank them in decreasing order of their usage represented by the confidence value provided by the human annotators. Our system implements a corpusdriven probabilistic co-occurrence based model for predicting the paraphrases, that uses a seed list of paraphrases extracted from co...
متن کاملUCD-Goggle: A Hybrid System for Noun Compound Paraphrasing
This paper addresses the problem of ranking a list of paraphrases associated with a noun-noun compound as closely as possible to human raters (Butnariu et al., 2010). UCD-Goggle tackles this task using semantic knowledge learnt from the Google n-grams together with human-preferences for paraphrases mined from training data. Empirical evaluation shows that UCDGoggle achieves 0.432 Spearman corre...
متن کامل