<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="reddy-etal-2014-large">
    <titleInfo>
        <title>Large-scale Semantic Parsing without Question-Answer Pairs</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Siva</namePart>
        <namePart type="family">Reddy</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Mirella</namePart>
        <namePart type="family">Lapata</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Mark</namePart>
        <namePart type="family">Steedman</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2014</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre>journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre>academic journal</genre>
    </relatedItem>
    <abstract>In this paper we introduce a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. Our key insight is to represent natural language via semantic graphs whose topology shares many commonalities with Freebase. Given this representation, we conceptualize semantic parsing as a graph matching problem. Our model converts sentences to semantic graphs using CCG and subsequently grounds them to Freebase guided by denotations as a form of weak supervision. Evaluation experiments on a subset of the Free917 and WebQuestions benchmark datasets show our semantic parser improves over the state of the art.</abstract>
    <identifier type="citekey">reddy-etal-2014-large</identifier>
    <identifier type="doi">10.1162/tacl_a_00190</identifier>
    <location>
        <url>https://aclanthology.org/Q14-1030</url>
    </location>
    <part>
        <date>2014</date>
        <detail type="volume"><number>2</number></detail>
        <extent unit="page">
            <start>377</start>
            <end>392</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Large-scale Semantic Parsing without Question-Answer Pairs
%A Reddy, Siva
%A Lapata, Mirella
%A Steedman, Mark
%J Transactions of the Association for Computational Linguistics
%D 2014
%V 2
%I MIT Press
%C Cambridge, MA
%F reddy-etal-2014-large
%X In this paper we introduce a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. Our key insight is to represent natural language via semantic graphs whose topology shares many commonalities with Freebase. Given this representation, we conceptualize semantic parsing as a graph matching problem. Our model converts sentences to semantic graphs using CCG and subsequently grounds them to Freebase guided by denotations as a form of weak supervision. Evaluation experiments on a subset of the Free917 and WebQuestions benchmark datasets show our semantic parser improves over the state of the art.
%9 journal article
%R 10.1162/tacl_a_00190
%U https://aclanthology.org/Q14-1030
%U https://doi.org/10.1162/tacl_a_00190
%P 377-392

Markdown (Informal)

[Large-scale Semantic Parsing without Question-Answer Pairs](https://aclanthology.org/Q14-1030) (Reddy et al., TACL 2014)

• Large-scale Semantic Parsing without Question-Answer Pairs (Reddy et al., TACL 2014)

ACL

• Siva Reddy, Mirella Lapata, and Mark Steedman. 2014. Large-scale Semantic Parsing without Question-Answer Pairs. Transactions of the Association for Computational Linguistics, 2:377–392.