Computational Humour: Utilizing Cross-Reference Ambiguity for Conversational Jokes
This paper presents a computer implementation that utilizes cross-reference ambiguity in utterances for simple conversational jokes. The approach is based on the SSTH. Using a simple script representation, it is shown that cross-reference ambiguities always satisfy the SSTH requirement for script overlap. To determine whether script opposition is present, we introduce a method that compares the concepts involved based on their semantic properties. When a given cross-reference ambiguity results in script opposition it is possible to generate a punchline based on this ambiguity. As a result of the low performance of the anaphora resolution algorithm and the data sparseness in ConceptNet the application performs moderately, but it does provide future prospects in generating conversational humour.
Unable to display preview. Download preview PDF.
- 1.Raskin, V.: Semantic Mechanisms of Humor. Dordrecht–Boston–Lancaster: D. Reidel Publishing Company (1985)Google Scholar
- 3.Fromkin, V., Rodman, R., Neijt, A.: Universele taalkunde. 3e druk edn. Foris Publications, Dordrecht (1986)Google Scholar
- 4.Liu, H., Singh, P.: Commonsense reasoning in and over natural language. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3213, Springer, Heidelberg (2004)Google Scholar
- 6.Wallace, D.R., Tomabechi, D.H., Aimless, D.D.: Chatterbots go native: Considerations for an eco-system fostering the development of artificial life forms in a human world (January 2003)Google Scholar
- 7.Qiu, L., Kan, M.Y., Chua, T.S.: A public reference implementation of the rap anaphora resolution algorithm. In: Proceedings of the Fourth International Conference on Language Resources and Evaluation (LREC 2004) vol. 1, pp. 291–294 (2004)Google Scholar
- 8.Lappin, S., Leass, H.J.: An algorithm for pronominal anaphora resolution. Computational Linguistics 20(4), 535–562 (1994)Google Scholar