...
首页> 外文期刊>Advances in Artificial Intelligence >Reducing Excessive Amounts of Data: Multiple Web Queries for Generation of Pun Candidates
【24h】

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

机译:减少过多的数据:用于生成双关语候选的多个Web查询

获取原文
获取原文并翻译 | 示例
           

摘要

Humor processing is still a less studied issue, both in NLP and AL 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 hand-made 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.
机译:在NLP和AL中,幽默处理仍然是一个研究较少的问题。在本文中,我们为这一领域做出了贡献。在我们之前的研究中,我们表明向聊天机器人添加简单的双关语生成器可以显着提高其性能。我们使用的双关语生成器仅基于单词(而非短语)生成双关语。在本文中,我们介绍了系统开发的下一阶段-一种允许生成短语双关语候选词的算法。我们证明,仅使用Internet(不使用任何手工制作的面向幽默的词典),就可以基于复杂的短语生成双关语。由于输出列表通常过长,因此我们还提出了一种通过比较两个基于Web查询的排名来减少候选者数量的方法。评估实验表明,该系统一般可以找到合适的候选者,准确率达到72.5%,而归约方法使我们可以大大缩短候选者列表。约简算法的参数是可变的,因此可以根据需要操纵候选数量和输出质量之间的平衡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号