Ivan Habernal Iryna Gurevych Kevin Ashley Claire Cardie Nancy Green Diane Litman Georgios Petasis Chris Reed Noam Slonim Vern Walker September 2017

Copenhagen, Denmark

Association for Computational Linguistics http://www.aclweb.org/anthology/W17-51 book ArgumentMining:2017 ConstanzaFierro ClaudioFuentes JorgePérez MauricioQuezada Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 1–10 http://www.aclweb.org/anthology/W17-5101 In this paper we present the dataset of 200,000+ political arguments produced in the local phase of the 2016 Chilean constitutional process. We describe the human processing of this data by the government officials, and the manual tagging of arguments performed by members of our research group. Afterwards we focus on classification tasks that mimic the human processes, comparing linear methods with neural network architectures. The experiments show that some of the manual tasks are suitable for automatization. In particular, the best methods achieve a 90% top-5 accuracy in a multi-class classification of arguments, and 65% macro-averaged F1-score for tagging arguments according to a three-part argumentation model. inproceedings fierro-EtAl:2017:ArgumentMining ChristopherHidey ElenaMusi AlyssaHwang SmarandaMuresan KathyMcKeown Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 11–21 http://www.aclweb.org/anthology/W17-5102 Argumentative text has been analyzed both theoretically and computationally in terms of argumentative structure that consists of argument components (e.g., claims, premises) and their argumentative relations (e.g., support, attack). Less emphasis has been placed on analyzing the semantic types of argument components. We propose a two-tiered annotation scheme to label claims and premises and their semantic types in an online persuasive forum, Change My View, with the long-term goal of understanding what makes a message persuasive. Premises are annotated with the three types of persuasive modes: ethos, logos, pathos, while claims are labeled as interpretation, evaluation, agreement, or disagreement, the latter two designed to account for the dialogical nature of our corpus. We aim to answer three questions: 1) can humans reliably annotate the semantic types of argument components? 2) are types of premises/claims positioned in recurrent orders? and 3) are certain types of claims and/or premises more likely to appear in persuasive messages than in non-persuasive messages? inproceedings hidey-EtAl:2017:ArgumentMining HiroakiYamada SimoneTeufel TakenobuTokunaga Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 22–31 http://www.aclweb.org/anthology/W17-5103 We propose a method for the annotation of Japanese civil judgment documents, with the purpose of creating flexible summaries of these. The first step, described in the current paper, concerns content selection, i.e., the question of which material should be extracted initially for the summary. In particular, we utilize the hierarchical argument structure of the judgment documents. Our main contributions are a) the design of an annotation scheme that stresses the connection between legal points (called issue topics) and argument structure, b) an adaptation of rhetorical status to suit the Japanese legal system and c) the definition of a linked argument structure based on legal sub-arguments. In this paper, we report agreement between two annotators on several aspects of the overall task. inproceedings yamada-teufel-tokunaga:2017:ArgumentMining RoyBar-Haim LilachEdelstein CharlesJochim NoamSlonim Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 32–38 http://www.aclweb.org/anthology/W17-5104 Stance classification is a core component in on-demand argument construction pipelines. Previous work on claim stance classification relied on background knowledge such as manually-composed sentiment lexicons. We show that both accuracy and coverage can be significantly improved through automatic expansion of the initial lexicon. We also developed a set of contextual features that further improves the state-of-the-art for this task. inproceedings barhaim-EtAl:2017:ArgumentMining JohnLawrence ChrisReed Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 39–48 http://www.aclweb.org/anthology/W17-5105 This paper presents a method of extracting argumentative structure from natural language text. The approach presented is based on the way in which we understand an argument being made, not just from the words said, but from existing contextual knowledge and understanding of the broader issues. We leverage high-precision, low-recall techniques in order to automatically build a large corpus of inferential statements related to the text's topic. These statements are then used to produce a matrix representing the inferential relationship between different aspects of the topic. From this matrix, we are able to determine connectedness and directionality of inference between statements in the original text. By following this approach, we obtain results that compare favourably to those of other similar techniques to classify premise-conclusion pairs (with results 22 points above baseline), but without the requirement of large volumes of annotated, domain specific data. inproceedings lawrence-reed:2017:ArgumentMining1 HenningWachsmuth MartinPotthast KhalidAl Khatib YamenAjjour JanaPuschmann JianiQu JonasDorsch ViorelMorari JanekBevendorff BennoStein Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 49–59 http://www.aclweb.org/anthology/W17-5106 Computational argumentation is expected to play a critical role in the future of web search. To make this happen, many search-related questions must be revisited, such as how people query for arguments, how to mine arguments from the web, or how to rank them. In this paper, we develop an argument search framework for studying these and further questions. The framework allows for the composition of approaches to acquiring, mining, assessing, indexing, querying, retrieving, ranking, and presenting arguments while relying on standard infrastructure and interfaces. Based on the framework, we build a prototype search engine, called args, that relies on an initial, freely accessible index of nearly 300k arguments crawled from reliable web resources. The framework and the argument search engine are intended as an environment for collaborative research on computational argumentation and its practical evaluation. inproceedings wachsmuth-EtAl:2017:ArgumentMining YufangHou CharlesJochim Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 60–66 http://www.aclweb.org/anthology/W17-5107 In this paper, we address the problem of argument relation classification where argument units are from different texts. We design a joint inference method for the task by modeling argument relation classification and stance classification jointly. We show that our joint model improves the results over several strong baselines. inproceedings hou-jochim:2017:ArgumentMining AhmetAker HuangpanZhang Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 67–72 http://www.aclweb.org/anthology/W17-5108 W17-5108.Attachment.txt Argumentative corpora are costly to create and are available in only few languages with English dominating the area. In this paper we release the first publicly available Mandarin argumentative corpus. The corpus is created by exploiting the idea of comparable corpora from Statistical Machine Translation. We use existing corpora in English and manually map the claims and premises to comparable corpora in Mandarin. We also implement a simple solution to automate this approach with the view of creating argumentative corpora in other less-resourced languages. In this way we introduce a new task of multi-lingual argument mapping that can be evaluated using our English-Mandarin argumentative corpus. The preliminary results of our automatic argument mapper mirror the simplicity of our approach, but provide a baseline for further improvements. inproceedings aker-zhang:2017:ArgumentMining NancyGreen Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 73–78 http://www.aclweb.org/anthology/W17-5109 This paper describes a pilot study to evaluate human analysts’ ability to identify the argumentation scheme and premises of an argument having an implicit conclusion. In preparation for the study, argumentation scheme definitions were crafted for genetics research articles. The schemes were defined in semantic terms, following a proposal to use semantic rules to mine arguments in that literature. inproceedings green:2017:ArgumentMining RanLevy ShaiGretz BenjaminSznajder ShayHummel RanitAharonov NoamSlonim Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 79–84 http://www.aclweb.org/anthology/W17-5110 W17-5110.Attachment.zip Automatic claim detection is a fundamental argument mining task that aims to automatically mine claims regarding a topic of consideration. Previous works on mining argumentative content have assumed that a set of relevant documents is given in advance. Here, we present a first corpus– wide claim detection framework, that can be directly applied to massive corpora. Using simple and intuitive empirical observations, we derive a claim sentence query by which we are able to directly retrieve sentences in which the prior probability to include topic-relevant claims is greatly enhanced. Next, we employ simple heuristics to rank the sentences, leading to an unsupervised corpus–wide claim detection system, with precision that outperforms previously reported results on the task of claim detection given relevant documents and labeled data. inproceedings levy-EtAl:2017:ArgumentMining PatrickSaint-Dizier Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 85–90 http://www.aclweb.org/anthology/W17-5111 This short paper presents a first implementation of a knowledge-driven argument mining approach. The major processing steps and language resources of the system are surveyed. An indicative evaluation outlines challenges and improvement directions. inproceedings saintdizier:2017:ArgumentMining AhmetAker AlfredSliwa YuanMa RuishenLui NiravkumarBorad SeyedehZiyaei MinaGhobadi Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 91–96 http://www.aclweb.org/anthology/W17-5112 This paper offers a comparative analysis of the performance of different supervised machine learning methods and feature sets on argument mining tasks. Specifically, we address the tasks of extracting argumentative segments from texts and predicting the structure between those segments. Eight classifiers and different combinations of six feature types reported in previous work are evaluated. The results indicate that overall best performing features are the structural ones. Although the performance of classifiers varies depending on the feature combinations and corpora used for training and testing, Random Forest seems to be among the best performing classifiers. These results build a basis for further development of argument mining techniques and can guide an implementation of argument mining into different applications such as argument based search. inproceedings aker-EtAl:2017:ArgumentMining AlfioFerrara StefanoMontanelli GeorgiosPetasis Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 97–107 http://www.aclweb.org/anthology/W17-5113 In this paper we present a new unsupervised approach, "Attraction to Topics" – A2T , for the detection of argumentative units, a sub-task of argument mining. Motivated by the importance of topic identification in manual annotation, we examine whether topic modeling can be used for performing unsupervised detection of argumentative sentences, and to what extend topic modeling can be used to classify sentences as claims and premises. Preliminary evaluation results suggest that topic information can be successfully used for the detection of argumentative sentences, at least for corpora used for evaluation. Our approach has been evaluated on two English corpora, the first of which contains 90 persuasive essays, while the second is a collection of 340 documents from user generated content. inproceedings ferrara-montanelli-petasis:2017:ArgumentMining JohnLawrence ChrisReed Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 108–117 http://www.aclweb.org/anthology/W17-5114 In this paper we consider the insights that can be gained by considering large scale argument networks and the complex interactions between their constituent propositions. We investigate metrics for analysing properties of these networks, illustrating these using a corpus of arguments taken from the 2016 US Presidential Debates. We present techniques for determining these features directly from natural language text and show that there is a strong correlation between these automatically identified features and the argumentative structure contained within the text. Finally, we combine these metrics with argument mining techniques and show how the identification of argumentative relations can be improved by considering the larger context in which they occur. inproceedings lawrence-reed:2017:ArgumentMining2 YamenAjjour Wei-FanChen JohannesKiesel HenningWachsmuth BennoStein Proceedings of the 4th Workshop on Argument Mining September 2017

Copenhagen, Denmark

Association for Computational Linguistics 118–128 http://www.aclweb.org/anthology/W17-5115 The segmentation of an argumentative text into argument units and their non-argumentative counterparts is the first step in identifying the argumentative structure of the text. Despite its importance for argument mining, unit segmentation has been approached only sporadically so far. This paper studies the major parameters of unit segmentation systematically. We explore the effectiveness of various features, when capturing words separately, along with their neighbors, or even along with the entire text. Each such context is reflected by one machine learning model that we evaluate within and across three domains of texts. Among the models, our new deep learning approach capturing the entire text turns out best within all domains, with an F-score of up to 88.54. While structural features generalize best across domains, the domain transfer remains hard, which points to major challenges of unit segmentation. inproceedings ajjour-EtAl:2017:ArgumentMining