Computational Models for Incongruity Detection in Humour

PDF Version Also Available for Download.

Description

In this paper, the authors explore several computational models for incongruity resolution.

Physical Description

11 p.

Creation Information

Mihalcea, Rada, 1974-; Strapparava, Carlo, 1962- & Pulman, Stephen March 2010.

Context

This paper is part of the collection entitled: UNT Scholarly Works and was provided by the UNT College of Engineering to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 1219 times. More information about this paper can be viewed below.

Who

People and organizations associated with either the creation of this paper or its content.

Authors

Organizer of meeting

Provided By

UNT College of Engineering

The UNT College of Engineering strives to educate and train engineers and technologists who have the vision to recognize and solve the problems of society. The college comprises six degree-granting departments of instruction and research.

Contact Us

What

Descriptive information to help identify this paper. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

In this paper, the authors explore several computational models for incongruity resolution.

Physical Description

11 p.

Notes

Abstract: Incongruity resolution is one of the most widely accepted theories of humor, suggesting that humor is due to the mixing of two disparate interpretation frames in one statement. In this paper, the authors explore several computational models for incongruity resolution. The authors 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, the authors redefine the task as the automatic identification of the humorous punch line among all the plausible endings. The authors 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.

Source

  • Conference on Computational Linguistics and Intelligent Text Processing (CICLing), March 21-27, 2010. Iasi, Romania

Language

Item Type

Identifier

Unique identifying numbers for this paper in the Digital Library or other systems.

Collections

This paper is part of the following collection of related materials.

UNT Scholarly Works

Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.

What responsibilities do I have when using this paper?

When

Dates and time periods associated with this paper.

Creation Date

  • March 2010

Added to The UNT Digital Library

  • Jan. 31, 2011, 2:01 p.m.

Description Last Updated

  • Nov. 27, 2023, 12:03 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 1,219

Interact With This Paper

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Mihalcea, Rada, 1974-; Strapparava, Carlo, 1962- & Pulman, Stephen. Computational Models for Incongruity Detection in Humour, paper, March 2010; (https://digital.library.unt.edu/ark:/67531/metadc31024/: accessed April 19, 2025), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT College of Engineering.

Back to Top of Screen