<?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-2025-23-1-93-109</article-id><article-id custom-type="elpub" pub-id-type="custom">lingngu-907</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>Computer-based Analysis of Argumentation Patterns and Strategies in Scientific Communication Texts</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-0001-5946-9469</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>Pimenov</surname><given-names>I. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Иван Сергеевич Пименов, программист</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Ivan S. Pimenov, Programmer</p><p>Novosibirsk</p></bio><email xlink:type="simple">pimenov.1330@yandex.ru</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-8412-9116</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>Salomatina</surname><given-names>N. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Саломатина Наталья Васильевна, кандидат физико-математических наук, старший научный сотрудник</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Natalia V. Salomatina, Candidate of Sciences (Physics &amp; Mahs), Senior Researcher</p><p>Novosibirsk</p></bio><email xlink:type="simple">salomatina_nv@live.ru</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-8999-2330</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>Timofeeva</surname><given-names>M. K.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Тимофеева Мария Кирилловна, доктор филологических наук, ведущий научный сотрудник</p><p>Новосибирск</p></bio><bio xml:lang="en"><p>Mariya K. Timofeeva, Doctor of Sciences (Philology), Leading Researcher</p><p>Novosibirsk</p></bio><email xlink:type="simple">mtimof@inbox.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Институт систем информатики им. А. П. Ершова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>A. P. Ershov Institute of Informatics Systems</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>04</day><month>07</month><year>2025</year></pub-date><volume>23</volume><issue>1</issue><fpage>93</fpage><lpage>109</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Пименов И.С., Саломатина Н.В., Тимофеева М.К., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Пименов И.С., Саломатина Н.В., Тимофеева М.К.</copyright-holder><copyright-holder xml:lang="en">Pimenov I.S., Salomatina N.V., Timofeeva M.K.</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/907">https://lingngu.elpub.ru/jour/article/view/907</self-uri><abstract><p>В статье приведены результаты анализа приемов аргументации, реализуемых в текстах научной коммуникации. Под приемами понимаются повторяющиеся в корпусе текстов с разметкой аргументации отдельные типы аргументов и структуры, образуемые ими. Корпус содержит тексты трех жанров: научные статьи по лингвистике и информационным технологиям из научной электронной библиотеки CyberLeninka (https://cyberleninka. ru/), научно-популярные статьи с форума «Хабр» (habr.com/ru, далее ‒ статьи Habr), новости науки (poisknews. ru). Двойная разметка аргументации в текстах корпуса произведена на платформе ArgNetBank Studio пятью экспертами, специалистами в области теоретической и прикладной лингвистики. Вычисленные коэффициенты согласия между аннотаторами могут быть отнесены к разряду «существенное согласие». Моделирование аргументации соответствует стандарту Argument Interchange Format. Результатом разметки и объектом анализа являются построенные согласно стандарту графы аргументации с двумя типами вершин: информационными вершинами, содержащими аргументативные утверждения, и вершинами-схемами, определяющими для каждой связи между ними точную модель рассуждения из компендиума Уолтона. Исследуются графы, полученные из графов аргументации путем удаления всех информационных вершин и слияния входящей и выходящей дуг каждой исключенной информационной вершины в одну дугу (таким образом получаемые графы состоят только из вершин-схем), и подграфы таких графов. Частотный анализ подграфов, составляющих графы корпуса, проведен методом Frequent Subgraph Mining с учетом изоморфизма, выявляемого посредством реализации алгоритма Корделлы VF2 из библиотеки NetworkX. В результате выявлены приемы аргументации (повторяющиеся подграфы с числом вершин от 1 до 9), применяемые в текстах всех жанров (межжанровые), каждого отдельного жанра (межтекстовые), а также приемы, повторяющиеся в отдельных текстах (внутритекстовые). Установлено, что для научных статей корпуса характерны наибольшие устойчивость и разнообразие приемов аргументации, научно-популярные характеризуются активной полемической аргументацией, а приемы в научных новостях основаны на двух ключевых моделях, применяемых при компактной аргументации. Внутритекстовые приемы повторяют тенденции межтекстовых, тогда как приемы, встречающиеся в текстах всех жанров, редки. Совокупность приемов, используемых в тексте, образует применяемую в нем стратегию рассуждения. С целью выявления близких по стратегиям текстов проведена их кластеризация методами Ward и K-means. Построенные кластеры характеризуются однородностью текстов по жанру, а в кластерах с текстами одного жанра – по теме. Выявленные приемы аргументации, помимо классификации текстов, могут также применяться для оценки аргументативной составляющей текста, поиска убедительной аргументации, ее генерации и т. д. Работы по данной теме редко встречаются в исследованиях для текстов на английском языке, а для текстов на русском языке автоматический анализ закономерностей аргументации не проводился.</p></abstract><trans-abstract xml:lang="en"><p>The article presents the results of analyzing argumentation patterns that are employed in scientific communication texts. We define argumentation patterns as models of separate arguments and their composite structures repeated across corpus texts. The corpus consists of 98 texts in three different genres: 50 scientific articles from the scientific electronic library CyberLeninka (https://cyberleninka.ru/), 20 popular science articles from the forum habr.com/ru (hereafter ‒ Habr articles), 28 scientific news texts from the Poisk aggregator of scientific news (poisknews.ru). Five experts in theoretical and applied linguistics have performed double annotation of the corpus texts using ArgNetBank Studio platform. Calculated inter-annotator agreement scores correspond to the “substantial agreement” range. Argumentation annotation follows the Argument Interchange Format standard. The results of annotation and the object of the analysis are argumentation graphs with two node types: information nodes (which correspond to argumentative statements) and scheme nodes (which, for each link between statements, indicate its reasoning model in accordance with Walton’s compendium). The study addresses the graphs obtained from the abovementioned graphs by excluding all information nodes and merging the incoming and outcoming links of each excluded information node into one link (thus the obtained graphs consist exclusively of scheme nodes) and the subgraphs of these obtained graphs. We perform a frequency-based analysis of subgraphs by the Frequent Subgraph Mining Method combined with Cordella VF2 algorithm implementation from the NetworkX library for isomorphism check. The analysis results in identification of argumentation patterns (repeating subgraphs from 1 to 9 node in size) that are employed in texts of all genres, one specific genre, as well as patterns repeated within separate texts. We show that scientific articles of the corpus exhibit the greatest stability and diversity of argumentation patterns, while popular science texts are marked by the active use of polemic argumentation, and patterns in scientific news are based on two reasoning models characteristic of compact argumentation. Patterns that repeat in separate texts show the same tendencies as genre-specific patterns. Using the identified patterns, we conduct clustering of the corpus texts with Ward and K-means algorithms. Resulting clusters correspond to groups of texts with similar argumentation strategies and exhibit homogeneity of texts by genre and thematic field. Identified patterns can be used not only for classifications but also for assessing the argumentative organization of texts extracting persuasive argumentation, its generation etc. Works on this topic are still underrepresented for texts in English, while for texts in Russian, such automatic analysis of argumentation patterns has not yet been performed.</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>computational argumentation</kwd><kwd>scientific communication</kwd><kwd>Russian texts</kwd><kwd>argumentation patterns</kwd><kwd>argumentation strategies</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда № 23-11-00261, https://rscf.ru/project/23-11-00261/</funding-statement><funding-statement xml:lang="en">The study was supported by the Russian Science Foundation grant No. 23-11-00261, https://rscf.ru/project/23-11-00261/</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">Пименов И. С., Саломатина Н. В., Тимофеева М. К. Формальное выявление приемов аргументации в научных текстах // Вестник НГУ. Серия: Лингвистика и межкультурная коммуникация. 2022. Т. 20. № 1. С. 21–36. DOI 10.25205/1818-7935-2022-20-1-21-36</mixed-citation><mixed-citation xml:lang="en">Al-Khatib K., Wachsmuth H., Kiesel J., Hagen M., Stein B. A News Editorial Corpus for Mining Argumentation Strategies. Proc. of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, 2016, pp. 3433–3443.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Саломатина Н. В., Пименов И. С., Сидорова Е. А. Распознавание в научных текстах аргументов с этосом и пафосом // Тез. Международ. конф. «Марчуковские чтения ‒ 2022», 3‒7 октября 2022, Академгородок, Новосибирск, Россия. 2022. C. 140.</mixed-citation><mixed-citation xml:lang="en">Al Khatib K. Computational Analysis of Argumentation Strategies. Dissertation to obtain the academic degree of Dr. rer. nat. Faculty of Media Bauhaus-Universität Weimar, Germany, September 2019.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Сидорова Е. А., Ахмадеева И. Р., Загорулько Ю. А., Серый А. С., Шестаков В. К. Платформа для исследования аргументации в научно-популярном дискурсе // Онтология проектирования. 2020. Т. 10, № 4(38). С. 489–502.</mixed-citation><mixed-citation xml:lang="en">Al-Khatib K. Wachsmuth H., Kiesel J., Hagen M., Stein B. Patterns of Argumentation Strategies across Topics. Proc. of the 2017 Conference on Empirical Methods in Natural Language Processing, Copenhagen, Denmark, September 7–11, 2017, pp. 1351–1357.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Сидорова Е. А., Ахмадеева И. Р., Загорулько Ю. А., Кононенко И. С., Серый А. С., Чагина П. М., Шестаков В. К. Комплексный подход к анализу аргументативных отношений в текстах научной коммуникации // Онтология проектирования. 2023. Т. 13, № 4(50). С. 562–579.</mixed-citation><mixed-citation xml:lang="en">Anand P., King J., Boyd-Graber J., Wagner E., Martell C., Oard D., Resnik P. Believe Me—We Can Do ThisAnnotating Persuasive Acts in Blog Text. Proc. of the conf. Computational Models of Natural Argument, San Francisco, California, USA, August 7, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Al-Khatib K., Wachsmuth H., Kiesel J., Hagen M., Stein B. A News Editorial Corpus for Mining Argumentation Strategies // Proc. of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers. 2016. P. 3433–3443.</mixed-citation><mixed-citation xml:lang="en">Cordella L. P., Foggia P., Sansone C., Vento M. A (Sub) Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, vol. 26, no. 10, pp. 1367‒1372.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Al Khatib K. Computational Analysis of Argumentation Strategies // Dissertation to obtain the academic degree of Dr. rer. nat. Faculty of Media Bauhaus-Universität Weimar, Germany, September 2019.</mixed-citation><mixed-citation xml:lang="en">El Baff R., Wachsmuth H., Al Khatib K., Stede M., Stein B. Computational Argumentation Synthesis as a Language Modeling Task. In: Proc. of the 12th International Conference on Natural Language Generation. Tokyo, Japan, 2019, pp. 54–64.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Al-Khatib K., Wachsmuth H., Hagen M., Stein B. Patterns of Argumentation Strategies across Topics // Proc. of the 2017 Conference on Empirical Methods in Natural Language Processing, Copenhagen, Denmark, September 7–11, 2017. P. 1351–1357.</mixed-citation><mixed-citation xml:lang="en">Hagberg A. A., Schult D. A. and Swart P. J. Exploring network structure, dynamics, and function using NetworkX. Proc. of the 7th Python in Science Conference (SciPy2008), Pasadena, CA USA, pp. 11–15, Aug 2008.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Anand P., King J., Boyd-Graber J., Wagner E., Martell C., OardD., Resnik P. Believe Me—We Can Do ThisAnnotating Persuasive Acts in Blog Text // Proc. of the conf. Computational Models of Natural Argument, San Francisco, California, USA, August 7, 2011.</mixed-citation><mixed-citation xml:lang="en">Jiang C., Coenen F., Zito M. A Survey of Frequent Subgraph Mining Algorithms. The Knowledge Engineering Review, 2004, vol. 000(1), pp. 1–31</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Cordella L. P., Foggia P., Sansone C., Vento M. A (Sub) Graph Isomorphism Algorithm for Matching Large Graphs // IEEE Transactions on Pattern Analysis and Machine Intelligence. 2004. Vol. 26, no. 10. P. 1367‒1372.</mixed-citation><mixed-citation xml:lang="en">Krippendorff K. Content analysis: An introduction to its methodology, 3rd edition. Thousand Oaks, CA: Sage, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">El Baff R., Wachsmuth H., Al Khatib K., Stede M., Stein B. Computational Argumentation Synthesis as a Language Modeling Task // Proc. of the 12th International Conference on Natural Language Generation. Tokyo, Japan, 2019. P. 54–64.</mixed-citation><mixed-citation xml:lang="en">Lauscher A., Wachsmuth H., Gurevych I., Glavaš G. Scientia Potentia Est – On the Role of Knowledge in Computational Argumentation, arXiv: 2107.00281v3 [cs.CL] 8 Nov 2022.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Hagberg A. A., Schult D. A., Swart P. J. Exploring network structure, dynamics, and function using NetworkX // Proc. of the 7th Python in Science Conference (SciPy2008), Pasadena, CA USA, Aug 2008. P. 11–15.</mixed-citation><mixed-citation xml:lang="en">Mirzakhmedova N., Kiesel J., Al-Khatib K., Stein B. Unveiling the Power of Argument Arrangement in Online Persuasive Discussions. Proc. of the conf 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP 2023) ‒ Singapore, Singapore, 6‒10 Dec, 2023. pp. 15659‒15671.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Jiang C., Coenen F., Zito M. A Survey of Frequent Subgraph Mining Algorithms. // The Knowledge Engineering Review. 2004. Vol. 1. P. 1–31.</mixed-citation><mixed-citation xml:lang="en">Pimenov I. S., Salomatina N. V., Timofeeva M. K. Formal Identification of Argumentation Patterns in Scientific Texts. Vestnik NSU. Series: Linguistics and Intercultural Communication, 2022, vol. 20, no. 1, pp. 21–36. (in Russ.) DOI 10.25205/1818-7935-2022-20-1-21-36.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Krippendorff K. Content analysis: An introduction to its methodology, 3rd edition. Thousand Oaks, CA: Sage, 2013.</mixed-citation><mixed-citation xml:lang="en">Pimenov I. S., Salomatina N. V. Identification of Scientific Texts with Similar Argumentation Complexity. 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), 2022, pp. 880–875.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Lauscher A., Wachsmuth H., Gurevych I, and Glavaš G. Scientia Potentia Est – On the Role of Knowledge in Computational Argumentation, arXiv: 2107.00281v3 [cs.CL] 8 Nov 2022.</mixed-citation><mixed-citation xml:lang="en">Rahwan I., Reed C. The argument interchange format. Argumentation in artificial intelligence, ed. Rahwan I. and Simari G., Springer, 2009, pp. 383–402.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Mirzakhmedova N., Kiesel J., Al-Khatib K., Stein B. Unveiling the Power of Argument Arrangement in Online Persuasive Discussions // Proc. of the Conference on Empirical Methods in Natural Language Processing (EMNLP 2023) ‒ Singapore, Singapore, 6‒10 Dec, 2023. P. 15659‒15671.</mixed-citation><mixed-citation xml:lang="en">Salomatina N. V., Pimenov I. S., Sidorova E. A. Automatic identification of arguments with ethos and pathos in scientific articles. Thesis of the International conf. Marchuk Scientific Reading ‒ 2022, 3‒7 October 2022, Academgorodok, Novosibirsk, Russia, 2022. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Pimenov I. S., Salomatina N. V. Identification of Scientific Texts with Similar Argumentation Complexity // 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2022. P. 880–875.</mixed-citation><mixed-citation xml:lang="en">Sidorova E. A., Akhmadeeva I. R., Zagorulko Yu. A., Kononenko I. S., Sery A. S., Chagina P. M., Shestakov V. K. An integrated approach to the analysis of argumentative relationships in scientific communication texts. Ontology of deSiing, 2023, vol. 13, nо. 4(50), pp. 562–579. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Rahwan I., Reed C. The argument interchange format. Argumentation in artificial intelligence, ed. Rahwan I. and Simari G., Springer, 2009. P. 383–402.</mixed-citation><mixed-citation xml:lang="en">Sidorova Е. А., Akhmadeeva I. R., Zagorulko Yu. A., Sery A. S., Shestakov V. K. Research platform for the study of argumentation in popular science discourse. Ontology deSiing, 2020, vol. 10, no. 4(38), pp. 489‒502. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Ullmann J. R. An Algorithm for Subgraph Isomorphism // Journal of the ACM. 1976. Vol. 23(1). P. 31–42.</mixed-citation><mixed-citation xml:lang="en">Ullmann J. R. An Algorithm for Subgraph Isomorphism. Journal of the ACM, 1976, vol. 23(1), pp. 31–42.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Wachsmuth H., Stede M., El Baff R., Al-Khatib K., Skeppstedt M., Stein B. Argumentation Synthesis following Rhetorical Strategies // Proceedings of the 27th International Conference on Computational Linguistics, Santa Fe, New Mexico, USA, August 20‒26, 2018. P. 3753–3765.</mixed-citation><mixed-citation xml:lang="en">Wachsmuth H., Stede M., El Baff R., Al-Khatib K., Skeppstedt M., Stein B. Argumentation Synthesis following Rhetorical Strategies. Proceedings of the 27th International Conference on Computational Linguistics, Santa Fe, New Mexico, USA, August 20‒26, 2018. pp. 3753–3765.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Walton D., Reed C., Macagno F. Argumentation schemes Fundamentals of critical argumentation. New York: Cambridge University Press, 2008. 443 p.</mixed-citation><mixed-citation xml:lang="en">Walton D., Reed C., Macagno F. Argumentation schemes Fundamentals of critical argumentation. New York: Cambridge University Press, 2008, 443 p.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Yan M., Lin Y., Litman D. Argumentatively Phony? Detecting Misinformation via Argument Mining // ACM Trans. Graph. 2018. Vol. 37 (4). Article 111. https://doi.org/10.1145/1122445.1122456.</mixed-citation><mixed-citation xml:lang="en">Yan M., Lin Y., Litman D. Argumentatively Phony? Detecting Misinformation via Argument Mining. ACM Trans. Graph. 37, 4, Article 111 (August 2018), 6 pages. https://doi.org/10.1145/1122445.1122456.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Zukerman I., McConachy R., George S. Using argumentation strategies in automated argument generation // In INLG’2000 Proc. of the First International Conference on Natural Language Generation. Mitzpe Ramon, Israel. Association for Computational Linguistics. 2000. P. 55–62.</mixed-citation><mixed-citation xml:lang="en">Zukerman I., McConachy R., George S. Using argumentation strategies in automated argument generation. In INLG’2000 Proc. of the First International Conference on Natural Language Generation. Mitzpe Ramon, Israel. Association for Computational Linguistics, 2000, pp. 55–62.</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>
