Humor is an important social phenomenon, serving complex social and psychological functions. However, despite being studied for millennia humor is computationally not well understood, often considered an AI-complete problem. In this work, we introduce a novel setting in humor mining: automatically detecting funny and unusual scientific papers. We are inspired by the Ig Nobel prize, a satirical prize awarded annually to celebrate funny scientific achievements (example past winner: Are cows more likely to lie down the longer they stand?). This challenging task has unique characteristics that make it particularly suitable for automatic learning. We construct a dataset containing thousands of funny papers and use it to learn classifiers, combining findings from psychology and linguistics with recent advances in NLP. We use our models to identify potentially funny papers in a large dataset of over 630 , 000 articles. The results demonstrate the potential of our methods, and more broadly the utility of integrating state-of-the-art NLP methods with insights from more traditional disciplines. Humor is an important aspect of the way we interact with each other, serving complex social functions (Martineau, 1972). Humor can function either as a lubricant or as an abrasive: it can be used as a key for improving interpersonal relations and building trust (Wanzer et al., 1996; Wen et al., 2015), or help us work through difficult topics. It can also aid in breaking taboos and holding power to account. Enhancing the humor capabilities of computers has tremendous potential to better understand interactions between people, as well as build more natural human-computer interfaces. Nevertheless, computational humor remains a long-standing challenge in AI; It requires complex language understanding, manipulation capabilities, creativity, common sense, and empathy. Some even claim that computational humor is an AI-complete problem (Stock and Strapparava, 2002). As humor is a broad phenomenon, most works on computational humor focus on specific humor types, such as knock-knock jokes or one-liners (Mi-halcea and Strapparava, 2006; Taylor and Mazlack, 2004). In this work, we present a novel humor recognition task: identifying quirky, funny scientific contributions. We are inspired by the Ig Nobel prize 1 , a satiric prize awarded annually to ten scientific achievements that first make people laugh, and then think. Past Ig Nobel winners include Chickens prefer beautiful humans and Beauty is in the eye of the beer holder: People who think they are drunk also think they are attractive. Automatically identifying candidates for the Ig Nobel prize provides a unique perspective on humor. Unlike most humor recognition tasks, the humor involved is sophisticated, and requires common sense, as well as specialized knowledge and understanding of the scientific culture. On the other hand, this task has several characteristics rendering it attractive: the funniness of the paper can often be recognized from its title alone, which is short, with simple syntax and no complex narrative structure (as opposed to longer jokes). Thus, this is a relatively clean setting to explore our methods. We believe humor in science is also particularly interesting to explore, as humor is strongly tied to creativity. Quirky contributions could sometimes indicate fresh perspectives and pioneering attempts to expand the frontiers of science. For example, Andre Geim won an Ig Nobel in 2000 for levitating a frog using magnets and a Nobel Prize in Physics 1 improbable.com/ig-about in 2010 . Our contributions are:  We formulate a novel humor recognition task in the scientific domain. We construct a dataset containing thousands of funny scientific papers. We develop multiple classifiers, combining findings from psychology and linguistics with recent NLP advances. We evaluate them both on our dataset and in a real-world setting, identifying potential Ig Nobel candidates in a large corpus of over 0 . 6 M papers. We devise a rigorous, data-driven way to aggregate crowd workers' annotations for subjective questions. We release data and code 2 . Beyond the tongue-in-cheek nature of our application, we more broadly wish to promote combining data-driven research with more-traditional works in areas such as psychology. We believe insights from such fields could complement machine learning models, improving performance as well as enriching our understanding of the problem. Humor in the Humanities. A large body of theoretical work on humor stems from linguistics and psychology. Ruch (1992) divided humor into three categories: incongruity, sexual, and nonsense (and created a three-dimensional humor test to account for them). Since our task is to detect humor in scientific contributions, we believe that the third category can be neglected under the assumption that no-nonsense article would (or at least, should) be published (notable exception: the Sokal hoax (Sokal, 1996)). The first category, incongruity, was first fully conceptualized by Kant in the eighteenth century (Shaw, 2010). The well-agreed extensions to incongruity theory are the linguistics incongruity resolution model and semantic script theory of humor (Suls, 1972; Raskin, 1985). Both state that if a situation ended in a manner that contradicted our prediction (in our case, the title contains an unexpected term) and there exists a different, less likely rule to explain it  the result is a humorous experience. Simply put, the source of humor lies in 2 github.com/nadavborenstein/Iggy violation of expectations. Example Ig Nobel winners include: Will humans swim faster or slower in syrup? and Coordination modes in the multisegmental dynamics of hula hooping. The second category, sex-related humor is also common among Ig Nobel winning papers. Examples include: Effect of different types of textiles on sexual activity. Experimental study and Mag-netic resonance imaging of male and female genitals during coitus and female sexual arousal. Humor Detection in AI. Most computational humor detection work done in the context of AI relies on supervised or semi-supervised methods and focuses on specific, narrow, types of jokes or humor. Humor detection is usually formulated as a binary text classification problem. Example domains include knock-knock jokes (Taylor and Mazlack, 2004), one-liners (Miller et al., 2017; Simpson et al., 2019; Liu et al., 2018; Mihalcea and Strappa-rava, 2005; Blinov et al., 2019; Mihalcea and Strap-parava, 2006), humorous tweets (Maronikolakis et al., 2020; Donahue et al., 2017; Ortega-Bueno et al., 2018; Zhang and Liu, 2014), humorous product reviews (Ziser et al., 2020; Reyes and Rosso, 2012), TV sitcoms (Bertero and Fung, 2016), short stories (Wilmot and Keller, 2020), cartoons captions (Shahaf et al., 2015), and even That's what she said jokes (Hossain et al., 2017; Kiddon and Brun, 2011). Related tasks such as irony, sarcasm and satire have also been explored in similarly narrow domains (Davidov et al., 2010; Reyes et al., 2012; Ptacek et al., 2014). Our goal in this paper is to automatically identify candidates for the Ig Nobel prize. More precisely, to automatically detect humor in scientific papers. First, we consider the question of input to our algorithm. Sagi and Yechiam (2008) found a strong correlation between funny title and humorous subject in scientific papers. Motivated by this correlation, we manually inspected a subset of Ig Nobel winners. For the vast majority of them, reading the title was enough to determine whether it is funny; very rarely did we need to read the abstract, let alone the full paper. Typical past winners' titles include Why do old men have big ears? and If you drop it, should you eat it? Scientists weigh in on the 5-second rule. An example of a non-informative title is Pouring flows, a paper calculating the optimal way to dunk a biscuit in a cup of tea. Based on this observation, we decided to focus on the papers' titles . More formally: Given a title t of an article, our goal is to learn a binary function  ( t )  { 0 , 1 } , reflecting whether the paper is humorous, or Ig Nobel-worthy'. The main challenge, of course, lies in the construction of  . To take a data-driven approach to tackle this problem, we crafted a first-of-its-kind dataset containing titles of funny scientific papers 2 . We started from the 211 Ig Nobel winners. Next, we manually collected humorous papers from online forums and blogs 3 , resulting in 1 , 707 papers. We manually verified all of these papers can be used as positive examples. In Section 6 we give more indication these papers are indeed useful for our task. For negative examples, we randomly sampled 1 , 707 titles from Semantic Scholar 4 (to obtain a balanced dataset). We then classify each paper into one of the following scientific fields: neuroscience, medicine, biology, or exact sciences 5 . We balanced the dataset in a per-field manner. While some of these randomly sampled papers could, in princi-ple, be funny, the vast majority of scientific papers are not (we validated this assumption through sam-pling). In deep learning, architecture engineering largely took the place of feature engineering. One of the goals of our work is to evaluate the value of features inspired by domain experts. In this section, we describe and formalize 127 features implementing insights from humor literature. To validate the predictive power of the features that require training, we divide our data to train and test sets ( 80% / 20% ). We now describe the four major feature families. Research suggests that surprise is an important source of humor (Raskin, 1985; Suls, 1972). Indeed, we notice that titles of Ig Nobel winners often include an unexpected term or unusual language, e.g.: On the rheology of cats , Effect of coke on sperm motility and  Pigeons' discrimination of paintings by Monet and Picasso. To quantify unexpectedness, we create several different language-models (LMs): 3 E.g., reddit.com/r/ScienceHumour , popsci.com/read/funny-science-blog , goodsciencewriting.wordpress.com 4 api.semanticscholar.org/corpus/ 5 Using scimagojr.com to map venues to fields. N-gram Based LMs. We train simple N-gram LMs with n  { 1 , 2 , 3 } on two corpora  630 , 000 titles from Semantic Scholar, and 231 , 600 one-line jokes (Moudgil, 2016). Syntax-Based LMs. Here we test the hypothesis that humorous text has more surprising grammatical structure (Oaks, 1994). We replace each word in our Semantic Scholar corpus with its corresponding part-of-speech (POS) tag 6 . We then trained N-gram based LMs ( n  { 1 , 2 , 3 } ) on this corpus. Transformer-Based LMs. We use three different Transformers based (Vaswani et al., 2017) models: 1) BERT (Devlin et al., 2018) (pre-trained on Wikipedia and the BookCorpus), 2) SciBERT (Belt-agy et al., 2019), a variant of BERT optimized on scientific text from Semantic Scholar, and 3) GPT-2 (Radford et al., 2019), a large Transformer-based LM, trained on a dataset of 8 M web pages. We fine-tuned GPT-2 on our Semantic Scholar corpora (details in Appendix C.1). Using the LMs. For each word in a title, we compute the word's perplexity. For the N-gram LMs and GPT-2, we compute the probability to see the word given the previous words in the sentence ( n  1 previous words in the case of the N-gram models and all the previous words in the case of GPT-2). For the BERT-based models, we compute the masked loss of the word given the sentence. For each title, we computed the mean, maximum, and variance of the perplexity across all words in the title. Inspired by previous findings (Ruch, 1992; Gultchin et al., 2019), we hypothesize that titles of funny papers tend to be simpler (e.g., the past Ig Nobel winners: Chickens prefer beautiful humans and Walking with coffee: Why does it spill?). We utilize several simplicity measures: Length. Short titles and titles containing many short words tend to be simpler. We compute title length and word lengths (mean, maximum, and variance of word lengths in the title). Readability. We use the automated readability index (Smith and Senter, 1967). Age of Acquisition (AoA). A well-established measure for word's difficulty in psychology (Brys-baert and Biemiller, 2017), denoting word's difficulty by the age a child acquires it. We compute mean, maximum and variance AoA. AoA and Perplexity. Many basic words can be found in serious titles (e.g., water' in a hydraulics paper). Funny titles, however, contain simple words which are also unexpected . Thus, we combine AoA with perplexity. We compute word perplexity using the Semantic Scholar N-gram LMs and divide it by AoA. Higher values correspond to simpler and unexpected words. We compute the mean, maximum, minimum, and variance. According to relief theory, crude and scatological connotations are often considered humorous (Shur-cliff, 1968) (e.g., the Ig Nobel winners Duration of urination does not change with body size, Acute management of the zipper-entrapped penis). We trained a Naive Bayes SVM (Wang and Manning, 2012) classifier over a dataset of toxic and rude Wikipedia comments (Zafar, 2018), and compute title probability to be crude. Similar to the AoA feature, we believe that crude words should also be unexpected to be considered funny. As before, we divide perplexity by the word's probability of being benign. Higher values correspond to crude and unexpected words. We compute the mean, maximum, minimum, and variance. Some words (e.g., nincompoop, razzmatazz) are inherently funnier than others (due to various reasons surveyed by Gultchin et al. (2019)). It is reasonable that the funniness of a title is correlated with the funniness of its words. We measure funniness using the model of Westbury and Hollis (2019), quantifying noun funniness based on humor theories and human ratings. We measure the funniness of each noun in a title. We also multiplied perplexity and funniness (for funny and unexpected) and use the mean, maximum, minimum, and variance. As a first reality check, we plotted the distribution of our features between funny and not-funny papers (see Appendix A.1 for representative examples). For example, we hypothesized that titles of funny papers might be linguistically similar to one-liners, and indeed we saw that the one-liner LM assigns lower perplexity to funny papers. Similarly, we saw a difference between the readability scores. test 7 (see Table 1). Interestingly, all feature families include useful features. Combining perplexity with other features (e.g., surprising and simple words) was especially prominent. In the next sections, we describe how we use those features to train models for detecting Ig Nobel worthy papers. We can now create models to automatically detect scientific humor. As mentioned in Section 4, one of our goals in this paper is to compare between the NLP SOTA huge-models approach and the literature-inspired approach. Thus, we trained a binary multi-layer perceptron (MLP) classifier using our dataset (described in Section 3, see reproducibility details in Appendix C.2), receiving as input the 127 features from Section 4. We named this classifier Iggy' , after the Ig Nobel prize. As baselines representing the contemporary NLP approach (requiring huge compute and training data), we used BERT (Devlin et al., 2018) and SciBERT (Beltagy et al., 2019), which is a BERT variant optimized on scientific corpora, rendering it potentially more relevant for our task. We fine-tuned SciBERT and BERT for Ig Nobel classification using our dataset (see Appendix C.3 for implementation details). We also experimented with two models combining BERT/SciBERT with our features (see Figure 6 in Appendix C.4), denoted as BERT f / SciBERT f . In the spirit of the original BERT paper, we added two linear layers on top of the models and used a standard cross-entropy loss. The input to this final MLP is the concatenation of two vectors: our features' embedding and the last hidden vector from BERT/SciBERT ([CLS]). See Appendix C.4 for implementation details. For the sake of completeness, we note that we also conducted exploratory experiments with simple syntactic baselines (title length, maximal word length, title containing a question, title containing a colon) as well as BERT trained on sarcasm detection 8 . None of these baselines was strong enough on its own. We note that the colon-baseline tended to catch smart-aleck titles, but the topic was not necessarily funny. The sarcasm baseline achieved near guess-level accuracy ( 0 . 482 ), emphasizing the distinction between the two humor tasks. We first evaluate the five models (Iggy, SciBERT, BERT, SciBERT f and BERT f ) on our labeled dataset in terms of general accuracy and Ig Nobel retrieval ability. As naive baselines, we added two bag of words (BoW) based classifies: random forest (RF) and logistic regression (LR). Accuracy. We randomly split the dataset to train, development, and test sets ( 80%  10%  10% ), and used the development set to tune hyper-parameters (e.g., learning rate, number of training epochs). Table 2 summarizes the results. We note that all five models achieve very high accuracy scores and that the simple BoW models fall behind. This gives some indication about the inherent difficulty of the task. Both features-based Iggy and BERT-based models outperform simple baseline. SciBERT f outperforms the other models across all measures. Ig Nobel Winners Retrieval. Our positive examples consist of 211 Ig Nobel winners and additional 1 , 496 humorous papers found on the web. Thus, the portion of real Ig Nobel winning papers in our data is relatively small. We now measure whether our web-originated papers serve as a good proxy for Ig Nobel winners. Thus, we split the dataset differently: the test set consists of the 211 Ig Nobel winners, plus a random sample of 211 negative titles (slightly increasing the test set size to 12 %). Train set consists of the remaining 2 , 992 papers. This experiment follows our initial inspiration of finding Ig Nobel-worthy papers, as we test our models' ability to retrieve only the real winners. Table 3 demonstrate that our web-based funny papers are indeed a good proxy for Ig Nobel winners. Similar to the previous experiment, the combination of SOTA pretrained models with literature based features is superior. we test our models in a more realistic setting; we run them on a large sample of scientific papers, ranking each paper according to their certainty in the label (humorous'), and identifying promising candidates. We use the same dataset of 630 k papers from Semantic Scholar used for training the LMs (Section 4). We compute funniness according to our models (excluding random forest and logistic regression, which performed poorly). Table 4 shows examples of top-rated titles. We use the Amazon Mechanical Turk (MTurk) crowdsourcing platform to assess models' performance. In an exploratory study, we asked people to rate the funniness of titles on a Likert scale of 1 5 . We noted that people tended to confuse funny research topic and funny title . For example, titles like Are you certain about SIRT? or NASH may be trash received high funniness scores, even though the research topic is not even clear from the title. To mitigate this problem, we redesigned the study to include two 5 -point Likert scale questions: 1) whether the title is funny, and 2) whether the research topic is funny. This addition seems to indeed help workers understand the task better. Example papers rated as serious title, funny topic include Hat-wearing patterns in spectators attending baseball games: a 10 -year retrospective comparison. Funny title, serious topic include Slicing the psychoanalytic pie: or, shall we bake a new one? Commentary on Greenberg. Unless stated otherwise, the evaluation in the reminder of the paper was done on the funny topic Likert scale. We paid crowd workers $0 . 04 per title. As this task is challenging, we created a qualification test with 4 titles ( 8 questions), allowing for one mistake. The code for task and test can be found in the repository 2 . We also required workers to have completed at least 1 , 000 approved HITs with at least 97% success rate. All algorithms classified and ranked (according to certainty) all 630 k papers. However, in any reasonable use-case, only the top of the ranked list will ever be examined. There is a large body of work, both in academia and industry, studying how people interact with ranked lists (in particular, search result pages) (Kelly and Azzopardi, 2015; Beus, 2020). Many information retrieval algorithms assume the likelihood of the user examining a result to exponentially decrease with rank. The conventional wisdom is that users rarely venture into the second page of search results. Thus, we posit that in our scenario of Ig Nobel recommendations, users will be willing to read only the several tens of results. We choose to evaluate the top300 titles for each of our five models, to study (in addition to the performance at the top of the list) how performance decays. We also included a baseline of 300 randomly sampled titles from Semantic Scholar. Altogether we evaluated 1375 titles (due to overlap). Each title was rated by five crowd workers. Overall, 13 different workers passed our test. Seven workers annotated less than 300 titles, while four annotated above 1 , 300 each. Decision rule. Each title was rated by five different crowd workers on a 1 5 scale. There are several reasonable ways to aggregate these five continuous scores to a binary decision. A commonly-used aggregation method is the majority vote. The majority vote should return the clear-cut humorous titles. However, we stress that humor is very subjective Decision rule Threshold Expert corr. (and in the case of scientific humor, quite subtle). Indeed, annotators had low agreement on the topic question (average pairwise Spearman  = 0 . 27 ). Thus, we explored more aggregation methods 9 . Our hypothesis class is of the general form at least k annotators gave a score at least m  10 . To pick the best rule, we conducted two exploratory experiments: In the first one, we recruited an expert scien-tist and thoroughly trained him on the problem. He then rated 90 titles and we measured the correlation of different aggregations with his ratings. Results are summarized in table 5: The highest-correlation aggregation is when at least one annotator crossed the 3 threshold (Spearman  = 0 . 7 ). In the second experiment, we used the exact same experimental setup as the original task, but with labeled data. We used 100 Ig Nobel winners as positives and a random sample of 100 papers as negatives. The idea was to see how crowd workers rate papers that we know are funny (or not). Table 5 shows the accuracy of each aggregation method. Interestingly, the highest accuracy is achieved with the same rule as in the first experiment (at least one crossing 3 ). Thus, we chose this aggregation rule. We believe the method outlined in this section could be more broadly applicable to aggregation of crowd sourced annotations for subjective questions. Results. Figure 1 shows precision at k for the top-rated 300 titles according to each model. The random baseline is  0 . 03 . Upon closer inspection, these seem to be false positives of the annotation. 9 For completeness, see Figure 3 in Appendix A.2. 10 There is a long-running debate about whether it is valid to average Likert scores. We believe we cannot treat the ratings in this study as interval data. In this range, Iggy slightly outperforms the other four models (BERT is particularly bad, as it picks up on short, non-informative titles). For larger k values SciBERT and BERT f take the lead. We note that even at k = 300 , all models still achieve considerable (absolute) precision. We obtain similar results using normalized discounted cumulative gain (nDCG), a common measure for ranking quality (see Table 6 for nDCG scores for the top 50 and the 300 papers). Overall, these relatively high scores suggest that our models are able to identify funny papers. We stress that Iggy is a small and simple network (  33 k parameters), compared to pretrained 110 million parameters BERT-based models. Yet despite its simplicity, Iggy's performance is roughly comparable to BERT-based methods. We believe this demonstrates the power of implementing insights from domain experts. We hypothesize that if the fine-tuning dataset were larger, BERT f and SciBERT f would outperform the other models. Taking a closer look at the actual papers in the experiment of Section 7, the overlap between the three feature-based models is 26  56% (for 1 < k < 50 ) and 39  62% (for 1 < k < 300 ). BERT had very low overlaps with all other models ( 0% in top 50, 10% in all 300). SciBERT had almost no overlap in top 50 (maximum 2% ), 10  40% in all 300 (see full details in Appendix A.3). We believe this implies that the features were indeed important and informative for both BERT f and SciBERT f . We have seen Iggy performs surprisingly well, given its relative simplicity. In this section, we Figure 1: Precision at k for our chosen decision rule. wish to better understand the reasons. We chose to analyze Iggy with Shapely additive explanations (SHAP) (Lundberg and Lee, 2017). SHAP is a feature attribution method to explain the output of any black-box model, shown to be superior to more traditional feature importance methods. Importantly, SHAP provides insights both globally and locally (i.e., for specific data points). Global interpretability. We compute feature importance globally. Among top contributing features we see multiple features corresponding to incongruity (both alone and combined with funniness) and to word/sentence simplicity. Interestingly, features based on the one-liner jokes seem to play an important role (See Figure 4 in Appendix A.4). Local interpretability. To understand how Iggy errs, we examined the SHAP decision plots for false positives and false negatives (See Figure 5 in Appendix A.4). These show the contribution of each feature to the final prediction for a given title, and thus can help debugging the model. Looking at false negatives, it appears that various perplexity features misled Iggy, while funniness and joke LM steered it in the right direction. We see a contrary trend in false positives: perplexity helped, and joke LM confused the classifier. We also observe that the model learned that a long title is an indication of a serious paper. We expected our rudeness classifier to play a bigger role in some of the titles (e.g., Adaptive interpopulation differences in blue tit life-history traits on Corsica), but the signal was inconclusive, perhaps indicating our rudeness classifier is lacking. We now take a more qualitative approach to understand the models. First, we set out to explore whether the models confuse funny titles and funny topics. Using the crowd sourced annotations from Section 7, we measure the portion of this mistake in the top-rated 300 titles of all five models. That is, we check in how many cases our models classify a title as Ig Nobel-worthy while the workers have classified it as funny title and non-funny topic. Iggy had the highest degree of such confusion ( 0 . 28 ). Similarly, BERT f and SciBERT f exhibit more confusion than the versions without features ( 0 . 24 , 0 . 19 compared to 0 . 13 , 0 . 08 ). Random baseline is 0 . 02 . Examples of this kind of error include A victim of the Occam's razor., While waiting to buy a Ferrari, do not leave your current car in the garage!, and Reinforcement learning: The good, the bad and the ugly?. All were classified as Ig Nobel-worthy, although their topic is serious (or even unclear from the title). Looking closer at the data, we observe that a high portion of these are editorials with catchy titles. As our dataset does not differentiate between editorials and real research contributions, filtering editorials is not straightforward. Interestingly, the portion of editorials is also greater in the lowest annotators' agreement area, hinting that this confusion also occurs in humans. In addition to editorials, we notice another category of papers causing the same type of confusion. There are papers dealing with disturbing or unfortunate topics (violence, death, sexual abuse), whose titles include literary devices used to lighten the mood. Censored (for the readers' own wellbeing) examples include Licorice for hepatitis C: yum-yum or just ho-hum?, The song of the siren: Dealing with masochistic thoughts and behaviors. A note on scientific disciplines. Another observation we make concerns with the portion of Ig Nobel-worthiness across the different scientific disciplines. We notice that most papers classified by our models as funny belong to social sciences (Dogs can discriminate human smiling faces from blank ex-pressions) or medicine (What, if anything, can monkeys tell us about human amnesia when they can't say anything at all?), compared to exact sciences (The kinematics of eating with a spoon: bringing the food to the mouth, or the mouth to the food?). We believe this might be the case since, quite often, social sciences and medicine papers study topics that are more familiar to the layperson. We also note that although our models performed about the same across the different disciplines, they were slightly better in psychology. In this work, we presented a novel task in humor recognition  detecting funny and unusual scientific papers, which represents a subtle and sophisticated humor type. It has important characteristics (short, simple syntax, stand-alone) making it a (relatively) clean setting to explore computational humor. We created a dataset of funny papers and constructed models, distilling humor literature into features as well as harnessing SOTA advances in NLP. We conducted experiments both on our dataset and in a real-world setting, identifying funny papers in a corpus of over 0 . 6 M papers. All models were able to identify funny papers, achieving high nDCG scores. Interestingly, despite the simplicity of the literature-based Iggy, its performance was overall comparable to complex, BERT-based models. Our dataset can be further used for various humor related tasks. For example, it is possible to use it to create an aligned corpus, pairing every funny paper title with a nearly identical but serious title, using methods similar to West and Horvitz (2019). This would allow us to understand why a paper is funny at a finer granularity, by identifying the exact words that make the difference. This technique will also allow exploring different types of funny. Another possible use of our dataset is to collect additional meta-data about the papers (e.g., citations, author information) to explore questions about whether funny science achieves disproportionate attention and engagement, who tends to produce it (and at which career stage), with implications to science of science and science communication. Another interesting direction is to expand beyond paper titles and consider the paper abstract, or even full text. This could be useful in examples such as the Ig Nobel winner Cure for a Headache, which takes inspiration from woodpeckers to help cure headaches in humans. Finally, we believe multi-task learning is a direction worth pursuing towards creating a more holistic and robust humor classifier. In multi-task learning, the learner is challenged to solve multiple problems at the same time, often resulting in better generalization and better performance on each individual task (Ruder, 2017). As multi-task learning enables unraveling cross-task similarities, we believe it might be particularly fruitful to apply to tasks highlighting different aspects of humor. We believe our dataset, combined with other task specific humor datasets, could assist in pursuing such a direction. Despite the tongue-in-cheek nature of our task, we believe that computational humor has tremendous potential to create personable interactions, and can greatly contribute to a range of NLP applications, from chatbots to educational tutors. We also wish to promote complementing data-driven research with insights from more-traditional fields. We believe combining such insights could, in addition to improving performance, enrich our understanding of core aspects of being human. We thank the reviewers for their insightful comments. We thank Omri Abend, Michael Doron and Meirav Segal, Ronen Tamari and Moran Mizrahi for their help, and Shuki Cohen for preliminary discussions. This work was supported by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant no. 852686, SIAM), US National Science Foundation, US-Israel Binational Science Foundation (NSF-BSF) grant no. 2017741, and Amazon Research Awards.
abstain abstain objective abstain abstain method method objective abstain result abstain abstain abstain abstain abstain objective objective abstain abstain abstain abstain objective objective abstain abstain objective method objective method objective abstain abstain method result other other other objective other other abstain other other other other other other other other other abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain method abstain method abstain abstain abstain method abstain abstain abstain method abstain method abstain abstain method method abstain method abstain abstain abstain abstain abstain method abstain method method abstain method abstain method abstain method abstain abstain method abstain abstain abstain method method abstain method abstain method method method abstain method abstain abstain method method method abstain abstain abstain abstain abstain abstain method method abstain abstain abstain method abstain abstain method abstain abstain method abstain abstain abstain abstain method abstain method abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain method method method abstain method abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain method method method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain method method abstain abstain abstain method method abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain method method abstain abstain abstain abstain abstain abstain method abstain method abstain method abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method method objective abstain method method abstain abstain abstain method abstain method abstain objective abstain abstain method abstain result method objective abstain result other other other