Computational Argumentation Quality Assessment in Natural Language
- Henning Wachsmuth, Nona Naderi, Benno Stein
- PhilosophyConference of the European Chapter of the…
- 1 April 2017
This paper presents the first holistic work on computational argumentation quality in natural language, comprehensively survey the diverse existing theories and approaches to assess logical, rhetorical, and dialectical quality dimensions, and derives a systematic taxonomy from these.
Context Dependent Claim Detection
- Ran Levy, Yonatan Bilu, Daniel Hershcovich, E. Aharoni, N. Slonim
- Computer ScienceInternational Conference on Computational…
- 1 August 2014
This work formally defines the challenging task of automatic claim detection in a given context and outlines a preliminary solution, and assess its performance over annotated real world data, collected specifically for that purpose over hundreds of Wikipedia articles.
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
It is shown that every graph of maximal degree d has a 2-lift such that all “new” eigenvalues are in the range, leading to a deterministic polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue O(d/α)+1.
Are Stable Instances Easy?
The notion of a stable instance for a discrete optimization problem is introduced, and it is argued that in many practical situations only sufficiently stable instances are of interest, and that this is indeed the case for the Max-Cut problem.
Lifts, Discrepancy and Nearly Optimal Spectral Gaps
Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map � : H → G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has…
On codes from hypergraphs
ProtoNet: hierarchical classification of the protein space
The ProtoNet site provides an automatic hierarchical clustering of the SWISS-PROT protein database based on an all-against-all BLAST similarity search that can be used for function prediction, for defining superfamilies and subfamilies and for large-scale protein annotation purposes.
Automatic Claim Negation: Why, How and When
This work asks how this set of detected claims can be augmented further, by adding to it the negation of each detected claim, presenting two NLP problems: how to automatically negate a claim, and when such a negated claim can plausibly be used.
Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap
It is shown that every graph of maximal degree d has a 2-lift such that all "new" eigenvalues are in the range [-c/spl radic/d log/sup 3/d, c/spl Radic/D log/Sup 3/ d] for some constant c, which leads to a polynomial time algorithm for constructing arbitrarily large d-regular graphs.
Corpus Wide Argument Mining - a Working Solution
- L. Ein-Dor, Eyal Shnarch, N. Slonim
- Computer ScienceAAAI Conference on Artificial Intelligence
- 25 November 2019
This work presents a first end-to-end high-precision, corpus-wide argument mining system, made possible by combining sentence-level queries over an appropriate indexing of a very large corpus of newspaper articles, with an iterative annotation scheme.