<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="schwenger-etal-2016-openccg">
    <titleInfo>
        <title>From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Maximilian</namePart>
        <namePart type="family">Schwenger</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Álvaro</namePart>
        <namePart type="family">Torralba</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Joerg</namePart>
        <namePart type="family">Hoffmann</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">David</namePart>
        <namePart type="given">M</namePart>
        <namePart type="family">Howcroft</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Vera</namePart>
        <namePart type="family">Demberg</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2016-12</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Yuji</namePart>
            <namePart type="family">Matsumoto</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Rashmi</namePart>
            <namePart type="family">Prasad</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>The COLING 2016 Organizing Committee</publisher>
            <place>
                <placeTerm type="text">Osaka, Japan</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The search space in grammar-based natural language generation tasks can get very large, which is particularly problematic when generating long utterances or paragraphs. Using surface realization with OpenCCG as an example, we show that we can effectively detect partial solutions (edges) which cannot ultimately be part of a complete sentence because of their syntactic category. Formulating the completion of an edge into a sentence as finding a solution path in a large state-transition system, we demonstrate a connection to AI Planning which is concerned with this kind of problem. We design a compilation from OpenCCG into AI Planning allowing the detection of infeasible edges via AI Planning dead-end detection methods (proving the absence of a solution to the compilation). Our experiments show that this can filter out large fractions of infeasible edges in, and thus benefit the performance of, complex realization processes.</abstract>
    <identifier type="citekey">schwenger-etal-2016-openccg</identifier>
    <location>
        <url>https://aclanthology.org/C16-1144</url>
    </location>
    <part>
        <date>2016-12</date>
        <extent unit="page">
            <start>1524</start>
            <end>1534</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation
%A Schwenger, Maximilian
%A Torralba, Álvaro
%A Hoffmann, Joerg
%A Howcroft, David M.
%A Demberg, Vera
%Y Matsumoto, Yuji
%Y Prasad, Rashmi
%S Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers
%D 2016
%8 December
%I The COLING 2016 Organizing Committee
%C Osaka, Japan
%F schwenger-etal-2016-openccg
%X The search space in grammar-based natural language generation tasks can get very large, which is particularly problematic when generating long utterances or paragraphs. Using surface realization with OpenCCG as an example, we show that we can effectively detect partial solutions (edges) which cannot ultimately be part of a complete sentence because of their syntactic category. Formulating the completion of an edge into a sentence as finding a solution path in a large state-transition system, we demonstrate a connection to AI Planning which is concerned with this kind of problem. We design a compilation from OpenCCG into AI Planning allowing the detection of infeasible edges via AI Planning dead-end detection methods (proving the absence of a solution to the compilation). Our experiments show that this can filter out large fractions of infeasible edges in, and thus benefit the performance of, complex realization processes.
%U https://aclanthology.org/C16-1144
%P 1524-1534

Markdown (Informal)

[From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation](https://aclanthology.org/C16-1144) (Schwenger et al., COLING 2016)

• From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation (Schwenger et al., COLING 2016)

ACL

• Maximilian Schwenger, Álvaro Torralba, Joerg Hoffmann, David M. Howcroft, and Vera Demberg. 2016. From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 1524–1534, Osaka, Japan. The COLING 2016 Organizing Committee.