<?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-2022-20-1-21-36</article-id><article-id custom-type="elpub" pub-id-type="custom">lingngu-331</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>THEORETICAL AND APPLIED LINGUISTICS</subject></subj-group></article-categories><title-group><article-title>Формальное выявление приемов аргументации в научных текстах</article-title><trans-title-group xml:lang="en"><trans-title>Formal Identification of Argumentation Patterns in Scientific 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, Postgraduate Student</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-2345-6789</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 and Mathematics)</p><p>Novosibirsk</p></bio><email xlink:type="simple">salomatina_nv@live.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-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)</p><p>Novosibirsk</p></bio><email xlink:type="simple">mtimof@inbox.ru</email><xref ref-type="aff" rid="aff-2"/></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>Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>21</day><month>03</month><year>2022</year></pub-date><volume>20</volume><issue>1</issue><fpage>21</fpage><lpage>36</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Пименов И.С., Саломатина Н.В., Тимофеева М.К., 2022</copyright-statement><copyright-year>2022</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/331">https://lingngu.elpub.ru/jour/article/view/331</self-uri><abstract><p>Представлены методы и полученные с их помощью результаты автоматизированного выявления приемов аргументации. Исследуемым материалом служили построенные путем экспертной разметки аргументационные аннотации 25-ти научных текстов двух тематик. Разметка проводилась с помощью веб-инструментов, позволяющих визуализировать аргументативные утверждения и схемы аргументации, строить аргументационную структуру текста в виде ориентированного графа. В графе содержатся два типа вершин: информационные вершины-утверждения и связывающие их модели (схемы) рассуждений из компендиума Уолтона. Под приемами аргументации в данной работе понимается применение повторяющихся отдельных моделей рассуждения и образуемых ими повторяющихся структур (подграфов) аргументации. Разметка приемов, включающих в свою структуру более одной схемы, в графе отсутствует. Использовано описание аргументационных аннотаций и аннотированной коллекции в форме совместного спектра характеристик, содержащих повторяющиеся приемы с их абсолютными и текстовыми частотами. Приемы аргументации, образуемые тремя и более схемами, были выявлены методами частотного анализа подграфов (FSM). Сравнение подграфов осуществлялось с помощью программы из библиотеки NetworkX, реализующей точный алгоритм установления изоморфизма подграфов VF2. Полученные частотные характеристики позволили обнаружить общие закономерности в использовании характерных для научных текстов приемов аргументации, а также специфические особенности их употребления в зависимости от темы (лингвистика и компьютерные технологии). Закономерности проявляются в применении как отдельных схем, так и структурно организованных. Конфигурация последних представляет собой либо цепочки аргументов (до 5 элементов), либо ветвящиеся деревья различной глубины (содержащие до 8 вершин). Данные результаты можно использовать для определения близости текстов по применяемым в них приемам аргументации, что, в свою очередь, может быть дополнительной полезной информацией при кластеризации и классификации текстов, оценке их убедительности, а также при формальном синтезе аргументации.</p></abstract><trans-abstract xml:lang="en"><p>In this paper we present the methods for the automatic identification of argumentation patterns and the results of their application. These methods have been employed to analyze argumentation annotations of 25 scientific texts from two thematic areas. Under study were the expert annotations constructed manually with the help of web tools for visualizing argumentative statements and argumentation schemes, as well as for modelling the argumentation structure of a text as an oriented graph. Such graphs contain two node types: information nodes denoting statements and their connecting reasoning models (schemas) from Walton's compendium. The regularly employed reasoning models and their structural combinations (argumentation subgraphs) form argumentation patterns. Patterns containing more than one scheme are unmarked in initial graphs. As a result of processing argumentation annotations from the collection, we have constructed a joint spectrum of argumentation patterns with their absolute and text frequencies. The methods of frequent subgraph mining have been used to identify argumentation patterns containing three or more schemes. The subgraph matching has been performed through the use of the NetworkX package which implements the VF2 algorithm for subgraph isomorphism testing. We have analyzed the calculated frequencies to identify both the general principles behind the use of argumentation patterns typical of scientific texts, as well as the specific tendencies of their functioning within distinct thematic areas (linguistics and computer science). These general principles regulate the use of both separate schemes and their structural combinations. The latter appear in two configuration types: either as sequencies of argumentation schemes (up to 5 elements) or as tree structures (which contain up to 8 nodes). Specifically, we demonstrate that branching within a tree-form pattern typically presupposes the parallel use of identical argumentation schemes. Additionally, branching of argumentation patterns occurs more often in proximity to the main thesis of a text, than near the initial premises. Finally, the thematic area can condition not only the use of separate schemes, but also their structural combination within complex patterns. The results obtained are applicable to the evaluation of text similarity based on argumentation patterns employed in them, which, in its turn, can improve the clustering and classification of texts, evaluation of their persuasiveness, as well as the formal synthesis of argumentation.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>научные тексты</kwd><kwd>аргументационная структура текста</kwd><kwd>схемы рассуждения Уолтона</kwd><kwd>приемы аргументации</kwd><kwd>общие подграфы графов аргументации</kwd><kwd>корпусная лингвистика</kwd><kwd>лингвистика текста</kwd></kwd-group><kwd-group xml:lang="en"><kwd>popular science texts</kwd><kwd>scientific texts</kwd><kwd>argumentation graph</kwd><kwd>Walton’s argumentation schemes</kwd><kwd>strategy-related patterns</kwd><kwd>common subgraph</kwd><kwd>corpus linguistics</kwd><kwd>text linguistics</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена в рамках государственного задания ИМ СО РАН (проекты № FWNF-2022-0015 и FWNF-2022-0012).</funding-statement><funding-statement xml:lang="en">The research was conducted within the framework of the state contract of Sobolev Institute of Mathematics (projects no. FWNF-2022-0015 and FWNF-2022-0012).</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">Инькова О., Манзотти Э. Связность текста: мереологические логико-семантические отношения. М.: ИД ЯСК, 2019. 376 с.</mixed-citation><mixed-citation xml:lang="en">Al-Khatib, K., Wachsmuth, H., Hagen, M., Stein, B. Patterns of Argumentation Strategies across Topics. In: Proc. of the 2017 Conference on Empirical Methods in Natural Language. Copenhagen, Denmark, 2017, pp. 1351–1357.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Лукашевич Н. В. Тезаурусы в задачах информационного поиска. М.: Изд-во Моск. ун-та, 2011. 512 с. Пименов И. С. Специфика аргументационного аннотирования научных и научно-популярных текстов // Корпусная лингвистика – 2021: Тр. Междунар. конф. СПб.: Скифия-принт, 2021. ISBN 978-5-98620-557-1</mixed-citation><mixed-citation xml:lang="en">Anand, P. et al. Believe Me – We Can Do This! Annotating Persuasive Acts in Blog Text. In: Computational Models of Natural Argument. San Francisco, CA, USA, 2011, August 7.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Саломатина Н. В., Пименов И. С. N-граммный анализ аргументационных аннотаций текстов // Знания – Онтологии – Теории (ЗОНТ): Тр. Междунар. конф., 2021. URL: https://drive.google.com/file/d/1vLlHJk_cjYaSK9lwpw1i2HPNr8Qtmy1t/view</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="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Сидорова Е. А., Ахмадеева И. Р., Загорулько Ю. А., Серый А. С., Шестаков В. К. Платформа для исследования аргументации в научно-популярном дискурсе // Онтология проектирования. 2020. Т. 10, № 4 (38). С. 489–502.</mixed-citation><mixed-citation xml:lang="en">El Baff, R., Wachsmuth, H., Al Khatib, Kh., 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. Hagberg, A. A., Schult, D. A., Swart, P. J. Exploring network structure, dynamics, and function using NetworkX. In: Proc. of the 7th Python in Science Conference (SciPy2008). Pasadena, CA, USA, 2008, pp. 11–15.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Al-Khatib, K., Wachsmuth, H., Hagen, M., Stein, B. Patterns of Argumentation Strategies across Topics. In: Proc. of the 2017 Conference on Empirical Methods in Natural Language. Copenhagen, Denmark, 2017, pp. 1351–1357.</mixed-citation><mixed-citation xml:lang="en">Fishcheva, I., Kotelnikov, E. Cross-Lingual Argumentation Mining for Russian Texts. In: Proc. of the 8th International Conference “Analysis of Images, Social Networks and Texts”. Kazan, 2019, pp. 134–144.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Anand, P. et al. Believe Me – We Can Do This! Annotating Persuasive Acts in Blog Text. In: Computational Models of Natural Argument. San Francisco, CA, USA, 2011, August 7.</mixed-citation><mixed-citation xml:lang="en">Inkova, O., Manzotti, E. Text coherence: mereological logico-semantic relations. Moscow, LRC Publ., 2019, 376 p. (in Russ.) Jiang, C., Coenen, F., Zito, M. A Survey of Frequent Subgraph Mining Algorithms. The Knowledge Engineering Review, 2004, no. 000(1), pp. 1–31.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</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, pp. 1367–1372.</mixed-citation><mixed-citation xml:lang="en">Lawrence, J., Reed, C. Argument Mining: A Survey. Computational Linguistics, 2019, vol. 45, no. 4, pp. 765‒818.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">El Baff, R., Wachsmuth, H., Al Khatib, Kh., 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. Hagberg, A. A., Schult, D. A., Swart, P. J. Exploring network structure, dynamics, and function using NetworkX. In: Proc. of the 7th Python in Science Conference (SciPy2008). Pasadena, CA, USA, 2008, pp. 11–15.</mixed-citation><mixed-citation xml:lang="en">Lippi, M., Torrony, P. Argumentation Mining: State of the Art and Emerging Trends. ACM Transactions on Internet Technology, 2016, vol. 16, article 10.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Fishcheva, I., Kotelnikov, E. Cross-Lingual Argumentation Mining for Russian Texts. In: Proc. of the 8th International Conference “Analysis of Images, Social Networks and Texts”. Kazan, 2019, pp. 134–144. Jiang, C., Coenen, F., Zito, M. A Survey of Frequent Subgraph Mining Algorithms. The Knowledge Engineering Review, 2004, no. 000(1), pp. 1–31.</mixed-citation><mixed-citation xml:lang="en">Lukashevich, N. V. Thesauri in Information Retrieval Problems. Moscow, Moscow State Uni. Press, 2011, 512 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Lawrence, J., Reed, C. Argument Mining: A Survey. Computational Linguistics, 2019, vol. 45, no. 4, pp. 765‒818.</mixed-citation><mixed-citation xml:lang="en">Madnani, N., Heilman, M., Tetreault, J., Chodorow, M. Identifying high-level organizational elements in argumentative discourse. In: Proc. of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Montréal, Canada, NAACL, Association for Computational Linguistics, 2012, pp. 20–28. Pimenov, I. S. On argumentation annotation of scientific and popular science texts. In: Corpus Linguistics – 2021. Proc. of the International Conference. St. Petersburg, Skifia Print, 2021. (in Russ.) ISBN 978-5-98620-557-1</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Lippi, M., Torrony, P. Argumentation Mining: State of the Art and Emerging Trends. ACM Transactions on Internet Technology, 2016, vol. 16, article 10.</mixed-citation><mixed-citation xml:lang="en">Rahwan, I., Reed, C. The argument interchange format. In: Rahwan, I., Simari, G. (eds.). Argu-mentation in artificial intelligence. Springer, 2009, pp. 383–402.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Madnani, N., Heilman, M., Tetreault, J., Chodorow, M. Identifying high-level organizational elements in argumentative discourse. In: Proc. of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Montréal, Canada, NAACL, Association for Computational Linguistics, 2012, pp. 20–28.</mixed-citation><mixed-citation xml:lang="en">Salomatina, N. V., Pimenov, I. S. The N-gram analysis of argumentation annotations of texts. In: Knowledge ‒ Ontology ‒ Theory. Proc. of the VIII International Conference, 2021. (in Russ.) URL: https://https://drive.google.com/file/d/1vLlHJk_cjYaSK9lwpw1i2HPNr8Qtmy1t/view</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Rahwan, I., Reed, C. The argument interchange format. In: Rahwan, I., Simari, G. (eds.). Argumentation in artificial intelligence. Springer, 2009, pp. 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 Design, 2020, vol. 10, no. 4 (38), pp. 489–502. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Taboada, M., Mann, W. Rhetorical Structure Theory: Looking back and moving ahead. Discourse Stud., 2006, no. 8, pp. 423–459.</mixed-citation><mixed-citation xml:lang="en">Taboada, M., Mann, W. Rhetorical Structure Theory: Looking back and moving ahead. Discourse Stud., 2006, no. 8, pp. 423–459.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Ullmann, J. R. An Algorithm for Subgraph Isomorphism. Journal of the ACM, 1976, vol. 23 (1), pp. 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="cit16"><label>16</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. In: Proc. of the 27th International Conference on Computational Linguistics. Santa Fe, New Mexico, USA, 2018, pp. 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. In: Proc. of the 27th International Conference on Computational Linguistics. Santa Fe, New Mexico, USA, 2018, pp. 3753–3765.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Walton, D., Reed, C., Macagno, F. Argumentation schemes Fundamentals of critical argumentation. New York, Cambridge Uni. 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 Uni. Press, 2008, 443 p.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Xinyu Hua, Lu Wang. Understanding and Detecting Supporting Arguments of Diverse Types. In: Proc. of the 55th Annual Meeting of the Association for Computational Linguistics. Vancouver, Canada, ACL Association for Computational Linguistics, 2017, vol. 2, pp. 203–208.</mixed-citation><mixed-citation xml:lang="en">Xinyu Hua, Lu Wang. Understanding and Detecting Supporting Arguments of Diverse Types. In: Proc. of the 55th Annual Meeting of the Association for Computational Linguistics. Vancouver, Canada, ACL Association for Computational Linguistics, 2017, vol. 2, pp. 203–208.</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>
