A symbolic description of punning riddles and its computer implementation

نویسندگان

  • Kim Binsted
  • Graeme Ritchie
چکیده

Riddles based on simple puns can be classified according to the patterns of word, syllable or phrase similarity they depend upon. We have devised a formal model of the semantic and syntactic regularities underlying some of the simpler types of punning riddle. We have also implemented this preliminary theory in a computer program which can generate riddles from a lexicon containing general data about words and phrases; that is, the lexicon content is not customised to produce jokes. Informal evaluation of the program’s results by a set of human judges suggest that the riddles produced by this program are of comparable quality to those in general circulation among school children.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Implemented Model of Punning Riddles Humour and Artificial Intelligence Punning Riddles Symbolic Descriptions

In this paper, we discuss a model of simple question–answer punning, implemented in a program, JAE-1, which generates riddles from humour–independent lexical entries. The model uses two main types of structure: schemata, which determine the relationships between key words in a joke, and templates, which produce the surface form of the joke. JAPE-1 succeeds in generating pieces of text that are ...

متن کامل

An Implemented Model of Punning Riddles

In this paper, we discuss a model of simple question–answer punning, implemented in a program, JAE-1, which generates riddles from humour–independent lexical entries. The model uses two main types of structure: schemata, which determine the relationships between key words in a joke, and templates, which produce the surface form of the joke. JAPE-1 succeeds in generating pieces of text that are ...

متن کامل

Machine humour: An implemented model of puns

This thesis describes a formal model of a subtype of humour, and the implementation of that model in a program that generates jokes of that subtype. Although there is a great deal of literature on humour in general, very little formal work has been done on puns, and none has been implemented. All current linguistic theories of humour are over-general and not falsi able. Our model, which is spec...

متن کامل

Humor as Circuits in Semantic Networks

This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research had focused on humor generation beyond simple puns and punning riddles. We propose an algorithm for mining simple humorous scripts from a semantic network (ConceptNet) by specifically searching for dual scripts that joint...

متن کامل

Humor as Circuits in Semantic Networks

This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research had focused on humor generation beyond simple puns and punning riddles. We propose an algorithm for mining simple humorous scripts from a semantic network (ConceptNet) by specifically searching for dual scripts that joint...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cmp-lg/9406021  شماره 

صفحات  -

تاریخ انتشار 1994