Recursive Sentiment Detection Algorithm for Russian Sentences

IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-27 DOI:10.3103/S0146411623070118
A. Y. Poletaev, I. V. Paramonov
{"title":"Recursive Sentiment Detection Algorithm for Russian Sentences","authors":"A. Y. Poletaev,&nbsp;I. V. Paramonov","doi":"10.3103/S0146411623070118","DOIUrl":null,"url":null,"abstract":"<p>The article is devoted to the task of sentiment detection of Russian sentences. The sentiment is conceived as the author’s attitude to the topic of a sentence. This assay considers positive, neutral, and negative sentiment classes, i.e., the task of three-classes classification is solved. The article introduces a rule-based sentiment detection algorithm for Russian sentences. The algorithm is based on the assumption that the sentiment of a phrase can be determined by the sentiments of its parts by the recursive application of appropriate semantic rules to the sentiments of its parts organized as a constituency parse tree. The utilized set of semantic rules was constructed based on a discussion with experts in linguistics. The experiments showed that the proposed recursive algorithm performs slightly worse on the hotel reviews corpus than the adapted rule-based approach: weighted F1-measures are 0.75 and 0.78, respectively. To measure the algorithm efficiency on complex sentences, we created OpenSentimentCorpus based on OpenCorpora, an open corpus of sentences extracted from Russian news and periodicals. On OpenSentimentCorpus the recursive algorithm performs be.er than the adapted approach does: F1-measures are 0.70 and 0.63, respectively. This indicates that the proposed algorithm has an advantage in case of more complex sentences with more subtle ways of expressing the sentiment.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 7","pages":"740 - 749"},"PeriodicalIF":0.6000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0146411623070118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The article is devoted to the task of sentiment detection of Russian sentences. The sentiment is conceived as the author’s attitude to the topic of a sentence. This assay considers positive, neutral, and negative sentiment classes, i.e., the task of three-classes classification is solved. The article introduces a rule-based sentiment detection algorithm for Russian sentences. The algorithm is based on the assumption that the sentiment of a phrase can be determined by the sentiments of its parts by the recursive application of appropriate semantic rules to the sentiments of its parts organized as a constituency parse tree. The utilized set of semantic rules was constructed based on a discussion with experts in linguistics. The experiments showed that the proposed recursive algorithm performs slightly worse on the hotel reviews corpus than the adapted rule-based approach: weighted F1-measures are 0.75 and 0.78, respectively. To measure the algorithm efficiency on complex sentences, we created OpenSentimentCorpus based on OpenCorpora, an open corpus of sentences extracted from Russian news and periodicals. On OpenSentimentCorpus the recursive algorithm performs be.er than the adapted approach does: F1-measures are 0.70 and 0.63, respectively. This indicates that the proposed algorithm has an advantage in case of more complex sentences with more subtle ways of expressing the sentiment.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
俄语句子的递归情感检测算法
摘要 本文致力于俄语句子的情感检测任务。情感被视为作者对句子主题的态度。该检测考虑了积极、中性和消极情感类别,即解决了三类分类任务。文章介绍了一种基于规则的俄语句子情感检测算法。该算法基于这样一个假设,即通过将适当的语义规则递归应用到以成分解析树形式组织的短语各部分的情感,可以根据短语各部分的情感确定短语的情感。所使用的语义规则集是在与语言学专家讨论的基础上构建的。实验结果表明,在酒店评论语料库中,所提出的递归算法的性能略逊于基于规则的改编方法:加权 F1 值分别为 0.75 和 0.78。为了衡量算法在复杂句子上的效率,我们在 OpenCorpora 的基础上创建了 OpenSentimentCorpus,这是一个从俄罗斯新闻和期刊中提取句子的开放式语料库。在 OpenSentimentCorpus 上,递归算法的表现优于改编方法:F1 值分别为 0.70 和 0.63。这表明,如果句子比较复杂,表达情感的方式比较微妙,那么建议的算法就具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
AUTOMATIC CONTROL AND COMPUTER SCIENCES
AUTOMATIC CONTROL AND COMPUTER SCIENCES AUTOMATION & CONTROL SYSTEMS-
CiteScore
1.70
自引率
22.20%
发文量
47
期刊介绍: Automatic Control and Computer Sciences is a peer reviewed journal that publishes articles on• Control systems, cyber-physical system, real-time systems, robotics, smart sensors, embedded intelligence • Network information technologies, information security, statistical methods of data processing, distributed artificial intelligence, complex systems modeling, knowledge representation, processing and management • Signal and image processing, machine learning, machine perception, computer vision
期刊最新文献
Advancing Driver Behavior Recognition: An Intelligent Approach Utilizing ResNet Airborne Chemical Detection Using IoT and Machine Learning in the Agricultural Area Chinese License Plate Recognition Based on OpenCV and LPCR Net Research on Groundwater Level Prediction Method in Karst Areas Based on Improved Attention Mechanism Fusion Time Convolutional Network Road Traffic Classification from Nighttime Videos Using the Multihead Self-Attention Vision Transformer Model and the SVM
×
引用
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