Abstract
Here we present a model of a subtype of one-line jokes (not puns) that describes the relationship between the connector (part of the set-up) and the disjunctor (often called the punchline). This relationship is at the heart of what makes this common type of joke humorous. We have implemented this model in a system, DisS (Disjunctor Selector), which, given a joke set-up, can select the best disjunctor from a list of alternatives. DisS agrees with human judges on the best disjunctor for one typical joke, and we are currently testing it on other jokes of the same sub-type.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Attardo, S.: Linguistic Theories of Humor. Mouton de Gruyter, Berlin and New York (1994)
Baker, C., Fillmore, C., Lowe, J.: The Berkeley FrameNet project. In: Proceedings of the COLING-ACL 1998, Montreal, Canada (1998)
Bergen, B.K., Chang, N.C.: Embodied Construction Grammar in Simulation-Based Language Understanding. Technical Report TR-02-004, International Computer Science Institute, Berkeley (2002)
Coulson, S.: Semantic Leaps: Frame-shifting and Conceptual Blending in Meaning Construction. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stark, J., Binsted, K., Bergen, B. (2005). Disjunctor Selection for One-Line Jokes. In: Maybury, M., Stock, O., Wahlster, W. (eds) Intelligent Technologies for Interactive Entertainment. INTETAIN 2005. Lecture Notes in Computer Science(), vol 3814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590323_18
Download citation
DOI: https://doi.org/10.1007/11590323_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30509-5
Online ISBN: 978-3-540-31651-0
eBook Packages: Computer ScienceComputer Science (R0)