<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="eide-2019-swedish">
    <titleInfo>
        <title>The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Stian</namePart>
        <namePart type="given">Rødven</namePart>
        <namePart type="family">Eide</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-08</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 6th Workshop on Argument Mining</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Benno</namePart>
            <namePart type="family">Stein</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Henning</namePart>
            <namePart type="family">Wachsmuth</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Florence, Italy</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">eide-2019-swedish</identifier>
    <identifier type="doi">10.18653/v1/W19-4506</identifier>
    <location>
        <url>https://aclanthology.org/W19-4506</url>
    </location>
    <part>
        <date>2019-08</date>
        <extent unit="page">
            <start>52</start>
            <end>57</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data
%A Eide, Stian Rødven
%Y Stein, Benno
%Y Wachsmuth, Henning
%S Proceedings of the 6th Workshop on Argument Mining
%D 2019
%8 August
%I Association for Computational Linguistics
%C Florence, Italy
%F eide-2019-swedish
%X 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.
%R 10.18653/v1/W19-4506
%U https://aclanthology.org/W19-4506
%U https://doi.org/10.18653/v1/W19-4506
%P 52-57

Markdown (Informal)

[The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data](https://aclanthology.org/W19-4506) (Eide, ArgMining 2019)

• The Swedish PoliGraph: A Semantic Graph for Argument Mining of Swedish Parliamentary Data (Eide, ArgMining 2019)

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.