Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics 2019
DOI: 10.18653/v1/p19-1463
|View full text |Cite
|
Sign up to set email alerts
|

Yes, we can! Mining Arguments in 50 Years of US Presidential Campaign Debates

Abstract: Political debates offer a rare opportunity for citizens to compare the candidates' positions on the most controversial topics of the campaign. Thus they represent a natural application scenario for Argument Mining. As existing research lacks solid empirical investigation of the typology of argument components in political debates, we fill this gap by proposing an Argument Mining approach to political debates. We address this task in an empirical manner by annotating 39 political debates from the last 50 years … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(26 citation statements)
references
References 19 publications
0
26
0
Order By: Relevance
“…Here, it is important to make emphasis that the way we considered to represent argumentative relations (i.e., IAT labelling) make this task harder than most of the previous work (i.e., attack/support) in this area. We obtained a 0.70 macro F1-score with RoBERTa-large, outperforming the most recent work in argument relation identification, even with a harder instance of the task (macro F1-score of 0.67 on Claim/Premise classification in [5]). In order to have a more strong reference to compare with previous results, we carried out an experiment using the same parameters but restricting the classes to be learnt to only attack and support relations.…”
Section: Resultsmentioning
confidence: 64%
See 2 more Smart Citations
“…Here, it is important to make emphasis that the way we considered to represent argumentative relations (i.e., IAT labelling) make this task harder than most of the previous work (i.e., attack/support) in this area. We obtained a 0.70 macro F1-score with RoBERTa-large, outperforming the most recent work in argument relation identification, even with a harder instance of the task (macro F1-score of 0.67 on Claim/Premise classification in [5]). In order to have a more strong reference to compare with previous results, we carried out an experiment using the same parameters but restricting the classes to be learnt to only attack and support relations.…”
Section: Resultsmentioning
confidence: 64%
“…With the advent of Neural Networks (NNs), a performance gap between previous works and this new approach could be observed. In [3] and [5] the empirical results obtained by Recurrent Neural Network (RNN) models for AM were significantly better. However, there is an interesting observation to make emphasis on, which makes it hard to compare AM works.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Different methods have been employed to address these tasks, from standard Support Vector Machines (SVMs) to Neural Networks (NNs). AM methods have been applied to heterogeneous types of textual documents, e.g., persuasive essays [22], scientific articles [23], Wikipedia articles [24], political speeches and debates [25,26], and peer reviews [27]. However, only few approaches [28,15,16,17,18] focused on automatically detecting argumentative structures from textual documents in the medical domain, such as clinical trials, clinical guidelines, and Electronic Health Records.…”
Section: Related Workmentioning
confidence: 99%
“…Distinctive feature removal methods namely n-grams, POS tagging etc are utilised to extract significant features. Shohreh Haddadan et al [9] presented an approach to mine sentiments from political debates. He considered US presidential campaign debates for sentiment classification.…”
Section: Literature Reviewmentioning
confidence: 99%