\n
Authors<\/span><\/strong><\/p>\n Vanushkin A.S<\/strong>. \u2013 assistant of the department, Pskov State University, Pskov, Russia.<\/em><\/p>\n Grashenko L.A.<\/strong> \u2013 junior researcher, Institute of Mathematics of the Academy of Sciences of the Republic of Tajikistan, Dushanbe, Tajikistan.<\/em><\/p>\nAnnotation<\/strong><\/span><\/p>\n The given article describes a software tool for exploring different aspects of extracting keywords from texts in natural languages. The researcher is provided with visual design and the text processing tract setting; calculation and visualization of efficiency indicators of a number of built-in graph algorithms. It is possible to expand the stand functionality. The first tests showed a significant spread in the accuracy of keywords extraction when comparing the size of texts.<\/em><\/p>\nKeywords<\/strong><\/span><\/p>\n text processing, keywords, extraction algorithms, experimental stand.<\/em><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/p>\n
\n
\n
<\/p>\n
\n
\n
\n\n\n| \n Language<\/span><\/p>\nenglish<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/p>\n \n \n \n\n\n| \n Type<\/span><\/p>\ntechnical<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/p>\n \n \n \n\n\n| \n Year<\/span><\/p>\n2017<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/p>\n \n \n \n\n\n| \n Page<\/span><\/p>\n19<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n <\/div>\n<\/div>\n<\/div>\n <\/p>\n \n \n <\/p>\n \n \n <\/p>\n \n \n \u0421\u043f\u0438\u0441\u043e\u043a \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u043d\u043d\u043e\u0439 \u043b\u0438\u0442\u0435\u0440\u0430\u0442\u0443\u0440\u044b<\/strong><\/span><\/p>\n\n- \u0412\u0430\u043d\u044e\u0448\u043a\u0438\u043d \u0410.\u0421. \u041c\u0435\u0442\u043e\u0434\u044b \u0438 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u044b \u0438\u0437\u0432\u043b\u0435\u0447\u0435\u043d\u0438\u044f \u043a\u043b\u044e\u0447\u0435\u0432\u044b\u0445 \u0441\u043b\u043e\u0432 \/ \u0410.\u0421. \u0412\u0430\u043d\u044e\u0448\u043a\u0438\u043d, \u041b.\u0410. \u0413\u0440\u0430\u0449\u0435\u043d\u043a\u043e \/\/ \u041d\u043e\u0432\u044b\u0435 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u043e\u043d\u043d\u044b\u0435 \u0442\u0435\u0445\u043d\u043e\u043b\u043e\u0433\u0438\u0438 \u0432 \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0438\u0437\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c\u0430\u0445. \u2013 2016. \u2013 \u211619 \u2013 \u0421. 85\u201393.<\/em><\/li>\n
- Marujo L., Gershman A., Carbonell J., Frederking R. Supervised Topical Key Phrase Extraction of News Stories using Crowdsourcing, Light Filtering and Co-reference Normalization. Lrec 2012. pp 399\u2013403.<\/em><\/li>\n
- Mihalcea R., Tarau P. TextRank: Bringing order into texts Proc. EMNLP 2004. Vol. 4 pp. 404\u2013411.<\/em><\/li>\n
- Palshikar G. Keyword Extraction from a Single Document Using Centrality Measures. Pattern Recognit. Mach. Intell, LNCS 2007. Vol. 4851 pp. 503\u2013510.<\/em><\/li>\n
- Rose S., Engel D., Cramer N., Cowley W. Automatic Keyword Extraction from Individual Documents. Text Min. Appl. Theory. 2010. pp. 1\u201320.<\/em><\/li>\n<\/ol>\n<\/div>\n<\/div>\n
<\/div>\n<\/div>\n<\/div>\n <\/div>\n<\/div>\n<\/div>\n <\/p>\n \n \n <\/p>\n \n \n <\/p>\n \n \n Publication date<\/b><\/span><\/p>\n2023-09-25<\/p>\n<\/div>\n<\/div>\n <\/div>\n<\/div>\n<\/div>\n <\/div>\n<\/div>\n<\/div>\n <\/p>\n","protected":false},"excerpt":{"rendered":" Authors Vanushkin A.S. \u2013 assistant of the department, Pskov State University, Pskov, Russia. Grashenko L.A. \u2013 junior researcher, Institute of Mathematics of the Academy of Sciences of the Republic of Tajikistan, Dushanbe, Tajikistan. Annotation The given article describes a software tool for exploring different aspects of extracting keywords from texts in natural languages. The researcher is provided with visual design and the text processing tract setting; calculation and visualization of efficiency indicators of a number of built-in graph algorithms. It is possible to expand the stand…<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[135],"tags":[245],"class_list":["post-2215","post","type-post","status-publish","format-standard","hentry","category-bulletin_of_pittu_2017","tag-bulletin-of-pittu-2017-1"],"acf":[],"featured_image_src":null,"author_info":{"display_name":"Ilhomjon Qodirov","author_link":"https:\/\/vestnik.polytech.tj\/?author=3"},"_links":{"self":[{"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/posts\/2215","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2215"}],"version-history":[{"count":3,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/posts\/2215\/revisions"}],"predecessor-version":[{"id":2218,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=\/wp\/v2\/posts\/2215\/revisions\/2218"}],"wp:attachment":[{"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2215"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2215"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/vestnik.polytech.tj\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2215"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} | | | |