Abstract
Argument mining seeks to extract arguments and their structure from unstructured texts. Identifying relations (such as attack, support, and neutral) between argumentative units is a challenging task because two units may be related to each other via implicit inferences. These inferences often rely on external commonsense knowledge to discover how one argumentative unit relates to another. State-of-the-art methods, however, rely on predefined knowledge graphs, and thus might not cover target pairs of argumentative units well. We introduce a new generative approach to finding inference chains that connect these pairs by making use of the Commonsense Transformer (COMET). We evaluate our approach on three datasets for both the two-label (attack/support) and three-label (attack/support/neutral) tasks. Our approach significantly outperforms the state-of-the-art, by 2- 5% in F1 score, on two out of the three datasets with minor improvements on the remaining one.
Original language | English |
---|---|
Title of host publication | Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics |
Editors | Andreas Vlachos, Isabelle Augenstein |
Publisher | Association for Computational Linguistics (ACL) |
Pages | 2484 – 2495 |
Number of pages | 12 |
Publication status | Published - 2 May 2023 |
Event | The 17th Conference of the European Chapter of the Association for Computational Linguistics - Valamar Lacroma, Dubrovnik, Croatia Duration: 2 May 2023 → 6 May 2023 Conference number: 17 https://2023.eacl.org/ |
Conference
Conference | The 17th Conference of the European Chapter of the Association for Computational Linguistics |
---|---|
Abbreviated title | EACL 2023 |
Country/Territory | Croatia |
City | Dubrovnik |
Period | 2/05/23 → 6/05/23 |
Internet address |