<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="can-etal-2019-richer">
    <titleInfo>
        <title>A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Duy-Cat</namePart>
        <namePart type="family">Can</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Hoang-Quynh</namePart>
        <namePart type="family">Le</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Quang-Thuy</namePart>
        <namePart type="family">Ha</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Nigel</namePart>
        <namePart type="family">Collier</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-jun</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Minneapolis, Minnesota</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>To extract the relationship between two entities in a sentence, two common approaches are (1) using their shortest dependency path (SDP) and (2) using an attention model to capture a context-based representation of the sentence. Each approach suffers from its own disadvantage of either missing or redundant information. In this work, we propose a novel model that combines the advantages of these two approaches. This is based on the basic information in the SDP enhanced with information selected by several attention mechanisms with kernel filters, namely RbSP (Richer-but-Smarter SDP). To exploit the representation behind the RbSP structure effectively, we develop a combined deep neural model with a LSTM network on word sequences and a CNN on RbSP. Experimental results on the SemEval-2010 dataset demonstrate improved performance over competitive baselines. The data and source code are available at https://github.com/catcd/RbSP.</abstract>
    <identifier type="citekey">can-etal-2019-richer</identifier>
    <identifier type="doi">10.18653/v1/N19-1298</identifier>
    <location>
        <url>https://aclanthology.org/N19-1298</url>
    </location>
    <part>
        <date>2019-jun</date>
        <extent unit="page">
            <start>2902</start>
            <end>2912</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction
%A Can, Duy-Cat
%A Le, Hoang-Quynh
%A Ha, Quang-Thuy
%A Collier, Nigel
%S Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)
%D 2019
%8 jun
%I Association for Computational Linguistics
%C Minneapolis, Minnesota
%F can-etal-2019-richer
%X To extract the relationship between two entities in a sentence, two common approaches are (1) using their shortest dependency path (SDP) and (2) using an attention model to capture a context-based representation of the sentence. Each approach suffers from its own disadvantage of either missing or redundant information. In this work, we propose a novel model that combines the advantages of these two approaches. This is based on the basic information in the SDP enhanced with information selected by several attention mechanisms with kernel filters, namely RbSP (Richer-but-Smarter SDP). To exploit the representation behind the RbSP structure effectively, we develop a combined deep neural model with a LSTM network on word sequences and a CNN on RbSP. Experimental results on the SemEval-2010 dataset demonstrate improved performance over competitive baselines. The data and source code are available at https://github.com/catcd/RbSP.
%R 10.18653/v1/N19-1298
%U https://aclanthology.org/N19-1298
%U https://doi.org/10.18653/v1/N19-1298
%P 2902-2912

Markdown (Informal)

[A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction](https://aclanthology.org/N19-1298) (Can et al., NAACL 2019)

• A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction (Can et al., NAACL 2019)

ACL

• Duy-Cat Can, Hoang-Quynh Le, Quang-Thuy Ha, and Nigel Collier. 2019. A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 2902–2912, Minneapolis, Minnesota. Association for Computational Linguistics.