Parsing Argumentation Structures in Persuasive Essays

In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed model globally optimizes argument component types and argumentative relations using integer linear programming. We show that our model considerably improves the performance of base classifiers and significantly outperforms challenging heuristic baselines. Moreover, we introduce a novel corpus of persuasive essays annotated with argumentation structures. We show that our annotation scheme and annotation guidelines successfully guide human annotators to substantial agreement. This corpus and the annotation guidelines are freely available for ensuring reproducibility and to encourage future research in computational argumentation.Comment: Under review in Computational Linguistics. First submission: 26 October 2015. Revised submission: 15 July 201

Cross-lingual Argumentation Mining: Machine Translation (and a bit of Projection) is All You Need!

Argumentation mining (AM) requires the identification of complex discourse structures and has lately been applied with success monolingually. In this work, we show that the existing resources are, however, not adequate for assessing cross-lingual AM, due to their heterogeneity or lack of complexity. We therefore create suitable parallel corpora by (human and machine) translating a popular AM dataset consisting of persuasive student essays into German, French, Spanish, and Chinese. We then compare (i) annotation projection and (ii) bilingual word embeddings based direct transfer strategies for cross-lingual AM, finding that the former performs considerably better and almost eliminates the loss from cross-lingual transfer. Moreover, we find that annotation projection works equally well when using either costly human or cheap machine translations. Our code and data are available at \url{http://github.com/UKPLab/coling2018-xling_argument_mining}.Comment: Accepted at Coling 201

ÉTUDE THÉORIQUE DU SPECTRE D'UN RAYONNEMENT GAMMA ÉMIS LORS D'UNE RÉACTION NUCLÉAIRE MESURES DE VIES MOYENNES

A l'aide des détecteurs à semi-conducteur, il s'est avéré possible de mesurer le spectre continu d'un rayonnement gamma émis lors d'une réaction nucléaire. Ce spectre, dû à l'effet Doppler, est fonction de la vie moyenne de l'état initial de la transition électromagnétique. Les résultats expérimentaux obtenus permettent d'envisager la mesure de vies moyennes

Debating Technology for Dialogical Argument:Sensemaking, Engagement and Analytics

Debating technologies, a newly emerging strand of research into computational technologies to support human debating, offer a powerful way of providing naturalistic, dialogue-based interaction with complex information spaces. The full potential of debating technologies for dialogical argument can, however, only be realized once key technical and engineering challenges are overcome, namely data structure, data availability, and interoperability between components. Our aim in this article is to show that the Argument Web, a vision for integrated, reusable, semantically rich resources connecting views, opinions, arguments, and debates online, offers a solution to these challenges. Through the use of a running example taken from the domain of citizen dialogue, we demonstrate for the first time that different Argument Web components focusing on sensemaking, engagement, and analytics can work in concert as a suite of debating technologies for rich, complex, dialogical argument

Background discrimination capabilities of a heat and ionization germanium cryogenic detector

The discrimination capabilities of a 70 g heat and ionization Ge bolometer are studied. This first prototype has been used by the EDELWEISS Dark Matter experiment, installed in the Laboratoire Souterrain de Modane, for direct detection of WIMPs. Gamma and neutron calibrations demonstrate that this type of detector is able to reject more than 99.6% of the background while retaining 95% of the signal, provided that the background events distribution is not biased towards the surface of the Ge crystal. However, the 1.17 kg.day of data taken in a relatively important radioactive environment show an extra population slightly overlapping the signal. This background is likely due to interactions of low energy photons or electrons near the surface of the crystal, and is somewhat reduced by applying a higher charge-collecting inverse bias voltage (-6 V instead of -2 V) to the Ge diode. Despite this contamination, more than 98% of the background can be rejected while retaining 50% of the signal. This yields a conservative upper limit of 0.7 event.day^{-1}.kg^{-1}.keV^{-1}_{recoil} at 90% confidence level in the 15-45 keV recoil energy interval; the present sensitivity appears to be limited by the fast ambient neutrons. Upgrades in progress on the installation are summarized.Comment: Submitted to Astroparticle Physics, 14 page

Surface remeshing by local hermite diffuse interpolation

International audienceWe propose a method to build a three-dimensional adapted surface mesh with respect to a mesh size map driven by surface curvature. The data needed to optimize the mesh have been reduced to an initial mesh. The building of a local geometrical model but continuous over the whole domain is based on a local Hermite diffuse interpolation calculated from the nodes of the initial mesh and from the normal vectors to the surface. The optimization procedures involve extracting from the surface mesh sets of triangles sharing the same node or the same edge and then remeshing the outer contour to a higher criterion (size or shape). These procedures may be used in order to refine or coarsen the mesh but also in a final step to enhance the shape quality of the elements. Examples demonstrate the ability of the method to create adapted meshes of complex surfaces while meeting high-quality standards and a good respect of the geometrical surface

Argumentative Writing Support by means of Natural Language Processing

Persuasive essay writing is a powerful pedagogical tool for teaching argumentation skills. So far, the provision of feedback about argumentation has been considered a manual task since automated writing evaluation systems are not yet capable of analyzing written arguments. Computational argumentation, a recent research field in natural language processing, has the potential to bridge this gap and to enable novel argumentative writing support systems that automatically provide feedback about the merits and defects of written arguments. The automatic analysis of natural language arguments is, however, subject to several challenges. First of all, creating annotated corpora is a major impediment for novel tasks in natural language processing. At the beginning of this research, it has been mostly unknown whether humans agree on the identification of argumentation structures and the assessment of arguments in persuasive essays. Second, the automatic identification of argumentation structures involves several interdependent and challenging subtasks. Therefore, considering each task independently is not sufficient for identifying consistent argumentation structures. Third, ordinary arguments are rarely based on logical inference rules and are hardly ever in a standardized form which poses additional challenges to human annotators and computational methods. To approach these challenges, we start by investigating existing argumentation theories and compare their suitability for argumentative writing support. We derive an annotation scheme that models arguments as tree structures. For the first time, we investigate whether human annotators agree on the identification of argumentation structures in persuasive essays. We show that human annotators can reliably apply our annotation scheme to persuasive essays with substantial agreement. As a result of this annotation study, we introduce a unique corpus annotated with fine-grained argumentation structures at the discourse-level. Moreover, we pre- sent a novel end-to-end approach for parsing argumentation structures. We identify the boundaries of argument components using sequence labeling at the token level and propose a novel joint model that globally optimizes argument component types and argumentative relations for identifying consistent argumentation structures. We show that our model considerably improves the performance of local base classifiers and significantly outperforms challenging heuristic baselines. In addition, we introduce two approaches for assessing the quality of natural language arguments. First, we introduce an approach for identifying myside biases which is a well-known tendency to ignore opposing arguments when formulating arguments. Our experimental results show that myside biases can be recognized with promising accuracy using a combination of lexical features, syntactic features and features based on adversative transitional phrases. Second, we investigate for the first time the characteristics of insufficiently supported arguments. We show that insufficiently supported arguments frequently exhibit specific lexical indicators. Moreover, our experimental results indicate that convolutional neural networks significantly outperform several challenging baselines

Argument Annotated Essays

The corpus consists of argument annotated persuasive essays including annotations of argument components and argumentative relations