<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="beschke-2019-exploring">
    <titleInfo>
        <title>Exploring Graph-Algebraic CCG Combinators for Syntactic-Semantic AMR Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Sebastian</namePart>
        <namePart type="family">Beschke</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019)</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Ruslan</namePart>
            <namePart type="family">Mitkov</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Galia</namePart>
            <namePart type="family">Angelova</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>INCOMA Ltd.</publisher>
            <place>
                <placeTerm type="text">Varna, Bulgaria</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We describe a new approach to semantic parsing based on Combinatory Categorial Grammar (CCG). The grammar’s semantic construction operators are defined in terms of a graph algebra, which allows our system to induce a compact CCG lexicon. We introduce an expectation maximisation algorithm which we use to filter our lexicon down to 2500 lexical templates. Our system achieves a semantic triple (Smatch) precision that is competitive with other CCG-based AMR parsing approaches.</abstract>
    <identifier type="citekey">beschke-2019-exploring</identifier>
    <identifier type="doi">10.26615/978-954-452-056-4_014</identifier>
    <location>
        <url>https://aclanthology.org/R19-1014</url>
    </location>
    <part>
        <date>2019-09</date>
        <extent unit="page">
            <start>112</start>
            <end>121</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Exploring Graph-Algebraic CCG Combinators for Syntactic-Semantic AMR Parsing
%A Beschke, Sebastian
%Y Mitkov, Ruslan
%Y Angelova, Galia
%S Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019)
%D 2019
%8 September
%I INCOMA Ltd.
%C Varna, Bulgaria
%F beschke-2019-exploring
%X We describe a new approach to semantic parsing based on Combinatory Categorial Grammar (CCG). The grammar’s semantic construction operators are defined in terms of a graph algebra, which allows our system to induce a compact CCG lexicon. We introduce an expectation maximisation algorithm which we use to filter our lexicon down to 2500 lexical templates. Our system achieves a semantic triple (Smatch) precision that is competitive with other CCG-based AMR parsing approaches.
%R 10.26615/978-954-452-056-4_014
%U https://aclanthology.org/R19-1014
%U https://doi.org/10.26615/978-954-452-056-4_014
%P 112-121

Markdown (Informal)

[Exploring Graph-Algebraic CCG Combinators for Syntactic-Semantic AMR Parsing](https://aclanthology.org/R19-1014) (Beschke, RANLP 2019)

• Exploring Graph-Algebraic CCG Combinators for Syntactic-Semantic AMR Parsing (Beschke, RANLP 2019)

ACL

• Sebastian Beschke. 2019. Exploring Graph-Algebraic CCG Combinators for Syntactic-Semantic AMR Parsing. In Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019), pages 112–121, Varna, Bulgaria. INCOMA Ltd..