A model of homographs automatic identification for the Belarusian language

IF 3.4 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Informatics Pub Date : 2023-12-29 DOI:10.37661/1816-0301-2023-20-4-87-100
Yu. S. Hetsevich, Ya. S. Zianouka, D. I. Latyshevich, A. A. Bakunovich, A. Y. Drahun, M. A. Kazlova
{"title":"A model of homographs automatic identification for the Belarusian language","authors":"Yu. S. Hetsevich, Ya. S. Zianouka, D. I. Latyshevich, A. A. Bakunovich, A. Y. Drahun, M. A. Kazlova","doi":"10.37661/1816-0301-2023-20-4-87-100","DOIUrl":null,"url":null,"abstract":"Objectives. А prototype system for automated removal of homonyms in Belarusian and Russian electronic texts is described. This is due to the urgent problem of automatic text processing at the morphological level, the process of which is complicated by the inflection of the Belarusian language with a diverse and rich system of morphological characteristics of parts of speech.Methods. The work uses regular homographs identification methods and knowledge-based methods.Results. Methods and approaches for designing systems for automatic detection of homographs are proposed. An algorithm for identifying homographs on the basis of knowledge-based method has been developed. An effective and fast-acting prototype for their removal in Russian and Belarusian has been implemented.Conclusion. A working prototype of the homograph search is presented, which is the first resource for removing ambiguity for the Belarusian language in open access.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" 27","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37661/1816-0301-2023-20-4-87-100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Objectives. А prototype system for automated removal of homonyms in Belarusian and Russian electronic texts is described. This is due to the urgent problem of automatic text processing at the morphological level, the process of which is complicated by the inflection of the Belarusian language with a diverse and rich system of morphological characteristics of parts of speech.Methods. The work uses regular homographs identification methods and knowledge-based methods.Results. Methods and approaches for designing systems for automatic detection of homographs are proposed. An algorithm for identifying homographs on the basis of knowledge-based method has been developed. An effective and fast-acting prototype for their removal in Russian and Belarusian has been implemented.Conclusion. A working prototype of the homograph search is presented, which is the first resource for removing ambiguity for the Belarusian language in open access.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
白俄罗斯语同形词自动识别模型
目的。描述了在白俄罗斯语和俄语电子文本中自动删除同义词的原型系统。这是由于在形态学层面自动处理文本是一个紧迫的问题,而白俄罗斯语的语音部分形态特征系统多样而丰富,这使得自动处理过程变得复杂。工作中使用了常规同形词识别方法和基于知识的方法。提出了设计同形词自动检测系统的方法和途径。在基于知识的方法基础上开发了同音字识别算法。在俄语和白俄罗斯语中实现了一个有效而快速的同音字清除原型。本文介绍了同形词搜索的工作原型,这是白俄罗斯语消除歧义的首个开放资源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Informatics
Informatics Social Sciences-Communication
CiteScore
6.60
自引率
6.50%
发文量
88
审稿时长
6 weeks
期刊最新文献
Simulation of discrete control systems with parallelism of behavior Formal description model and conditions for detecting linked coupling faults of the memory devices A model of homographs automatic identification for the Belarusian language Ontological analysis in the problems of container applications threat modelling Closed Gordon – Newell network with single-line poles and exponentially limited request waiting time
×
引用
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