Google Ngrams

This paper addresses the problem of rank- ing a list of paraphrases associated with a noun-noun compound as closely as possi- ble to human raters (Butnariu et al., 2010). UCD-Goggle …...

Resolving coordination ambiguity is a clas- sic hard problem. This paper looks at co- ordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are reporting impressive …...

We present the PONG method to compute selectional preferences using part-of-speech (POS) N-grams. From a corpus labeled with grammatical dependencies, PONG learns the distribution of word relations for each POS …...

We present the approach we took for our par- ticipation to the WMT12 Quality Estimation Shared Task: our main goal is to achieve rea- sonably good results without appeal to …...

We present the 1.0 release of our para- phrase database, PPDB. Its English portion, PPDB:Eng, contains over 220 million para- phrase pairs, consisting of 73 million phrasal and 8 million …...

This paper presents our contribution to the SemEval-2015 Task 7. The task was subdi- vided into three subtasks that consisted of au- tomatically identifying the time period when a piece …...

AbstractThis paper describes our system, entitled Idiom Savant, for the 7th Task of the Semeval 2017 workshop, “Detection and interpretation of English Puns”. Our system consists of two probabilistic models …...