The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data

Stian Rødven Eide


Abstract
As part of a larger project on argument mining of Swedish parliamentary data, we have created a semantic graph that, together with named entity recognition and resolution (NER), should make it easier to establish connections between arguments in a given debate. The graph is essentially a semantic database that keeps track of Members of Parliament (MPs), in particular their presence in the parliament and activity in debates, but also party affiliation and participation in commissions. The hope is that the Swedish PoliGraph will enable us to perform named entity resolution on debates in the Swedish parliament with a high accuracy, with the aim of determining to whom an argument is directed.
Anthology ID:
W19-4506
Volume:
Proceedings of the 6th Workshop on Argument Mining
Month:
August
Year:
2019
Address:
Florence, Italy
Editors:
Benno Stein, Henning Wachsmuth
Venue:
ArgMining
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
52–57
Language:
URL:
https://aclanthology.org/W19-4506
DOI:
10.18653/v1/W19-4506
Bibkey:
Cite (ACL):
Stian Rødven Eide. 2019. The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data. In Proceedings of the 6th Workshop on Argument Mining, pages 52–57, Florence, Italy. Association for Computational Linguistics.
Cite (Informal):
The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data (Eide, ArgMining 2019)
Copy Citation:
PDF:
https://aclanthology.org/W19-4506.pdf