<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="sorokin-gurevych-2018-modeling">
    <titleInfo>
        <title>Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Daniil</namePart>
        <namePart type="family">Sorokin</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Iryna</namePart>
        <namePart type="family">Gurevych</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-aug</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 27th International Conference on Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Santa Fe, New Mexico, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The most approaches to Knowledge Base Question Answering are based on semantic parsing. In this paper, we address the problem of learning vector representations for complex semantic parses that consist of multiple entities and relations. Previous work largely focused on selecting the correct semantic relations for a question and disregarded the structure of the semantic parse: the connections between entities and the directions of the relations. We propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse. We show on two data sets that the graph networks outperform all baseline models that do not explicitly model the structure. The error analysis confirms that our approach can successfully process complex semantic parses.</abstract>
    <identifier type="citekey">sorokin-gurevych-2018-modeling</identifier>
    <location>
        <url>https://aclanthology.org/C18-1280</url>
    </location>
    <part>
        <date>2018-aug</date>
        <extent unit="page">
            <start>3306</start>
            <end>3317</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering
%A Sorokin, Daniil
%A Gurevych, Iryna
%S Proceedings of the 27th International Conference on Computational Linguistics
%D 2018
%8 aug
%I Association for Computational Linguistics
%C Santa Fe, New Mexico, USA
%F sorokin-gurevych-2018-modeling
%X The most approaches to Knowledge Base Question Answering are based on semantic parsing. In this paper, we address the problem of learning vector representations for complex semantic parses that consist of multiple entities and relations. Previous work largely focused on selecting the correct semantic relations for a question and disregarded the structure of the semantic parse: the connections between entities and the directions of the relations. We propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse. We show on two data sets that the graph networks outperform all baseline models that do not explicitly model the structure. The error analysis confirms that our approach can successfully process complex semantic parses.
%U https://aclanthology.org/C18-1280
%P 3306-3317

Markdown (Informal)

[Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering](https://aclanthology.org/C18-1280) (Sorokin & Gurevych, COLING 2018)

• Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering (Sorokin & Gurevych, COLING 2018)

ACL

• Daniil Sorokin and Iryna Gurevych. 2018. Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering. In Proceedings of the 27th International Conference on Computational Linguistics, pages 3306–3317, Santa Fe, New Mexico, USA. Association for Computational Linguistics.