<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="bommasani-etal-2019-sparse">
    <titleInfo>
        <title>SPARSE: Structured Prediction using Argument-Relative Structured Encoding</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Rishi</namePart>
        <namePart type="family">Bommasani</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Arzoo</namePart>
        <namePart type="family">Katiyar</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Claire</namePart>
        <namePart type="family">Cardie</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-06</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Third Workshop on Structured Prediction for NLP</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Andre</namePart>
            <namePart type="family">Martins</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andreas</namePart>
            <namePart type="family">Vlachos</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Zornitsa</namePart>
            <namePart type="family">Kozareva</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Sujith</namePart>
            <namePart type="family">Ravi</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Gerasimos</namePart>
            <namePart type="family">Lampouras</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Vlad</namePart>
            <namePart type="family">Niculae</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Julia</namePart>
            <namePart type="family">Kreutzer</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Minneapolis, Minnesota</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We propose structured encoding as a novel approach to learning representations for relations and events in neural structured prediction. Our approach explicitly leverages the structure of available relation and event metadata to generate these representations, which are parameterized by both the attribute structure of the metadata as well as the learned representation of the arguments of the relations and events. We consider affine, biaffine, and recurrent operators for building hierarchical representations and modelling underlying features. We apply our approach to the second-order structured prediction task studied in the 2016/2017 Belief and Sentiment analysis evaluations (BeSt): given a document and its entities, relations, and events (including metadata and mentions), determine the sentiment of each entity towards every relation and event in the document. Without task-specific knowledge sources or domain engineering, we significantly improve over systems and baselines that neglect the available metadata or its hierarchical structure. We observe across-the-board improvements on the BeSt 2016/2017 sentiment analysis task of at least 2.3 (absolute) and 10.6% (relative) F-measure over the previous state-of-the-art.</abstract>
    <identifier type="citekey">bommasani-etal-2019-sparse</identifier>
    <identifier type="doi">10.18653/v1/W19-1503</identifier>
    <location>
        <url>https://aclanthology.org/W19-1503</url>
    </location>
    <part>
        <date>2019-06</date>
        <extent unit="page">
            <start>13</start>
            <end>17</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T SPARSE: Structured Prediction using Argument-Relative Structured Encoding
%A Bommasani, Rishi
%A Katiyar, Arzoo
%A Cardie, Claire
%Y Martins, Andre
%Y Vlachos, Andreas
%Y Kozareva, Zornitsa
%Y Ravi, Sujith
%Y Lampouras, Gerasimos
%Y Niculae, Vlad
%Y Kreutzer, Julia
%S Proceedings of the Third Workshop on Structured Prediction for NLP
%D 2019
%8 June
%I Association for Computational Linguistics
%C Minneapolis, Minnesota
%F bommasani-etal-2019-sparse
%X We propose structured encoding as a novel approach to learning representations for relations and events in neural structured prediction. Our approach explicitly leverages the structure of available relation and event metadata to generate these representations, which are parameterized by both the attribute structure of the metadata as well as the learned representation of the arguments of the relations and events. We consider affine, biaffine, and recurrent operators for building hierarchical representations and modelling underlying features. We apply our approach to the second-order structured prediction task studied in the 2016/2017 Belief and Sentiment analysis evaluations (BeSt): given a document and its entities, relations, and events (including metadata and mentions), determine the sentiment of each entity towards every relation and event in the document. Without task-specific knowledge sources or domain engineering, we significantly improve over systems and baselines that neglect the available metadata or its hierarchical structure. We observe across-the-board improvements on the BeSt 2016/2017 sentiment analysis task of at least 2.3 (absolute) and 10.6% (relative) F-measure over the previous state-of-the-art.
%R 10.18653/v1/W19-1503
%U https://aclanthology.org/W19-1503
%U https://doi.org/10.18653/v1/W19-1503
%P 13-17

Markdown (Informal)

[SPARSE: Structured Prediction using Argument-Relative Structured Encoding](https://aclanthology.org/W19-1503) (Bommasani et al., NAACL 2019)

• SPARSE: Structured Prediction using Argument-Relative Structured Encoding (Bommasani et al., NAACL 2019)

ACL

• Rishi Bommasani, Arzoo Katiyar, and Claire Cardie. 2019. SPARSE: Structured Prediction using Argument-Relative Structured Encoding. In Proceedings of the Third Workshop on Structured Prediction for NLP, pages 13–17, Minneapolis, Minnesota. Association for Computational Linguistics.