Computational rules for generating punning riddles
暂无分享,去创建一个
Riddles based on simple puns can be dassified according to the patterns of word, syllable or phrase similarity they depend upon. We have devised a formal model ofthe semantic and syntactic regularities underlying some of the simpler types of punning riddle. We have also implemented thispreliminary theory in a Computer program which can generate riddles from a lexicon containing general data about words andphrases; that is, the lexicon content is not customized to produce jokes. An informal, formative evaluation of the program's results by a set of human judges suggests that the riddles produced by this program are of comparable quality to those in general circulation among school children.
[1] V. Raskin,et al. Script theory revis(it)ed: joke similarity and joke representation model , 1991 .
[2] Salvatore Attardo,et al. Non-literalness and non-bona-fîde in language: An approach to formal and computational treatments of humor , 1994 .
[3] Kim Binsted,et al. An Implemented Model of Punning Riddles , 1994, AAAI.