Argument mining (also known as “argumentation mining”) is a young and gradually maturing research area within computational linguistics. At its heart, argument mining involves the automatic identification of argumentative structures in free text, such as the conclusions, premises, and inference schemes of arguments as well as their interrelations and counter-considerations. To date, researchers have investigated argument mining on genres such as legal documents, product reviews, news articles, online debates, user-generated web discourse, Wikipedia articles, academic literature, persuasive essays, tweets, and dialogues. Recently, also argument quality assessment and generation came into focus. In addition, argument mining is inherently tied to stance and sentiment analysis, since every argument carries a stance towards its topic, often expressed with sentiment.
Argument mining gives rise to various practical applications of great importance. In particular, it provides methods that can find and visualize the main pro and con arguments in a text corpus — or even on in an argument search on the web — towards a topic or query of interest. In instructional contexts, written and diagrammed arguments represent educational data that can be mined for conveying and assessing students’ command of course material. In information retrieval, argument mining is expected to play a salient role in the emerging field of conversational search. And with the IBM Debater Project, technology based on argument mining recently received a lot of media attention.
While solutions to basic tasks such as component segmentation and classification slowly become mature, many tasks remain largely unsolved, particularly in more open genres and topical domains. Success in argument mining requires interdisciplinary approaches informed by NLP technology, theories of semantics, pragmatics and discourse, knowledge of discourse in application domains, artificial intelligence, information retrieval, argumentation theory, and computational models of argumentation.
ArgMining 2021 invites the submission of long and short papers on substantial, original, and unpublished research in all aspects of argument mining. The workshop solicits LONG and SHORT papers for oral and poster presentations, as well as DEMOS of argument/argumentation mining systems and tools.The topics for submissions include but are not limited to:
This year, the workshop plans to have a joint session with the workshop CODI (Computational Approaches to Discourse). Submissions that address argumentation from an angle that overlaps with discourse structure phenomena will be considered for that session. (Authors may but need not make this potential overlap explicit)
The workshop is running a double-blind review process. In preparing your manuscript, do not include any information which could reveal your identity, or that of your co-authors. The title section of your manuscript should not contain any author names, email addresses, or affiliation status. If you do include any author names on the title page, your submission will be automatically rejected. In the body of your submission, you should eliminate all direct references to your own previous work. That is, avoid phrases such as "this contribution generalizes our results for XYZ". Also, please do not disproportionately cite your own previous work. In other words, make your submission as anonymous as possible. We need your cooperation in our effort to maintain a fair, double-blind reviewing process - and to consider all submissions equally. Double Submission Papers that have been or will be submitted to other venues should indicate this at submission time. Upon acceptance at either event, the submission must be withdrawn from the other. To save reviewers' efforts, avoid submitting (or withdraw early) papers that are on track to be accepted elsewhere.
ArgMining 2021 includes the following shared tasks:
For detailed information about the tasks, data, evaluation, and organisers, please see the shared tasks page.
We abide by the ACL anti-harassment policy.