使用 DeepWalk 和基于树的集合方法进行波斯语可读性分类

Mohammad Mahmoodi Varnamkhasti
{"title":"使用 DeepWalk 和基于树的集合方法进行波斯语可读性分类","authors":"Mohammad Mahmoodi Varnamkhasti","doi":"10.1016/j.nlp.2024.100116","DOIUrl":null,"url":null,"abstract":"<div><div>The Readability Classification (Difficulty classification) problem is the task of assessing the readability of text by categorizing it into different levels or classes based on its difficulty to understand. Applications ranging from language learning tools to website content optimization depend on readability classification. While numerous techniques have been proposed for readability classification in various languages, the topic has received little attention in the Persian (Farsi) language. Persian readability analysis poses unique challenges due to its complex morphology and flexible syntax, which necessitate a customized approach for accurate classification. In this research, we have proposed a method based on the nodes graph embedding and tree-based classification methods for sentence-level readability classification in the Persian language. The results indicate an F1-score of up to 0.961 in predicting the readability of Persian sentences.</div></div>","PeriodicalId":100944,"journal":{"name":"Natural Language Processing Journal","volume":"9 ","pages":"Article 100116"},"PeriodicalIF":0.0000,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Persian readability classification using DeepWalk and tree-based ensemble methods\",\"authors\":\"Mohammad Mahmoodi Varnamkhasti\",\"doi\":\"10.1016/j.nlp.2024.100116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Readability Classification (Difficulty classification) problem is the task of assessing the readability of text by categorizing it into different levels or classes based on its difficulty to understand. Applications ranging from language learning tools to website content optimization depend on readability classification. While numerous techniques have been proposed for readability classification in various languages, the topic has received little attention in the Persian (Farsi) language. Persian readability analysis poses unique challenges due to its complex morphology and flexible syntax, which necessitate a customized approach for accurate classification. In this research, we have proposed a method based on the nodes graph embedding and tree-based classification methods for sentence-level readability classification in the Persian language. The results indicate an F1-score of up to 0.961 in predicting the readability of Persian sentences.</div></div>\",\"PeriodicalId\":100944,\"journal\":{\"name\":\"Natural Language Processing Journal\",\"volume\":\"9 \",\"pages\":\"Article 100116\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Natural Language Processing Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2949719124000645\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Language Processing Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949719124000645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

可读性分类(难度分类)问题是一项评估文本可读性的任务,根据文本的理解难度将其分为不同的级别或类别。从语言学习工具到网站内容优化,各种应用都依赖于可读性分类。虽然针对各种语言的可读性分类提出了许多技术,但这一主题在波斯语(波斯语)中却很少受到关注。波斯语的可读性分析因其复杂的词形和灵活的语法而面临独特的挑战,因此需要一种定制的方法来进行准确的分类。在这项研究中,我们提出了一种基于节点图嵌入和基于树的分类方法,用于波斯语的句子级可读性分类。结果表明,预测波斯语句子可读性的 F1 分数高达 0.961。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Persian readability classification using DeepWalk and tree-based ensemble methods
The Readability Classification (Difficulty classification) problem is the task of assessing the readability of text by categorizing it into different levels or classes based on its difficulty to understand. Applications ranging from language learning tools to website content optimization depend on readability classification. While numerous techniques have been proposed for readability classification in various languages, the topic has received little attention in the Persian (Farsi) language. Persian readability analysis poses unique challenges due to its complex morphology and flexible syntax, which necessitate a customized approach for accurate classification. In this research, we have proposed a method based on the nodes graph embedding and tree-based classification methods for sentence-level readability classification in the Persian language. The results indicate an F1-score of up to 0.961 in predicting the readability of Persian sentences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信