A Hybrid Approach for Sarcasm Detection

Q1 Engineering Bell Labs Technical Journal Pub Date : 2019-07-01 DOI:10.3126/tj.v1i1.27581
S. Luintel, R. K. Sah, B. Lamichhane
{"title":"A Hybrid Approach for Sarcasm Detection","authors":"S. Luintel, R. K. Sah, B. Lamichhane","doi":"10.3126/tj.v1i1.27581","DOIUrl":null,"url":null,"abstract":"There is an excessive growth in user generated textual data due to increment in internet and social media users which includes enormous amount of sarcastic words, emoji, sentences. Sarcasm is a nuanced form of communication where individual states opposite of what is implied which is done in order to insult someone, to show irritation, or to be funny. Sarcasm is considered as one of the most difficult problems in sentiment analysis due to its ambiguous nature. Recognizing sarcasm in the texts can promote many sentiment analysis and text summarization applications. So for addressing the problem of sarcasm many steps have been adopted for sarcasm detection. Different preprocessing techniques such as Hypertext markup language removal, stop words removal, etc. have been done. Similarly, conversion of the emoji and smileys into their textual equivalent has been performed. Most frequent features has been selected and a hybrid cascade and hybrid weighted average approaches which are the combinations of the algorithms random forest, naïve Bayes and support vector machine have been used for sarcasm detection. The comparison of these two approaches on different basis has been done which has shown cascade outperformed weighted approach. Moreover, comparison of cascade approaches in terms of the algorithm placement has also been performed in which random forest has proved to be the best.","PeriodicalId":55592,"journal":{"name":"Bell Labs Technical Journal","volume":"10 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bell Labs Technical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/tj.v1i1.27581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

There is an excessive growth in user generated textual data due to increment in internet and social media users which includes enormous amount of sarcastic words, emoji, sentences. Sarcasm is a nuanced form of communication where individual states opposite of what is implied which is done in order to insult someone, to show irritation, or to be funny. Sarcasm is considered as one of the most difficult problems in sentiment analysis due to its ambiguous nature. Recognizing sarcasm in the texts can promote many sentiment analysis and text summarization applications. So for addressing the problem of sarcasm many steps have been adopted for sarcasm detection. Different preprocessing techniques such as Hypertext markup language removal, stop words removal, etc. have been done. Similarly, conversion of the emoji and smileys into their textual equivalent has been performed. Most frequent features has been selected and a hybrid cascade and hybrid weighted average approaches which are the combinations of the algorithms random forest, naïve Bayes and support vector machine have been used for sarcasm detection. The comparison of these two approaches on different basis has been done which has shown cascade outperformed weighted approach. Moreover, comparison of cascade approaches in terms of the algorithm placement has also been performed in which random forest has proved to be the best.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种混合方法的讽刺检测
由于互联网和社交媒体用户的增加,用户生成的文本数据过度增长,其中包括大量的讽刺词、表情符号和句子。讽刺是一种微妙的交流形式,个人为了侮辱某人、表达愤怒或搞笑而表达与所暗示的相反的意思。讽刺是情感分析中最困难的问题之一,因为它具有歧义性。识别文本中的讽刺可以促进许多情感分析和文本摘要的应用。因此,为了解决讽刺问题,人们采取了许多步骤来进行讽刺检测。不同的预处理技术,如超文本标记语言去除,停止词去除等已经完成。同样,将表情符号和笑脸符号转换成相应的文字也已经完成。选择了最常见的特征,混合级联和混合加权平均方法是随机森林,naïve贝叶斯和支持向量机算法的组合,用于讽刺检测。在不同的基础上对这两种方法进行了比较,结果表明级联法优于加权法。此外,在算法放置方面也进行了级联方法的比较,其中随机森林被证明是最好的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Bell Labs Technical Journal
Bell Labs Technical Journal 工程技术-电信学
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: The Bell Labs Technical Journal (BLTJ) highlights key research and development activities across Alcatel-Lucent — within Bell Labs, within the company’s CTO organizations, and in cross-functional projects and initiatives. It publishes papers and letters by Alcatel-Lucent researchers, scientists, and engineers and co-authors affiliated with universities, government and corporate research labs, and customer companies. Its aim is to promote progress in communications fields worldwide; Bell Labs innovations enable Alcatel-Lucent to deliver leading products, solutions, and services that meet customers’ mission critical needs.
期刊最新文献
Copyright page The future of Augmented Intelligence Future edge clouds The network OS: Carrier-grade SDN control of multi-domain, multi-layer networks Development of Optimal Tour Time Model for Tourist Destinations in A City: Application in Pokhara City Network
×
引用
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