DebateKG: Automatic Policy Debate Case Creation with Semantic Knowledge Graphs
Not on the map. Why?
Abstract (arXiv)
Recent work within the Argument Mining community has shown the applicability of Natural Language Processing systems for solving problems found within competitive debate. One of the most important tasks within competitive debate is for debaters to create high quality debate cases. We show that effective debate cases can be constructed using constrained shortest path traversals on Argumentative Semantic Knowledge Graphs. We study this potential in the context of a type of American Competitive Debate, called Policy Debate, which already has a large scale dataset targeting it called DebateSum. We significantly improve upon DebateSum by introducing 53180 new examples, as well as further useful metadata for every example, to the dataset. We leverage the txtai semantic search and knowledge graph toolchain to produce and contribute 9 semantic knowledge graphs built on this dataset. We create a unique method for evaluating which knowledge graphs are better in the context of producing policy debate cases. A demo which automatically generates debate cases, along with all other code and the Knowledge Graphs, are open-sourced and made available to the public here: https://huggingface.co/spaces/Hellisotherpeople/DebateKG
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 9 Jul 2023.
Builds on
5 of 16 references.
References · 5
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2016Chains of Reasoning over Entities, Relations, and Text using Recurrent Neural Networkscited by 37
- 2020DebateSum: A large-scale argument mining and summarization datasetcited by 34
- 2022Automatic Debate Evaluation with Argumentation Semantics and Natural Language Argument Graph Networkscited by 10
- 2020Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphscited by 1
Built on by
Not cited yet.