Reducing Excessive Amounts of Data: Multiple Web Queries for Generation of Pun Candidates

Pawel Dybala, M. Ptaszynski, Kohichi Sayama
{"title":"Reducing Excessive Amounts of Data: Multiple Web Queries for Generation of Pun Candidates","authors":"Pawel Dybala, M. Ptaszynski, Kohichi Sayama","doi":"10.1155/2011/107310","DOIUrl":null,"url":null,"abstract":"Humor processing is still a less studied issue, both in NLP and AI. In this paper we contribute to this field. In our previous research we showed that adding a simple pun generator to a chatterbot can significantly improve its performance. The pun generator we used generated only puns based on words (not phrases). In this paper we introduce the next stage of the system's development-- an algorithm allowing generation of phrasal pun candidates. We show that by using only the Internet (without any handmade humor-oriented lexicons), it is possible to generate puns based on complex phrases. As the output list is often excessively long, we also propose a method for reducing the number of candidates by comparing two web-query-based rankings. The evaluation experiment showed that the system achieved an accuracy of 72.5% for finding proper candidates in general, and the reduction method allowed us to significantly shorten the candidates list. The parameters of the reduction algorithm are variable, so that the balance between the number of candidates and the quality of output can be manipulated according to needs.","PeriodicalId":7253,"journal":{"name":"Adv. Artif. Intell.","volume":"42 1","pages":"107310:1-107310:12"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Adv. Artif. Intell.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2011/107310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Humor processing is still a less studied issue, both in NLP and AI. In this paper we contribute to this field. In our previous research we showed that adding a simple pun generator to a chatterbot can significantly improve its performance. The pun generator we used generated only puns based on words (not phrases). In this paper we introduce the next stage of the system's development-- an algorithm allowing generation of phrasal pun candidates. We show that by using only the Internet (without any handmade humor-oriented lexicons), it is possible to generate puns based on complex phrases. As the output list is often excessively long, we also propose a method for reducing the number of candidates by comparing two web-query-based rankings. The evaluation experiment showed that the system achieved an accuracy of 72.5% for finding proper candidates in general, and the reduction method allowed us to significantly shorten the candidates list. The parameters of the reduction algorithm are variable, so that the balance between the number of candidates and the quality of output can be manipulated according to needs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
减少过多的数据量:生成双关语候选词的多个Web查询
幽默处理仍然是一个研究较少的问题,无论是在NLP还是人工智能中。在本文中,我们对这一领域做出了贡献。在我们之前的研究中,我们发现给聊天机器人添加一个简单的双关语生成器可以显著提高它的性能。我们使用的双关语生成器只生成基于单词的双关语(而不是短语)。在本文中,我们介绍了系统开发的下一阶段——一种允许生成短语双关语候选词的算法。我们表明,仅使用互联网(没有任何手工幽默导向的词汇),就有可能基于复杂的短语生成双关语。由于输出列表通常太长,我们还提出了一种通过比较两个基于web查询的排名来减少候选数量的方法。评估实验表明,该系统在一般情况下找到合适的候选对象的准确率达到72.5%,并且该约简方法使我们能够显着缩短候选列表。约简算法的参数是可变的,因此候选数量和输出质量之间的平衡可以根据需要进行操纵。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
iWordNet: A New Approach to Cognitive Science and Artificial Intelligence Natural Language Processing and Fuzzy Tools for Business Processes in a Geolocation Context Method for Solving LASSO Problem Based on Multidimensional Weight Selection and Configuration of Sorption Isotherm Models in Soils Using Artificial Bees Guided by the Particle Swarm Weighted Constraint Satisfaction for Smart Home Automation and Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1