The approach proposed in this study aims to classify argumentative oppositions. A major assumption of this work is that discriminating among different argumentative stances of support and opposition can facilitate the detection of Argument Schemes. While using Tree Kernels for classification problems can be useful in many Argument Mining sub-tasks, this work focuses on the classification of opposition stances. We show that Tree Kernels can be successfully used (alone or in combination with traditional textual vectorizations) to discriminate between different stances of opposition without requiring highly engineered features. Moreover, this study compare the results of Tree Kernels classifiers with the results of classifiers which use traditional features such as TFIDF and n-grams. This comparison shows that Tree Kernel classifiers can outperform TFIDF and n-grams classifiers.
Davide Liga, Monica Palmirani (2019). Classifying argumentative stances of opposition using Tree Kernels. New York : ACM Association for Computing Machinery [10.1145/3377713.3377717].
Classifying argumentative stances of opposition using Tree Kernels
Davide Liga
Membro del Collaboration Group
;Monica Palmirani
Membro del Collaboration Group
2019
Abstract
The approach proposed in this study aims to classify argumentative oppositions. A major assumption of this work is that discriminating among different argumentative stances of support and opposition can facilitate the detection of Argument Schemes. While using Tree Kernels for classification problems can be useful in many Argument Mining sub-tasks, this work focuses on the classification of opposition stances. We show that Tree Kernels can be successfully used (alone or in combination with traditional textual vectorizations) to discriminate between different stances of opposition without requiring highly engineered features. Moreover, this study compare the results of Tree Kernels classifiers with the results of classifiers which use traditional features such as TFIDF and n-grams. This comparison shows that Tree Kernel classifiers can outperform TFIDF and n-grams classifiers.File | Dimensione | Formato | |
---|---|---|---|
ACM___PrePrint_version_for_MIREL.pdf
accesso aperto
Descrizione: pre-print-ACM-2019
Tipo:
Preprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione
449.68 kB
Formato
Adobe PDF
|
449.68 kB | Adobe PDF | Visualizza/Apri |
3377713.3377717.pdf
accesso riservato
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per accesso riservato
Dimensione
939.45 kB
Formato
Adobe PDF
|
939.45 kB | Adobe PDF | Visualizza/Apri Contatta l'autore |
ACM___POST PRINT_version_for_MIREL.pdf
accesso aperto
Tipo:
Postprint
Licenza:
Licenza per accesso libero gratuito
Dimensione
1.14 MB
Formato
Adobe PDF
|
1.14 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.