Wriggly, squiffy, lummox, and boobs: What makes some words funny?
Bibliographic record
Abstract
Theories of humor tend to be post hoc descriptions, suffering from insufficient operationalization and a subsequent inability to make predictions about what will be found humorous and to what extent. Here we build on the Engelthaler & Hills' (2017) humor rating norms for 4,997 words, by analyzing the semantic, phonological, orthographic, and frequency factors that play a role in the judgments. We were able to predict the original humor rating norms and ratings for previously unrated words with greater reliability than the split half reliability in the original norms, as estimated from splitting those norms along gender or age lines. Our findings are consistent with several theories of humor, while suggesting that those theories are too narrow. In particular, they are consistent with incongruity theory, which suggests that experienced humor is proportional to the degree to which expectations are violated. We demonstrate that words are judged funnier if they are less common and have an improbable orthographic or phonological structure. We also describe and quantify the semantic attributes of words that are judged funny and show that they are partly compatible with the superiority theory of humor, which focuses on humor as scorn. Several other specific semantic attributes are also associated with humor. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.016 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".