<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="poelman-etal-2022-transparent">
    <titleInfo>
        <title>Transparent Semantic Parsing with Universal Dependencies Using Graph Transformations</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Wessel</namePart>
        <namePart type="family">Poelman</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Rik</namePart>
        <namePart type="family">van Noord</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Johan</namePart>
        <namePart type="family">Bos</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2022-10</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 29th International Conference on Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <publisher>International Committee on Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Gyeongju, Republic of Korea</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Even though many recent semantic parsers are based on deep learning methods, we should not forget that rule-based alternatives might offer advantages over neural approaches with respect to transparency, portability, and explainability. Taking advantage of existing off-the-shelf Universal Dependency parsers, we present a method that maps a syntactic dependency tree to a formal meaning representation based on Discourse Representation Theory. Rather than using lambda calculus to manage variable bindings, our approach is novel in that it consists of using a series of graph transformations. The resulting UD semantic parser shows good performance for English, German, Italian and Dutch, with F-scores over 75%, outperforming a neural semantic parser for the lower-resourced languages. Unlike neural semantic parsers, our UD semantic parser does not hallucinate output, is relatively easy to port to other languages, and is completely transparent.</abstract>
    <identifier type="citekey">poelman-etal-2022-transparent</identifier>
    <location>
        <url>https://aclanthology.org/2022.coling-1.367</url>
    </location>
    <part>
        <date>2022-10</date>
        <extent unit="page">
            <start>4186</start>
            <end>4192</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Transparent Semantic Parsing with Universal Dependencies Using Graph Transformations
%A Poelman, Wessel
%A van Noord, Rik
%A Bos, Johan
%S Proceedings of the 29th International Conference on Computational Linguistics
%D 2022
%8 October
%I International Committee on Computational Linguistics
%C Gyeongju, Republic of Korea
%F poelman-etal-2022-transparent
%X Even though many recent semantic parsers are based on deep learning methods, we should not forget that rule-based alternatives might offer advantages over neural approaches with respect to transparency, portability, and explainability. Taking advantage of existing off-the-shelf Universal Dependency parsers, we present a method that maps a syntactic dependency tree to a formal meaning representation based on Discourse Representation Theory. Rather than using lambda calculus to manage variable bindings, our approach is novel in that it consists of using a series of graph transformations. The resulting UD semantic parser shows good performance for English, German, Italian and Dutch, with F-scores over 75%, outperforming a neural semantic parser for the lower-resourced languages. Unlike neural semantic parsers, our UD semantic parser does not hallucinate output, is relatively easy to port to other languages, and is completely transparent.
%U https://aclanthology.org/2022.coling-1.367
%P 4186-4192

Markdown (Informal)

[Transparent Semantic Parsing with Universal Dependencies Using Graph Transformations](https://aclanthology.org/2022.coling-1.367) (Poelman et al., COLING 2022)

• Transparent Semantic Parsing with Universal Dependencies Using Graph Transformations (Poelman et al., COLING 2022)

ACL

• Wessel Poelman, Rik van Noord, and Johan Bos. 2022. Transparent Semantic Parsing with Universal Dependencies Using Graph Transformations. In Proceedings of the 29th International Conference on Computational Linguistics, pages 4186–4192, Gyeongju, Republic of Korea. International Committee on Computational Linguistics.