Papers › Predicting Humorousness and Metaphor Novelty with Gaussian Process Preference Learning

Predicting Humorousness and Metaphor Novelty with Gaussian Process Preference Learning

1 Jul 2019ACL 2019 7archive 2025-07-28

Edwin Simpson, Erik-L{\^a}n Do Dinh, Tristan Miller, Iryna Gurevych

The inability to quantify key aspects of creative language is a frequent obstacle to natural language understanding. To address this, we introduce novel tasks for evaluating the creativeness of language{---}namely, scoring and ranking text by humorousness and metaphor novelty. To sidestep the difficulty of assigning discrete labels or numeric scores, we learn from pairwise comparisons between texts. We introduce a Bayesian approach for predicting humorousness and metaphor novelty using Gaussian process preference learning (GPPL), which achieves a Spearman{'}s � of 0.56 against gold using word embeddings and linguistic features. Our experiments show that given sparse, crowdsourced annotation data, ranking using GPPL outperforms best{--}worst scaling. We release a new dataset for evaluating humour containing 28,210 pairwise comparisons of 4,030 texts, and make our software freely available.

PaperPDFCode

Code

ukplab/acl2019-GPPL-humour-metaphor officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Natural Language UnderstandingWord Embeddings

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian Process

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections