<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="bjorklund-etal-2019-bottom">
    <titleInfo>
        <title>Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Johanna</namePart>
        <namePart type="family">Björklund</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Shay</namePart>
        <namePart type="given">B</namePart>
        <namePart type="family">Cohen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Frank</namePart>
        <namePart type="family">Drewes</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Giorgio</namePart>
        <namePart type="family">Satta</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 14th International Conference on Finite-State Methods and Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Heiko</namePart>
            <namePart type="family">Vogler</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andreas</namePart>
            <namePart type="family">Maletti</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Dresden, Germany</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. These tree-to-graph transducers can serve as a formal basis of transition systems for semantic parsing which recently have been shown to perform very well, yet hitherto lack formalization. Our model features “extended” rules and an arc-factored normal form, comes with an efficient translation algorithm, and can be equipped with weights in a straightforward manner.</abstract>
    <identifier type="citekey">bjorklund-etal-2019-bottom</identifier>
    <identifier type="doi">10.18653/v1/W19-3104</identifier>
    <location>
        <url>https://aclanthology.org/W19-3104</url>
    </location>
    <part>
        <date>2019-09</date>
        <extent unit="page">
            <start>7</start>
            <end>17</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
%A Björklund, Johanna
%A Cohen, Shay B.
%A Drewes, Frank
%A Satta, Giorgio
%Y Vogler, Heiko
%Y Maletti, Andreas
%S Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
%D 2019
%8 September
%I Association for Computational Linguistics
%C Dresden, Germany
%F bjorklund-etal-2019-bottom
%X We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. These tree-to-graph transducers can serve as a formal basis of transition systems for semantic parsing which recently have been shown to perform very well, yet hitherto lack formalization. Our model features “extended” rules and an arc-factored normal form, comes with an efficient translation algorithm, and can be equipped with weights in a straightforward manner.
%R 10.18653/v1/W19-3104
%U https://aclanthology.org/W19-3104
%U https://doi.org/10.18653/v1/W19-3104
%P 7-17

Markdown (Informal)

[Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs](https://aclanthology.org/W19-3104) (Björklund et al., FSMNLP 2019)

• Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs (Björklund et al., FSMNLP 2019)

ACL

• Johanna Björklund, Shay B. Cohen, Frank Drewes, and Giorgio Satta. 2019. Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. In Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, pages 7–17, Dresden, Germany. Association for Computational Linguistics.