Abstract
Incongruity resolution is one of the most widely accepted theories of humour, suggesting that humour is due to the mixing of two disparate interpretation frames in one statement. In this paper, we explore several computational models for incongruity resolution. We introduce a new data set, consisting of a series of ‘set-ups’ (preparations for a punch line), each of them followed by four possible coherent continuations out of which only one has a comic effect. Using this data set, we redefine the task as the automatic identification of the humorous punch line among all the plausible endings. We explore several measures of semantic relatedness, along with a number of joke-specific features, and try to understand their appropriateness as computational models for incongruity detection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aristotle. Rhetoric. 350 BC
Attardo, S., Raskin, V.: Script theory revis(it)ed: Joke similarity and joke representation model. Humor: International Journal of Humor Research 4(3-4) (1991)
Berry, M.: Large-scale sparse singular value computations. International Journal of Supercomputer Applications 6(1) (1992)
Budanitsky, A., Hirst, G.: Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures. In: Proceedings of the NAACL Workshop on WordNet and Other Lexical Resources, Pittsburgh (2001)
Buitelaar, P., Magnini, B., Strapparava, C., Vossen, P.: Domain specific sense disambiguation. In: Edmonds, P., Agirre, E. (eds.) Word Sense Disambiguation: Algorithms, Applications, and Trends. Text, Speech and Language Technology, vol. 33, pp. 277–301. Springer, Heidelberg (2006)
Jiang, J., Conrath, D.: Semantic similarity based on corpus statistics and lexical taxonomy. In: Proceedings of the International Conference on Research in Computational Linguistics, Taiwan (1997)
Landauer, T.K., Foltz, P., Laham, D.: Introduction to latent semantic analysis. Discourse Processes 25 (1998)
Leacock, C., Chodorow, M.: Combining local context and WordNet sense similarity for word sense identification. In: WordNet, An Electronic Lexical Database. The MIT Press, Cambridge (1998)
Lesk, M.: Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from an ice cream cone. In: Proceedings of the SIGDOC Conference 1986, Toronto (June 1986)
Lin, D.: An information-theoretic definition of similarity. In: Proceedings of the 15th International Conference on Machine Learning, Madison, WI (1998)
Magnini, B., Strapparava, C., Pezzulo, G., Gliozzo, A.: The role of domain information in word sense disambiguation. Natural Language Engineering 8(4), 359–373 (2002)
Mihalcea, R., Corley, C., Strapparava, C.: Corpus-based and knowledge-based approaches to text semantic similarity. In: Proceedings of the American Association for Artificial Intelligence, Boston, MA, pp. 775–780 (2006)
Mihalcea, R., Strapparava, C.: Making computers laugh: Investigations in automatic humor recognition. In: Proceedings of the Human Language Technology / Empirical Methods in Natural Language Processing conference, Vancouver (2005)
Mihalcea, R., Strapparava, C.: Learning to laugh (automatically): Computational models for humor recognition. Computational Intelligence 22(2), 126–142 (2006)
Patwardhan, S., Banerjee, S., Pedersen, T.: Using measures of semantic relatedness for word sense disambiguation. In: Proceedings of the Fourth International Conference on Intelligent Text Processing and Computational Linguistics, Mexico City (February 2003)
Raskin, V.: Semantic Mechanisms of Humor. Kluwer Academic Publications, Dordrecht (1985)
Resnik, P.: Using information content to evaluate semantic similarity. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada (1995)
Ritchie, G.: Developing the incongruity-resolution theory. In: Proceedings of the AISB Symposium on Creative Language: Stories and Humour (1999)
Salton, G., Lesk, M.: Computer evaluation of indexing and text processing, pp. 143–180. Prentice Hall, Inc., Englewood Cliffs (1971)
Schopenhauer, A.: The World as Will and Idea. Kessinger Publishing Company (1819)
Stock, O., Strapparava, C.: Getting serious about the development of computational humor. In: Proceedings of the International Conference on Artificial Intelligence, IJCAI 2003 (2003)
Turney, P.: Mining the web for synonyms: PMI-IR versus LSA on TOEFL. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, p. 491. Springer, Heidelberg (2001)
Wu, Z., Palmer, M.: Verb semantics and lexical selection. In: Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, Las Cruces, New Mexico (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mihalcea, R., Strapparava, C., Pulman, S. (2010). Computational Models for Incongruity Detection in Humour. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2010. Lecture Notes in Computer Science, vol 6008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12116-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-12116-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12115-9
Online ISBN: 978-3-642-12116-6
eBook Packages: Computer ScienceComputer Science (R0)