Open Argument Mining

Open Argument Mining


Open debates include so many arguments that sound decision making exceeds cognitive capabilities of the interested public or responsible experts. Until now, argument mining approaches typically map from a closed set of given texts into a formal argumentation model. However, this does not fully cater to the nature of open, ongoing debates because of the following challenges:

  • (C1) Following a Continuous Debate: Participants in open, mass debates continuously introduce new arguments with novel aspects relevant to the debate topic. This leads to brittleness of state-of-the-art argument extractors, which are trained once and for all time.
  • (C2) Dealing with Incomplete Arguments: Textual arguments are often incomplete because the participants in the debate can understand them based on common background or shared knowledge. Hence argument structures which are identified by current argument mining methods are often incomplete.
  • (C3) Establishing Open Knowledge for Argumentation: Interpreting and understanding textual arguments requires additional facts and common knowledge which are often absent in existing knowledge graphs.


This project aims at investigating computational methods that i) continuously improve their capability to recognize arguments in ongoing debates, ii) align incomplete arguments with previous arguments and enrich them with automatically acquired background knowledge, and iii) constantly extend semantic knowledge bases with information required to understand arguments. Our goal is to arrive at an Open Argument Mining approach that is open with respect to new arguments emerging in ongoing debates, open to consider and contextualize incomplete arguments, and open to continuously acquire and extend knowledge required to understand such arguments.


  • Prof. Dr. Iryna Gurevych, Principal Investigator
  • Tilman Beck, Doctoral Researcher
  • (Former) Dr. Christian Stab, Postdoctoral Researcher


This project is established in cooperation with WeST: Institute for Web Science and Technologies in Koblenz:

  • Prof. Dr. Steffen Staab
  • Dr. Claudia Schon
  • Lukas Schmelzeisen


Reimers, Nils ; Schiller, Benjamin ; Beck, Tilman ; Daxenberger, Johannes ; Stab, Christian ; Gurevych, Iryna (2019):
Classification and Clustering of Arguments with Contextualized Word Embeddings.
S. 567-578, The 57th Annual Meeting of the Association for Computational Linguistics (ACL 2019), Florence, Italy, 28.07.2019-02.08.2019, [Konferenzveröffentlichung]

Daxenberger, Johannes ; Schiller, Benjamin ; Stahlhut, Chris ; Kaiser, Erik ; Gurevych, Iryna (2020):
ArgumenText: Argument Classification and Clustering in a Generalized Search Scenario.
In: Datenbank-Spektrum, 20 (2), S. 115-121. Springer, ISSN 1618-2162,
DOI: 10.1007/s13222-020-00347-7,

go to TU-biblio search on ULB website