<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">lingngu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник НГУ. Серия: Лингвистика и межкультурная коммуникация</journal-title><trans-title-group xml:lang="en"><trans-title>NSU Vestnik. Series: Linguistics and Intercultural Communication</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-7935</issn><publisher><publisher-name>Новосибирский государственный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.25205/1818-7935-2023-21-1-54-66</article-id><article-id custom-type="elpub" pub-id-type="custom">lingngu-519</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>КОМПЬЮТЕРНАЯ И ПРИКЛАДНАЯ ЛИНГВИСТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>COMPUTER AND APPLIED LINGUISTICS</subject></subj-group></article-categories><title-group><article-title>Генерация ключевых слов для аннотаций русскоязычных научных статей</article-title><trans-title-group xml:lang="en"><trans-title>Keyphrase Generation for Abstracts  of the Russian-Language Scientific Articles</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4464-1355</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Морозов</surname><given-names>Д. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Morozov</surname><given-names>D. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Морозов Дмитрий Алексеевич, младший научный сотрудник Лаборатории прикладных цифровых технологий Международного математического центра</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Dmitry A. Morozov, junior researcher, Laboratory of Applied Digital Technologies, Mathematical Center in Akademgorodok</p><p>Novosibirsk</p></bio><email xlink:type="simple">morozowdm@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8409-6457</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Глазкова</surname><given-names>А. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Glazkova</surname><given-names>A. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Глазкова Анна Валерьевна, канд. тех. наук, доцент кафедры программного обеспечения Института математики и компьютерных наук</p><p>Тюмень</p></bio><bio xml:lang="en"><p>Anna V. Glazkova, Cand. Sc. (Technology), Associate Professor, Department of Software, Institute of Mathematics and Computer Science </p><p>Tyumen</p></bio><email xlink:type="simple">a.v.glazkova@utmn.ru</email><xref ref-type="aff" rid="aff-2"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5367-3944</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Тютюльников</surname><given-names>М. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Tyutyulnikov</surname><given-names>M. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Тютюльников Михаил Андреевич, инженер, Лаборатория прикладных цифровых технологий Международного математического центра</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Mikhail A. Tyutyulnikov, engineer, Laboratory of Applied Digital Technologies, Mathematical Center in Akademgorodok</p><p>Novosibirsk</p></bio><email xlink:type="simple">mishatyty@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1767-5480</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Иомдин</surname><given-names>Б. Л.</given-names></name><name name-style="western" xml:lang="en"><surname>Iomdin</surname><given-names>B. L.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Иомдин Борис Леонидович, канд. филол. наук, ведущий научный сотрудник</p><p>Москва</p></bio><bio xml:lang="en"><p>Boris L. Iomdin, Cand. Sc. (Philology), Leading Researcher </p><p>Moscow</p></bio><email xlink:type="simple">iomdin@ruslang.ru</email><xref ref-type="aff" rid="aff-3"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Новосибирский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Novosibirsk State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Тюменский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>University of Tyumen</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-3"><aff xml:lang="ru"><institution>Институт русского языка им. В. В. Виноградова РАН</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Vinogradov Russian Language Institute of the Russian Academy of Sciences</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>30</day><month>05</month><year>2023</year></pub-date><volume>21</volume><issue>1</issue><fpage>54</fpage><lpage>66</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Морозов Д.А., Глазкова А.В., Тютюльников М.А., Иомдин Б.Л., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Морозов Д.А., Глазкова А.В., Тютюльников М.А., Иомдин Б.Л.</copyright-holder><copyright-holder xml:lang="en">Morozov D.A., Glazkova A.V., Tyutyulnikov M.A., Iomdin B.L.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://lingngu.elpub.ru/jour/article/view/519">https://lingngu.elpub.ru/jour/article/view/519</self-uri><abstract><p>В этой работе мы попробовали адаптировать различные известные механизмы генерации ключевых слов к весьма специфичному корпусу: аннотациям русскоязычных научных статей из области математики и компьютерных наук. В такой постановке сразу несколько сложностей: отсутствие масштабных исследований механизмов генерации для русского языка, отсутствие крупных корпусов аннотаций и в целом длина аннотаций: если для полного текста ключевые слова обычно встречаются в статье и достаточно лишь выделить их, для аннотаций характерно отсутствие ключевых слов в тексте в явном виде. При этом в открытый доступ попадают обычно именно аннотации, и автоматическая генерация ключевых слов для них позволила бы существенно улучшить возможности поиска по статьям. Причем генерировать слова стоит и для тех статей, в которых авторы сами их указали, так как в ходе исследования мы обнаружили, что используемые ключевые слова нередко уникальны для конкретной статьи, а значит, по таким словам невозможно сформировать подкорпус статей по заданной тематике. Для визуализации результатов работы мы создали ресурс keyphrases.mca.nsu.ru, на котором начинающие исследователи могут сформировать приблизительный список слов для своей первой публикации.</p></abstract><trans-abstract xml:lang="en"><p>In this paper, we attempted to adapt various well-known algorithms for keyword selection to a very specific text corpus containing abstracts of Russian academic papers from the mathematical and computer science domain. We faced several challenges including the lack of research in the field of keyword extraction for Russian, the absence of large text corpora of academic abstracts, and the insufficient length of the abstracts. Keywords are often found in the full text of the paper and can simply be highlighted, whereas abstracts may not include keywords in an explicit form. At the same time, it is abstracts that are usually in the public domain, so automatic selection of keywords from them would significantly facilitate the process of searching for papers. Moreover, an automatic keyword selection would be useful even for papers for which keywords were already specified by the authors. During the study, we found that authors often use unique keywords for their papers. This complicates their systematization on a given topic. For visualizing the results, we have created a web resource keyphrases.mca.nsu.ru, where young/beginning scholars can form an approximate list of keywords for their first research paper.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>статье</kwd><kwd>отсутствие крупных корпусов аннотаций</kwd><kwd>слова</kwd><kwd>целом длина аннотаций</kwd><kwd>ключевые</kwd></kwd-group><kwd-group xml:lang="en"><kwd>article</kwd><kwd>lack of large corpora of abstracts</kwd><kwd>words</kwd><kwd>overall length of annotations</kwd><kwd>key</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена в рамках проекта № МК-3118.2022, поддержанного грантом Президента Российской Федерации для молодых ученых – кандидатов наук.</funding-statement><funding-statement xml:lang="en">The work was carried out within the framework of project No. MK-3118.2022, supported by a grant from the President of the Russian Federation for young scientists - candidates of science.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Тихонова Е. В., Косычева М. А. Эффективные ключевые слова: стратегии формулирования // Health, Food &amp; Biotechnology. 2021. № 4 (3). С. 7–15.</mixed-citation><mixed-citation xml:lang="en">Boudin, F. PKE: an open source python-based keyphrase extraction toolkit. Proceedings of COLING 2016, the 26th international conference on computational linguistics: system demonstrations. Osaka, Japan, 2016, pp. 69–73.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Шереметьева С. О., Осминин П. Г. Методы и модели автоматического извлечения ключевых слов // Вестник Южно-Уральского государственного университета. Серия: Лингвистика. 2015. № 1 (12). С. 76–81.</mixed-citation><mixed-citation xml:lang="en">Bougouin, A., Boudin, F., Daille, B. TopicRank: Graph-based topic ranking for keyphrase extraction. Proceedings of the Sixth International Joint Conference on Natural Language Processing. Nagoya, Japan, 2013, pp. 543–551.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Boudin F. PKE: an open source python-based keyphrase extraction toolkit // Proceedings of COLING 2016, the 26th international conference on computational linguistics: system demonstrations / ed. by H. Watanabe. The COLING 2016 Organizing Committee. 2016. Pp. 69–73.</mixed-citation><mixed-citation xml:lang="en">Campos, R., Mangaravite, V., Pasquali, A., Jorge, A., Nunes, C., Jatowt, A. YAKE! Keyword extraction from single documents using multiple local features. Information Sciences, 2020, 509, pp. 257–289.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Bougouin A., Boudin F., Daille B. TopicRank: Graph-based topic ranking for keyphrase extraction // Proceedings of the Sixth International Joint Conference on Natural Language Processing / ed. by R. Mitkov and J. C. Park. Asian Federation of Natural Language Processing. 2013. Pp. 543–551.</mixed-citation><mixed-citation xml:lang="en">Chen, W., Chan, H. P., Li, P., King, I. Exclusive Hierarchical Decoding for Deep Keyphrase Generation. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. Online, 2020, pp. 1095–1105.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Campos R., Mangaravite V., Pasquali A., Jorge A., Nunes C., Jatowt A. YAKE! Keyword extraction from single documents using multiple local features // Information Sciences. 2020. 509. Pp. 257–289.</mixed-citation><mixed-citation xml:lang="en">Devlin, J., Chang, M. W., Lee, K., Toutanova, K. BERT: Pre-training of deep bidirectional transformers for language understanding. Proceedings of NAACL-HLT. Minneapolis, USA, 2019, pp. 4171–4186.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Chen W., Chan H. P., Li P., King I. Exclusive Hierarchical Decoding for Deep Keyphrase Generation // Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics / ed. by D. Jurafsky, J. Chai, N. Schluter and J. Tetreault. Association for Computational Linguistics. 2020. Pp. 1095–1105.</mixed-citation><mixed-citation xml:lang="en">El-Beltagy, S. R., Rafea, A. KP-Miner: A keyphrase extraction system for English and Arabic documents. Information Systems, 2009, no. 1 (34), pp. 132–144.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Devlin J., Chang M. W., Lee K., Toutanova K. BERT: Pre-training of deep bidirectional transformers for language understanding // Proceedings of NAACL-HLT / ed. by J. Burstein, C. Doran, T. Solorio. Association for Computational Linguistics. 2019. Pp. 4171–4186.</mixed-citation><mixed-citation xml:lang="en">Ghanbarpour, A., Naderi, H. A model-based method to improve the quality of ranking in keyword search systems using pseudo-relevance feedback. Journal of Information Science, 2019, no. 4 (45), pp. 473–487.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">El-Beltagy S. R., Rafea A. KP-Miner: A keyphrase extraction system for English and Arabic documents // Information Systems. 2009. № 1 (34). Pp. 132–144.</mixed-citation><mixed-citation xml:lang="en">Grootendorst, M. KeyBERT: Minimal Keyword Extraction with BERT, 2020. Available at: http://doi.org/10.5281/zenodo.4461265 (accessed 29.11.2022).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Ghanbarpour A., Naderi H. A model-based method to improve the quality of ranking in keyword search systems using pseudo-relevance feedback // Journal of Information Science. 2019. № 4 (45). Pp. 473–487.</mixed-citation><mixed-citation xml:lang="en">Harris, Z. S. Distributional structure. Word, 1954. no. 2-3 (10), pp. 146–162.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Grootendorst M. KeyBERT: Minimal Keyword Extraction with BERT. 2020 [Электронный ресурс]. URL: http://doi.org/10.5281/zenodo.4461265 (дата обращения: 29.11.2022).</mixed-citation><mixed-citation xml:lang="en">Koloski, B., Pollak, S., Škrlj, B., Martinc, M. Extending Neural Keyword Extraction with TF-IDF tagset matching. Proceedings of the EACL Hackashop on News Media Content Analysis and Automated Report Generation. Online, 2021, pp. 22–29.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Harris Z. S. Distributional structure // Word. 1954. № 2-3 (10). Pp. 146–162.</mixed-citation><mixed-citation xml:lang="en">Korobov, M. Morphological analyzer and generator for Russian and Ukrainian languages. International conference on analysis of images, social networks and texts. Yekaterinburg, 2015, pp. 320–332.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Koloski B., Pollak S., Škrlj B., Martinc M. Extending Neural Keyword Extraction with TF-IDF tagset matching // Proceedings of the EACL Hackashop on News Media Content Analysis and Automated Report Generation / ed. by H. Toivonen, M. Boggia. Association for Computational Linguistics. 2021. Pp. 22–29.</mixed-citation><mixed-citation xml:lang="en">Kuratov, Y., Arkhipov, M. Adaptation of deep bidirectional multilingual transformers for Russian language. Computational Linguistics and Intellectual Technologies: Proceedings of the International Conference “Dialogue 2019”. Moscow, 2019. Available at: https://www.dialog-21.ru/media/4606/kuratovyplusarkhipovm-025.pdf (accessed 29.11.2022).</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Korobov M. Morphological analyzer and generator for Russian and Ukrainian languages // International conference on analysis of images, social networks and texts / ed. by M. Yu. Khachay, N. Konstantinova, A. Panchenko, D. Ignatov, V. G. Labunets. Springer, Cham. 2015. Pp. 320–332.</mixed-citation><mixed-citation xml:lang="en">Lin C. Y. ROUGE: A package for automatic evaluation of summaries. Text summarization branches out. Osaka, Japan, 2004, pp. 74–81.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Kuratov Y., Arkhipov M. Adaptation of deep bidirectional multilingual transformers for Russian language // Computational Linguistics and Intellectual Technologies: Proceedings of the International Conference “Dialogue 2019”. 2019 [Электронный ресурс]. URL: https://www.dialog-21.ru/media/4606/kuratovyplusarkhipovm-025.pdf (дата обращения: 29.11.2022).</mixed-citation><mixed-citation xml:lang="en">Meng, R., Zhao, S., Han, S., He, D., Brusilovsky, P., Chi, Y. Deep Keyphrase Generation. Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Vancouver, Canada, 2017, pp. 582–592.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Lin C. Y. ROUGE: A package for automatic evaluation of summaries // Text summarization branches out. Association for Computational Linguistics. 2004. Pp. 74–81.</mixed-citation><mixed-citation xml:lang="en">Mihalcea, R., Tarau, P. TextRank: Bringing order into text. Proceedings of the 2004 conference on empirical methods in natural language processing. Barcelona, Spain, 2004, pp. 404–411.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Meng R., Zhao S., Han S., He D., Brusilovsky P., Chi Y. Deep Keyphrase Generation // Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) / ed. by R. Barzilay, M.-Y. Kan. Association for Computational Linguistics. 2017. Pp. 582–592.</mixed-citation><mixed-citation xml:lang="en">Morozov, D., Glazkova, A. Keyphrases CS&amp;Math Russian, Mendeley Data, 2022. Available at: http://doi.org/10.17632/dv3j9wc59v.1 (accessed 29.11.2022).</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Mihalcea R., Tarau Pp. TextRank: Bringing order into text // Proceedings of the 2004 conference on empirical methods in natural language processing / ed. by D. Lin, D. Wu. Association for Computational Linguistics. 2004. Pp. 404–411.</mixed-citation><mixed-citation xml:lang="en">Page L., Brin S., Motwani R., Winograd T. The PageRank citation ranking: Bringing order to the web, Stanford InfoLab, 1998. Available at: http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf (accessed 02.12.2022).</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Morozov D., Glazkova A. Keyphrases CS&amp;Math Russian, Mendeley Data. 2022 [Электронный ресурс]. URL: http://doi.org/10.17632/dv3j9wc59v.1 (дата обращения: 29.11.2022).</mixed-citation><mixed-citation xml:lang="en">Sandul, M., Mikhailova, E. Keyword extraction from single Russian document. Proceedings of the Third Conference on Software Engineering and Information Management (full papers). Saint Petersburg, 2018, pp. 30–36.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Page L., Brin S., Motwani R., Winograd T. The PageRank citation ranking: Bringing order to the web. Stanford InfoLab. 1998 [Электронный ресурс]. URL: http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf (дата обращения: 02.12.2022).</mixed-citation><mixed-citation xml:lang="en">Sheremetyeva, S. O., Osminin, P. G. [On Methods and Models of Keywords Automatic Extraction]. Vestnik Juzhno-Ural’skogo gosudarstvennogo universiteta. Serija: Lingvistika [Bulletin of South Ural State University, Series «Linguistics»], 2015, no. 1 (12), pp. 76–81. (In Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Sandul M., Mikhailova E. Keyword extraction from single Russian document // Proceedings of the Third Conference on Software Engineering and Information Management (full papers) / ed. by Y. Litvinov, M. Akhin, B. Novikov ,V. Itsykson. CEUR Workshop Proceedings, 2018. Pp. 30–36.</mixed-citation><mixed-citation xml:lang="en">Sokolova, E., Moskvina, A., Mitrofanova, O. Keyphrase Extraction from the Russian Corpus on Linguistics by Means of KEA and RAKE Algorithms. Data analytics and management in data intensive domains: Proceedings of the XX International Conference – DAMDID/RCDL’2018. Moscow, 2018, pp. 369–372.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Sokolova E., Moskvina A., Mitrofanova O. Keyphrase Extraction from the Russian Corpus on Linguistics by Means of KEA and RAKE Algorithms // Data analytics and management in data intensive domains: Proceedings of the XX International Conference – DAMDID/RCDL’2018 / ed. by L. Kalinichenko, Y. Manolopoulos, S. Stupnikov, N. Skvortsov, V. Sukhomlin. FRC CSC RAS, 2018. Pp. 369–372.</mixed-citation><mixed-citation xml:lang="en">Tikhonova, E. V., Kosycheva, M. A. Effective Keywords: Strategies for Their Formulation. Health, Food &amp; Biotechnology, 2021, no. 4 (3), pp. 7–15. (In Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Wienecke Y. Automatic Keyphrase Extraction From Russian-Language Scholarly Papers in Computational Linguistics: University Honors Theses. Portland State University, 2020. 36 p.</mixed-citation><mixed-citation xml:lang="en">Wienecke, Y. Automatic Keyphrase Extraction From Russian-Language Scholarly Papers in Computational Linguistics: University Honors Theses. Portland State University, 2020. 36 p.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Witten I. H., Paynter G. W., Frank E., Gutwin C., Nevill-Manning C. G. KEA: Practical automatic keyphrase extraction // Proceedings of the fourth ACM conference on Digital libraries / ed. by N. Rowe, E. A. Fox. Association for Computing Machinery, 1999. Pp. 254–255.</mixed-citation><mixed-citation xml:lang="en">Witten, I. H., Paynter, G. W., Frank, E., Gutwin, C., Nevill-Manning, C. G. KEA: Practical automatic keyphrase extraction. Proceedings of the fourth ACM conference on Digital libraries. Berkeley, USA, 1999, pp. 254–255.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang T., Kishore V., Wu F., Weinberger K. Q., Artzi Y. BERTScore: Evaluating Text Generation with BERT // International Conference on Learning Representations. 2019 [Электронный ресурс]. URL: https://openreview.net/pdf?id=SkeHuCVFDr (дата обращения: 29.11.2022).</mixed-citation><mixed-citation xml:lang="en">Zhang, T., Kishore, V., Wu, F., Weinberger, K. Q., Artzi, Y. BERTScore: Evaluating Text Generation with BERT. International Conference on Learning Representations. Online, 2019 Available at: https://openreview.net/pdf?id=SkeHuCVFDr (accessed 29.11.2022).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
