Formal Identification of Argumentation Patterns in Scientific Texts

Author:

Pimenov I. S.1ORCID,Salomatina N. V.2ORCID,Timofeeva M. K.2ORCID

Affiliation:

1. Novosibirsk State University

2. Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences

Abstract

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.

Publisher

Novosibirsk State University (NSU)

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Identification of Scientific Texts with Similar Argumentation Complexity;2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON);2022-11-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3