To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

The Swedish PoliGraph… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

The Swedish PoliGraph

Conference paper
Authors Stian Rødven Eide
Published in Proceedings of the 6th Workshop on Argument Mining, August 1, 2019 Florence, Italy / Benno Stein, Henning Wachsmuth (Editors)
ISBN 978-1-950737-33-8
Publisher Association for Computational Linguistics
Place of publication Stroudsburg, PA
Publication year 2019
Published at Department of Swedish
Language en
Keywords computational linguistics, language technology, graph, semantic web, prolog, politics, swedish politics, parliamentary data, riksdagen, web service
Subject categories Language Technology (Computational Linguistics), Computational linguistics, Public Administration Studies


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.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?