Base_JSON/prefixD/json/D17/D17-1009.json

{
    "paper_id": "D17-1009",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T16:15:38.279379Z"
    },
    "title": "Universal Semantic Parsing",
    "authors": [
        {
            "first": "Siva",
            "middle": [],
            "last": "Reddy",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Stanford University \u2021 Google Inc. \u2020 \u2020 University of Edinburgh",
                "location": {}
            },
            "email": "sivar@stanford.edu"
        },
        {
            "first": "Oscar",
            "middle": [],
            "last": "T\u00e4ckstr\u00f6m",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Stanford University \u2021 Google Inc. \u2020 \u2020 University of Edinburgh",
                "location": {}
            },
            "email": "oscart@google.com"
        },
        {
            "first": "Slav",
            "middle": [],
            "last": "Petrov",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Stanford University \u2021 Google Inc. \u2020 \u2020 University of Edinburgh",
                "location": {}
            },
            "email": ""
        },
        {
            "first": "Mark",
            "middle": [],
            "last": "Steedman",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Stanford University \u2021 Google Inc. \u2020 \u2020 University of Edinburgh",
                "location": {}
            },
            "email": "steedman@inf.ed.ac.uk"
        },
        {
            "first": "Mirella",
            "middle": [],
            "last": "Lapata",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Stanford University \u2021 Google Inc. \u2020 \u2020 University of Edinburgh",
                "location": {}
            },
            "email": ""
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "Universal Dependencies (UD) offer a uniform cross-lingual syntactic representation, with the aim of advancing multilingual applications. Recent work shows that semantic parsing can be accomplished by transforming syntactic dependencies to logical forms. However, this work is limited to English, and cannot process dependency graphs, which allow handling complex phenomena such as control. In this work, we introduce UDEPLAMBDA, a semantic interface for UD, which maps natural language to logical forms in an almost language-independent fashion and can process dependency graphs. We perform experiments on question answering against Freebase and provide German and Spanish translations of the WebQuestions and GraphQuestions datasets to facilitate multilingual evaluation. Results show that UDEPLAMBDA outperforms strong baselines across languages and datasets. For English, it achieves a 4.9 F 1 point improvement over the state-of-the-art on Graph-Questions.",
    "pdf_parse": {
        "paper_id": "D17-1009",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "Universal Dependencies (UD) offer a uniform cross-lingual syntactic representation, with the aim of advancing multilingual applications. Recent work shows that semantic parsing can be accomplished by transforming syntactic dependencies to logical forms. However, this work is limited to English, and cannot process dependency graphs, which allow handling complex phenomena such as control. In this work, we introduce UDEPLAMBDA, a semantic interface for UD, which maps natural language to logical forms in an almost language-independent fashion and can process dependency graphs. We perform experiments on question answering against Freebase and provide German and Spanish translations of the WebQuestions and GraphQuestions datasets to facilitate multilingual evaluation. Results show that UDEPLAMBDA outperforms strong baselines across languages and datasets. For English, it achieves a 4.9 F 1 point improvement over the state-of-the-art on Graph-Questions.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "The Universal Dependencies (UD) initiative seeks to develop cross-linguistically consistent annotation guidelines as well as a large number of uniformly annotated treebanks for many languages . Such resources could advance multilingual applications of parsing, improve comparability of evaluation results, enable cross-lingual learning, and more generally support natural language understanding. * Work done at the University of Edinburgh Seeking to exploit the benefits of UD for natural language understanding, we introduce UDEP-LAMBDA, a semantic interface for UD that maps natural language to logical forms, representing underlying predicate-argument structures, in an almost language-independent manner. Our framework is based on DEPLAMBDA a recently developed method that converts English Stanford Dependencies (SD) to logical forms. The conversion process is illustrated in Figure 1 and discussed in more detail in Section 2. Whereas DEPLAMBDA works only for English, U-DEPLAMBDA applies to any language for which UD annotations are available. 1 Moreover, DEP-LAMBDA can only process tree-structured inputs whereas UDEPLAMBDA can also process dependency graphs, which allow to handle complex constructions such as control. The different treatments of various linguistic constructions in UD compared to SD also require different handling in UDEP-LAMBDA (Section 3.3).",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 881,
                        "end": 889,
                        "text": "Figure 1",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Our experiments focus on Freebase semantic parsing as a testbed for evaluating the framework's multilingual appeal. We convert natural language to logical forms which in turn are converted to machine interpretable formal meaning representations for retrieving answers to questions from Freebase. To facilitate multilingual evaluation, we provide translations of the English WebQuestions (Berant et al., 2013) and GraphQuestions datasets to German and Spanish. We demonstrate that UDEPLAMBDA can be used to derive logical forms for these languages using a minimal amount of language-specific knowledge. Aside from developing the first multilingual semantic parsing tool for Freebase, we also experimentally show that U-DEPLAMBDA outperforms strong baselines across languages and datasets. For English, it achieves the strongest result to date on GraphQuestions, with competitive results on WebQuestions. Our implementation and translated datasets are publicly available at https://github.com/sivareddyg/udeplambda.",
                "cite_spans": [
                    {
                        "start": 387,
                        "end": 408,
                        "text": "(Berant et al., 2013)",
                        "ref_id": "BIBREF12"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Before describing UDEPLAMBDA, we provide an overview of DEPLAMBDA on which our approach is based. DEPLAMBDA converts a dependency tree to its logical form in three steps: binarization, substitution, and composition, each of which is briefly outlined below. Algorithm 1 describes the steps of DEPLAMBDA in lines 4-6, whereas lines 2 and 3 are specific to UDEPLAMBDA.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "Binarization A dependency tree is first mapped to a Lisp-style s-expression indicating the order of semantic composition. Figure 1(b) shows the s-expression for the sentence Disney won an Oscar for the movie Frozen, derived from the dependency tree in Figure 1(a) . Here, the sub-expression (dobj won (det Oscar an)) indicates that the logical form of the phrase won an Oscar is derived by composing the logical form of the label dobj with the logical form of the word won and the logical form of the phrase an Oscar, derived analogously. The s-expression can also be interpreted as a binarized tree with the dependency label as the root node, and the left and right expressions as subtrees.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 122,
                        "end": 133,
                        "text": "Figure 1(b)",
                        "ref_id": "FIGREF1"
                    },
                    {
                        "start": 252,
                        "end": 263,
                        "text": "Figure 1(a)",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "A composition hierarchy is employed to impose a strict traversal ordering on the modifiers to each head in the dependency tree. As an example, won has three modifiers in Figure 1 (a), which according to the composition hierarchy are composed in the order dobj > nmod > nsubj. In constructions like coordination, this ordering is crucial to arrive at the correct semantics. Lines 7-17 in Algorithm 1 describe the binarization step.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 170,
                        "end": 178,
                        "text": "Figure 1",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "Substitution Each symbol in the s-expressions is substituted for a lambda expression encoding its semantics. Words and dependency labels are assigned different types of expressions. In general, words have expressions of the following kind: ENTITY \u21d2 \u03bbx. word(x a ); e.g. Oscar \u21d2 \u03bbx. Oscar(x a ) EVENT \u21d2 \u03bbx. word(x e ); e.g. won \u21d2 \u03bbx. won(x e ) FUNCTIONAL \u21d2 \u03bbx. TRUE; e.g. an \u21d2 \u03bbx. TRUE Here, the subscripts \u2022 a and \u2022 e denote the types of individuals (Ind) and events (Event), respectively, whereas x denotes a paired variable (x a , x e ) Disney won an Oscar for the movie Frozen propn verb det propn adp det noun propn (nsubj (nmod (dobj won (det Oscar an)) (case (det (comp. Frozen movie) the) for)) Disney) (b) The binarized s-expression for the dependency tree.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "\u03bbx. \u2203yzw. won(x e ) \u2227 Disney(y a ) \u2227 Oscar(z a ) \u2227 Frozen(w a ) \u2227 movie(w a ) \u2227 arg 1 (x e , y a ) \u2227 arg 2 (x e , z a ) \u2227 nmod.for(x e , w a ) (c) The composed lambda-calculus expression. of type Ind \u00d7 Event. Roughly speaking, proper nouns and adjectives invoke ENTITY expressions, verbs and adverbs invoke EVENT expressions, and common nouns invoke both ENTITY and EVENT expressions (see Section 3.3), while remaining words invoke FUNCTIONAL expressions. DEPLAMBDA enforces the constraint that every s-expression is of the type \u03b7 = Ind \u00d7 Event \u2192 Bool, which simplifies the type system considerably. Expressions for dependency labels glue the semantics of heads and modifiers to articulate predicate-argument structure. These expressions in general take one of the following forms:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "COPY \u21d2 \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 rel(x, y) e.g. nsubj, dobj, nmod, advmod INVERT \u21d2 \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 rel i (y, x) e.g. amod, acl MERGE \u21d2 \u03bb f gx. f (x) \u2227 g(x) e.g. compound, appos, amod, acl HEAD \u21d2 \u03bb f gx. f (x) e.g. case, punct, aux, mark .",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "As an example of COPY, consider the lambda expression for dobj in (dobj won (det Oscar an)): \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 arg 2 (x e , y a ). This expression takes two functions f and g as input, where f represents the logical form of won and g represents the logical form of an Oscar. The predicateargument structure arg 2 (x e , y a ) indicates that the arg 2 of the event x e , i.e. won, is the individual y a , i.e. the entity Oscar. Since arg 2 (x e , y a ) mimics the dependency structure dobj(won, Oscar), we refer to the expression kind evoked by dobj as COPY.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "Expressions that invert the dependency direction are referred to as INVERT (e.g. amod in running horse); expressions that merge two subexpressions without introducing any relation predicates are referred to as MERGE (e.g. compound in movie Frozen); and expressions that simply return the parent expression semantics are referred to as HEAD (e.g. case in for Frozen). While this generalization applies to most dependency labels, several labels take a different logical form not listed here, some of which are discussed in Section 3.3. Sometimes the mapping of dependency label to lambda expression may depend on surrounding part-of-speech tags or dependency labels. For example, amod acts as INVERT when the modifier is a verb (e.g. in running horse), and as MERGE when the modifier is an adjective (e.g. in beautiful horse). 2 Lines 26-32 in Algorithm 1 describe the substitution procedure.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "Composition The final logical form is computed by beta-reduction, treating expressions of the form (f x y) as the function f applied to the arguments x and y. For example, (dobj won (det Oscar an)) results in \u03bbx. \u2203z. won(x e ) \u2227 Oscar(z a ) \u2227 arg 2 (x e , z a ) when the expression for dobj is applied to those for won and (det Oscar an). Figure 1 (c) shows the logical form for the s-expression in Figure 1(b) . The binarized s-expression is recursively converted to a logical form as described in lines 18-25 in Algorithm 1.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 339,
                        "end": 347,
                        "text": "Figure 1",
                        "ref_id": "FIGREF1"
                    },
                    {
                        "start": 399,
                        "end": 410,
                        "text": "Figure 1(b)",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "DEPLAMBDA",
                "sec_num": "2"
            },
            {
                "text": "We now introduce UDEPLAMBDA, a semantic interface for Universal Dependencies. 3 Whereas DEPLAMBDA only applies to English Stanford Dependencies, UDEPLAMBDA takes advantage of the cross-lingual nature of UD to facilitate an (almost) language independent semantic interface. This is accomplished by restricting the binarization, substitution, and composition steps described above to rely solely on information encoded in the UD representation. As shown in Algorithm 1, lines 4-6 are common to both DEPLAMBDA and UDEP-LAMBDA, whereas lines 2 and 3 applies only to UDEPLAMBDA. Importantly, UDEPLAMBDA is designed to not rely on lexical forms in a language 2 We use Tregex (Levy and Andrew, 2006) for substitution mappings and Cornell SPF (Artzi, 2013) as the lambdacalculus implementation. For example, in running horse, the tregex /label:amod/=target < /postag:verb/ matches amod to",
                "cite_spans": [
                    {
                        "start": 653,
                        "end": 654,
                        "text": "2",
                        "ref_id": null
                    },
                    {
                        "start": 669,
                        "end": 692,
                        "text": "(Levy and Andrew, 2006)",
                        "ref_id": "BIBREF43"
                    },
                    {
                        "start": 735,
                        "end": 748,
                        "text": "(Artzi, 2013)",
                        "ref_id": "BIBREF4"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "UDEPLAMBDA",
                "sec_num": "3"
            },
            {
                "text": "its INVERT expression \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 amod i (y e , x a ).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "UDEPLAMBDA",
                "sec_num": "3"
            },
            {
                "text": "3 In what follows, all references to UD are to UD v1.3. to assign lambda expressions, but only on information contained in dependency labels and postags. However, some linguistic phenomena are language specific (e.g. pronoun-dropping) or lexicalized (e.g. every and the in English have different semantics, despite being both determiners) and are not encoded in the UD schema. Furthermore, some cross-linguistic phenomena, such as long-distance dependencies, are not part of the core UD representation. To circumvent this limitation, a simple enhancement step enriches the original UD representation before binarization takes place (Section 3.1). This step adds to the dependency tree missing syntactic information and long-distance dependencies, thereby creating a graph. Whereas DEPLAMBDA is not able to handle graph-structured input, UDEP-LAMBDA is designed to work with dependency graphs as well (Section 3.2). Finally, several constructions differ in structure between UD and SD, which requires different handling in the semantic interface (Section 3.3).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "UDEPLAMBDA",
                "sec_num": "3"
            },
            {
                "text": "Both Schuster and Manning (2016) and note the necessity of an enhanced UD representation to enable semantic applications. However, such enhancements are currently only available for a subset of languages in UD. Instead, we rely on a small number of enhancements for our main application-semantic parsing for questionanswering-with the hope that this step can be replaced by an enhanced UD representation in the future. Specifically, we define three kinds of enhancements: (1) long-distance dependencies; (2) types of coordination; and (3) refined question word tags. These correspond to line 2 in Algorithm 1.",
                "cite_spans": [
                    {
                        "start": 5,
                        "end": 32,
                        "text": "Schuster and Manning (2016)",
                        "ref_id": "BIBREF59"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Enhancement",
                "sec_num": "3.1"
            },
            {
                "text": "First, we identify long-distance dependencies in relative clauses and control constructions. We follow Schuster and Manning (2016) and find these using the labels acl (relative) and xcomp (control). Figure 2 (a) shows the long-distance dependency in the sentence Anna wants to marry Kristoff. Here, marry is provided with its missing nsubj (dashed arc). Second, UD conflates all coordinating constructions to a single dependency label, conj. To obtain the correct coordination scope, we refine conj to conj:verb, conj:vp, conj:sentence, conj:np, and conj:adj, similar to . Finally, unlike the PTB tags (Marcus et al., 1993) used by SD, the UD part-of-speech tags do not distinguish question words. Since these are crucial to question-answering, we use a small lexicon to refine the tags for determiners (DET), adverbs (ADV) and pronouns (PRON) to DET:WH, ADV:WH and PRON:WH, respectively. Specifically, we use a list of 12 (English), 14 (Spanish) and 35 (German) words, respectively. This is the only part of UDEPLAMBDA that relies on language-specific information. We hope that, as the coverage of morphological features in UD improves, this refinement can be replaced by relying on morphological features, such as the interrogative feature (INT).",
                "cite_spans": [
                    {
                        "start": 103,
                        "end": 130,
                        "text": "Schuster and Manning (2016)",
                        "ref_id": "BIBREF59"
                    },
                    {
                        "start": 602,
                        "end": 623,
                        "text": "(Marcus et al., 1993)",
                        "ref_id": "BIBREF45"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 199,
                        "end": 207,
                        "text": "Figure 2",
                        "ref_id": "FIGREF4"
                    }
                ],
                "eq_spans": [],
                "section": "Enhancement",
                "sec_num": "3.1"
            },
            {
                "text": "To handle graph structures that may result from the enhancement step, such as those in Figure 2 from that of DEPLAMBDA. This is indicated in line 3 of Algorithm 1. First, each long-distance dependency is split into independent arcs as shown in Figure 2 (b). Here, \u2126 is a placeholder for the subject of marry, which in turn corresponds to Anna as indicated by the binding of \u2126 via the pseudo-label BIND. We treat BIND like an ordinary dependency label with semantics MERGE and process the resulting tree as usual, via the s-expression:",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 87,
                        "end": 95,
                        "text": "Figure 2",
                        "ref_id": "FIGREF4"
                    },
                    {
                        "start": 244,
                        "end": 252,
                        "text": "Figure 2",
                        "ref_id": "FIGREF4"
                    }
                ],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "(nsubj (xcomp wants (nsubj (mark (dobj marry Kristoff) to) \u2126) (BIND Anna \u2126)) ,",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "with the lambda-expression substitutions:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "wants, marry \u2208 EVENT; to \u2208 FUNCTIONAL; Anna, Kristoff \u2208 ENTITY; mark \u2208 HEAD; BIND \u2208 MERGE;",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "xcomp = \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 xcomp(x e , y e ) .",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "These substitutions are based solely on unlexicalized context. For example, the part-of-speech tag PROPN of Anna invokes an ENTITY expression.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "The placeholder \u2126 has semantics \u03bbx.EQ(x, \u03c9), where EQ(u, \u03c9) is true iff u and \u03c9 are equal (have the same denotation), which unifies the subject variable of wants with the subject variable of marry.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "After substitution and composition, we get:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "\u03bbz. \u2203xywv. wants(z e ) \u2227 Anna(x a ) \u2227 arg 1 (z e , x a ) \u2227 EQ(x, \u03c9) \u2227 marry(y e ) \u2227 xcomp(z e , y e ) \u2227 arg 1 (y e , v a ) \u2227 EQ(v, \u03c9) \u2227 Kristoff(w a ) \u2227 arg 2 (y e , w a ) ,",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "This expression may be simplified further by replacing all occurrences of v with x and removing the unification predicates EQ, which results in:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "\u03bbz. \u2203xyw. wants(z e ) \u2227 Anna(x a ) \u2227 arg 1 (z e , x a )",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "\u2227 marry(y e ) \u2227 xcomp(z e , y e ) \u2227 arg 1 (y e , x a ) \u2227 Kristoff(w a ) \u2227 arg 2 (y e , w a ) .",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "This expression encodes the fact that Anna is the arg 1 of the marry event, as desired. DEPLAMBDA, in contrast, cannot handle graph-structured input, since it lacks a principled way of generating sexpressions from graphs. Even given the above s-expression, BIND in DEPLAMBDA is defined in a way such that the composition fails to unify v and x, which is crucial for the correct semantics. Moreover, the definition of BIND in DEPLAMBDA does not have a formal interpretation within the lambda calculus, unlike ours.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Graph Structures and BIND",
                "sec_num": "3.2"
            },
            {
                "text": "Below, we highlight the most pertinent differences between UDEPLAMBDA and DEPLAMBDA, stemming from the different treatment of various linguistic constructions in UD versus SD.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "Prepositional Phrases UD uses a content-head analysis, in contrast to SD, which treats function words as heads of prepositional phrases, Accordingly, the s-expression for the phrase president in 2009 is (nmod president (case 2009 in)) in U-DEPLAMBDA and (prep president (pobj in 2009)) in DEPLAMBDA. To achieve the desired semantics,",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "\u03bbx. \u2203y. president(x a ) \u2227 president event(x e ) \u2227 arg 1 (x e , x a ) \u2227 2009(y a ) \u2227 prep.in(x e , y a ) ,",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "DEPLAMBDA relies on an intermediate logical form that requires some post-processing, whereas UDEPLAMBDA obtains the desired logical form directly through the following entries:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "in \u2208 FUNCTIONAL; 2009 \u2208 ENTITY; case \u2208 HEAD; president = \u03bbx. president(x a ) \u2227 president event(x e ) \u2227 arg 1 (x e , x a ) ; nmod = \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 nmod.in(x e , y a ) .",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "Other nmod constructions, such as possessives (nmod:poss), temporal modifiers (nmod:tmod) and adverbial modifiers (nmod:npmod), are handled similarly. Note how the common noun president, evokes both entity and event predicates above.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "Passives DEPLAMBDA gives special treatment to passive verbs, identified by the fine-grained partof-speech tags in the PTB tag together with dependency context. For example, An Oscar was won is analyzed as \u03bbx. won.pass(x e ) \u2227 Oscar(y a ) \u2227 arg 1 (x e , y a ), where won.pass represents a passive event. However, UD does not distinguish between active and passive forms. 4 While the labels nsubjpass or auxpass indicate passive constructions, such clues are sometimes missing, such as in reduced relatives. We therefore opt to not have separate entries for passives, but aim to produce identical logical forms for active and passive forms when possible (for example, by treating nsubjpass as direct object). With the following entries, won \u2208 EVENT; an, was \u2208 FUNCTIONAL; auxpass \u2208 HEAD; nsubjpass = \u03bb f gx. \u2203y. f (x) \u2227 g(y) \u2227 arg 2 (x e , y a ) , the lambda expression for An Oscar was won becomes \u03bbx. won(x e ) \u2227 Oscar(y a ) \u2227 arg 2 (x e , y a ), identical to that of its active form. However, not having a special entry for passive verbs may have undesirable side-effects. For example, in the reducedrelative construction Pixar claimed the Oscar won for Frozen, the phrase the Oscar won ... will receive the semantics \u03bbx. Oscar(y a ) \u2227 won(x e ) \u2227 arg 1 (x e , y a ), which differs from that of an Oscar was won. We leave it to the target application to disambiguate the interpretation in such cases.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "Long-Distance Dependencies As discussed in Section 3.2, we handle long-distance dependencies evoked by clausal modifiers (acl) and control verbs (xcomp) with the BIND mechanism, whereas DEPLAMBDA cannot handle control constructions. For xcomp, as seen earlier, we use the mapping \u03bb f gx. \u2203y. f (x)\u2227g(y)\u2227xcomp(x e , y e ). For acl we use \u03bb f gx. \u2203y. f (x) \u2227 g(y), to conjoin the main clause and the modifier clause. However, not all acl clauses evoke long-distance dependencies, e.g. in the news that Disney won an Oscar, the clause that Disney won an Oscar is a subordinating conjunction of news. In such cases, we instead assign acl the INVERT semantics.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "Questions Question words are marked with the enhanced part-of-speech tags DET:WH, ADV:WH and PRON:WH, which are all assigned the semantics \u03bbx. ${word}(x a ) \u2227 TARGET(x a ). The predicate TARGET indicates that x a represents the variable of interest, that is the answer to the question.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Linguistic Constructions",
                "sec_num": "3.3"
            },
            {
                "text": "In order to achieve language independence, UDEP-LAMBDA has to sacrifice semantic specificity, since in many cases the semantics is carried by lexical information. Consider the sentences John broke the window and The window broke. Although it is the window that broke in both cases, our inferred logical forms do not canonicalize the relation between broke and window. To achieve this, we Figure 3 : The ungrounded graphs for What language do the people in Ghana speak?, Welche Sprache wird in Ghana gesprochen? and Cu\u00e1l es la lengua de Ghana?, and the corresponding grounded graph.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 388,
                        "end": 396,
                        "text": "Figure 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Limitations",
                "sec_num": "3.4"
            },
            {
                "text": "would have to make the substitution of nsubj depend on lexical context, such that when window occurs as nsubj with broke, the predicate arg 2 is invoked rather than arg 1 . UDEPLAMBDA does not address this problem, and leave it to the target application to infer context-sensitive semantics of arg 1 and arg 2 . To measure the impact of this limitation, we present UDEPLAMBDASRL in Section 4.4 which addresses this problem by relying on semantic roles from semantic role labeling (Palmer et al., 2010) .",
                "cite_spans": [
                    {
                        "start": 480,
                        "end": 501,
                        "text": "(Palmer et al., 2010)",
                        "ref_id": "BIBREF51"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Limitations",
                "sec_num": "3.4"
            },
            {
                "text": "Other constructions that require lexical information are quantifiers like every, some and most, negation markers like no and not, and intentional verbs like believe and said. UD does not have special labels to indicate these. We discuss how to handle quantifiers in this framework in the supplementary material.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Limitations",
                "sec_num": "3.4"
            },
            {
                "text": "Although in the current setup UDEPLAMBDA rules are hand-coded, the number of rules are only proportional to the number of UD labels, making rule-writing manageable. 5 Moreover, we view UDEPLAMBDA as a first step towards learning rules for converting UD to richer semantic representations such as PropBank, AMR, or the Parallel Meaning Bank (Palmer et al., 2005; Banarescu et al., 2013; Abzianidze et al., 2017) ..",
                "cite_spans": [
                    {
                        "start": 340,
                        "end": 361,
                        "text": "(Palmer et al., 2005;",
                        "ref_id": "BIBREF50"
                    },
                    {
                        "start": 362,
                        "end": 385,
                        "text": "Banarescu et al., 2013;",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 386,
                        "end": 410,
                        "text": "Abzianidze et al., 2017)",
                        "ref_id": "BIBREF0"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Limitations",
                "sec_num": "3.4"
            },
            {
                "text": "To study the multilingual nature of UDEPLAMBDA, we conduct an empirical evaluation on question answering against Freebase in three different languages: English, Spanish, and German. Before discussing the details of this experiment, we briefly outline the semantic parsing framework employed.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Cross-lingual Semantic Parsing",
                "sec_num": "4"
            },
            {
                "text": "UDEPLAMBDA generates ungrounded logical forms that are independent of any knowledge base, such as Freebase. We use GRAPHPARSER to map these logical forms to their grounded Freebase graphs, via corresponding ungrounded graphs. Figures 3(a) to 3(c) show the ungrounded graphs corresponding to logical forms from UDEPLAMBDA, each grounded to the same Freebase graph in Figure 3(d) . Here, rectangles denote entities, circles denote events, rounded rectangles denote entity types, and edges between events and entities denote predicates or Freebase relations. Finally, the TARGET node represents the set of values of x that are consistent with the Freebase graph, that is the answer to the question.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 226,
                        "end": 238,
                        "text": "Figures 3(a)",
                        "ref_id": null
                    },
                    {
                        "start": 366,
                        "end": 377,
                        "text": "Figure 3(d)",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Semantic Parsing as Graph Matching",
                "sec_num": "4.1"
            },
            {
                "text": "GRAPHPARSER treats semantic parsing as a graph-matching problem with the goal of finding the Freebase graphs that are structurally isomorphic to an ungrounded graph and rank them according to a model. To account for structural mismatches, GRAPHPARSER uses two graph transformations: CONTRACT and EXPAND. In Figure 3 (a) there are two edges between x and Ghana. CONTRACT collapses one of these edges to create a graph isomorphic to Freebase. EXPAND, in contrast, adds edges to connect the graph in the case of disconnected components. The search space is explored by beam search and model parameters are estimated with the averaged structured perceptron (Collins, 2002) from training data consisting of question-answer pairs, using answer F 1 -score as the objective.",
                "cite_spans": [
                    {
                        "start": 653,
                        "end": 668,
                        "text": "(Collins, 2002)",
                        "ref_id": "BIBREF19"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 307,
                        "end": 315,
                        "text": "Figure 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Semantic Parsing as Graph Matching",
                "sec_num": "4.1"
            },
            {
                "text": "We evaluate our approach on two public benchmarks of question answering against Freebase: WebQuestions (Berant et al., 2013) , a widely used benchmark consisting of English questions and their answers, and GraphQuestions , a recently released dataset of English questions with both their answers and grounded logical forms.",
                "cite_spans": [
                    {
                        "start": 103,
                        "end": 124,
                        "text": "(Berant et al., 2013)",
                        "ref_id": "BIBREF12"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Datasets",
                "sec_num": "4.2"
            },
            {
                "text": "While WebQuestions is dominated by simple entityattribute questions, GraphQuestions contains a large number of compositional questions involving aggregation (e.g. How many children of Eddard Stark were born in Winterfell? ) and comparison (e.g. In which month does the average rainfall of New York City exceed 86 mm? ). The number of training, development and test questions is 2644, 1134, and 2032, respectively, for WebQuestions and 1794, 764, and 2608 for GraphQuestions.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Datasets",
                "sec_num": "4.2"
            },
            {
                "text": "To support multilingual evaluation, we created translations of WebQuestions and GraphQuestions to German and Spanish. For WebQuestions two professional annotators were hired per language, while for GraphQuestions we used a trusted pool of 20 annotators per language (with a single annotator per question). Examples of the original questions and their translations are provided in Table 1 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 380,
                        "end": 387,
                        "text": "Table 1",
                        "ref_id": "TABREF2"
                    }
                ],
                "eq_spans": [],
                "section": "Datasets",
                "sec_num": "4.2"
            },
            {
                "text": "Here we provide details on the syntactic analyzers employed, our entity resolution algorithm, and the features used by the grounding model.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Implementation Details",
                "sec_num": "4.3"
            },
            {
                "text": "The English, Spanish, and German Universal Dependencies (UD) treebanks (v1.3; Nivre et al 2016) were used to train part of speech taggers and dependency parsers. We used a bidirectional LSTM tagger (Plank et al., 2016 ) and a bidirectional LSTM shift-reduce parser (Kiperwasser and Goldberg, 2016). Both the tagger and parser require word embeddings. For English, we used GloVe embeddings (Pennington et al., 2014) trained on Wikipedia and the Gigaword corpus. For German and Spanish, we used SENNA embeddings (Collobert et al., 2011; Al-Rfou et al., 2013) trained on Wikipedia corpora (589M words German; 397M words Spanish). 6 Measured on the UD test sets, the tagger accuracies are 94.5 (English), 92.2 (German), and 95.7 (Spanish), with corresponding labeled attachment parser scores of 81.8, 74.7, and 82.2.",
                "cite_spans": [
                    {
                        "start": 198,
                        "end": 217,
                        "text": "(Plank et al., 2016",
                        "ref_id": "BIBREF54"
                    },
                    {
                        "start": 389,
                        "end": 414,
                        "text": "(Pennington et al., 2014)",
                        "ref_id": "BIBREF53"
                    },
                    {
                        "start": 510,
                        "end": 534,
                        "text": "(Collobert et al., 2011;",
                        "ref_id": "BIBREF20"
                    },
                    {
                        "start": 535,
                        "end": 556,
                        "text": "Al-Rfou et al., 2013)",
                        "ref_id": "BIBREF3"
                    },
                    {
                        "start": 627,
                        "end": 628,
                        "text": "6",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Dependency Parsing",
                "sec_num": null
            },
            {
                "text": "We follow and resolve entities in three steps: (1) potential entity spans are identified using seven handcrafted part-of-speech patterns; (2) each span is associated with potential Freebase entities according to the Freebase/KG API; and (3) the 10-best entity linking lattices, scored by a structured perceptron, are 6 https://sites.google.com/site/rmyeid/projects/polyglot. input to GRAPHPARSER, leaving the final disambiguation to the semantic parsing problem. Table 2 shows the 1-best and 10-best entity disambiguation F 1 -scores for each language and dataset.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 463,
                        "end": 470,
                        "text": "Table 2",
                        "ref_id": "TABREF3"
                    }
                ],
                "eq_spans": [],
                "section": "Entity Resolution",
                "sec_num": null
            },
            {
                "text": "Features We use features similar to : basic features of words and Freebase relations, and graph features crossing ungrounded events with grounded relations, ungrounded types with grounded relations, and ungrounded answer type crossed with a binary feature indicating if the answer is a number. In addition, we add features encoding the semantic similarity of ungrounded events and Freebase relations. Specifically, we used the cosine similarity of the translation-invariant embeddings of Huang et al. (2015) . 7",
                "cite_spans": [
                    {
                        "start": 488,
                        "end": 507,
                        "text": "Huang et al. (2015)",
                        "ref_id": "BIBREF33"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Entity Resolution",
                "sec_num": null
            },
            {
                "text": "We compared UDEPLAMBDA to four versions of GRAPHPARSER that operate on different representations, in addition to prior work.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Comparison Systems",
                "sec_num": "4.4"
            },
            {
                "text": "SINGLEEVENT This model resembles the learning-to-rank model of Bast and Haussmann (2015) . An ungrounded graph is generated by connecting all entities in the question with the TARGET node, representing a single event. Note that this baseline cannot handle compositional questions, or those with aggregation or comparison.",
                "cite_spans": [
                    {
                        "start": 63,
                        "end": 88,
                        "text": "Bast and Haussmann (2015)",
                        "ref_id": "BIBREF8"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Comparison Systems",
                "sec_num": "4.4"
            },
            {
                "text": "DEPTREE An ungrounded graph is obtained directly from the original dependency tree. An event is created for each parent and its dependents in the tree. Each dependent is linked to this event with an edge labeled with its dependency relation, while the parent is linked to the event with an edge labeled arg 0 . If a word is a question word, an additional TARGET predicate is attached to its entity node.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Comparison Systems",
                "sec_num": "4.4"
            },
            {
                "text": "CCGGRAPH This is the CCG-based semantic representation of Reddy et al. (2014) . Note that this baseline exists only for English.",
                "cite_spans": [
                    {
                        "start": 58,
                        "end": 77,
                        "text": "Reddy et al. (2014)",
                        "ref_id": "BIBREF55"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Comparison Systems",
                "sec_num": "4.4"
            },
            {
                "text": "UDEPLAMBDASRL This is similar to UDEP-LAMBDA except that instead of assuming nsubj, dobj and nsubjpass correspond to arg 1 , arg 2 and arg 2 , we employ semantic role labeling to identify the correct interpretation. We used the systems of Roth and Woodsend (2014) for English and German and Bjrkelund et al. (2009) for Spanish trained on the CoNLL-2009 dataset (Haji et al., 2009 ). 8 Table 3 shows the performance of GRAPHPARSER with these different representations. Here and in what follows, we use average F 1 -score of predicted answers (Berant et al., 2013) as the evaluation metric. We first observe that UDEPLAMBDA consistently outperforms the SINGLEEVENT and DEP-TREE representations in all languages. For English, performance is on par with CCG-GRAPH, which suggests that UDEPLAMBDA does not sacrifice too much specificity for universality. With both datasets, results are lower for German compared to Spanish. This agrees with the lower performance of the syntactic parser on the German portion of the UD treebank. While U-DEPLAMBDASRL performs better than UDEP-Method GraphQ. WebQ. SEMPRE (Berant et al., 2013) 10.8 35.7 JACANA (Yao and Van Durme, 2014) 5.1 33.0 PARASEMPRE (Berant and Liang, 2014) 12.8 39.9 QA (Yao, 2015) -44.3 AQQU (Bast and Haussmann, 2015) -49.4 AGENDAIL (Berant and Liang, 2015) -49.7 DEPLAMBDA -50.3 STAGG (Yih et al., 2015) -48.4 (52.5) BILSTM (T\u00fcre and Jojic, 2016) -24.9 (52.2) MCNN (Xu et al., 2016) -47.0 (53.3) AGENDAIL-RANK (Yavuz et al., 2016) -51.6 (52.6) UDEPLAMBDA 17.7 49.5 Table 4 : F 1 -scores on the English GraphQuestions and WebQuestions test sets (results with additional task-specific resources in parentheses).",
                "cite_spans": [
                    {
                        "start": 239,
                        "end": 263,
                        "text": "Roth and Woodsend (2014)",
                        "ref_id": "BIBREF57"
                    },
                    {
                        "start": 291,
                        "end": 314,
                        "text": "Bjrkelund et al. (2009)",
                        "ref_id": "BIBREF15"
                    },
                    {
                        "start": 361,
                        "end": 379,
                        "text": "(Haji et al., 2009",
                        "ref_id": "BIBREF32"
                    },
                    {
                        "start": 541,
                        "end": 562,
                        "text": "(Berant et al., 2013)",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 1100,
                        "end": 1121,
                        "text": "(Berant et al., 2013)",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 1139,
                        "end": 1164,
                        "text": "(Yao and Van Durme, 2014)",
                        "ref_id": "BIBREF68"
                    },
                    {
                        "start": 1185,
                        "end": 1209,
                        "text": "(Berant and Liang, 2014)",
                        "ref_id": "BIBREF13"
                    },
                    {
                        "start": 1223,
                        "end": 1234,
                        "text": "(Yao, 2015)",
                        "ref_id": "BIBREF67"
                    },
                    {
                        "start": 1246,
                        "end": 1272,
                        "text": "(Bast and Haussmann, 2015)",
                        "ref_id": "BIBREF8"
                    },
                    {
                        "start": 1288,
                        "end": 1312,
                        "text": "(Berant and Liang, 2015)",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 1380,
                        "end": 1402,
                        "text": "(T\u00fcre and Jojic, 2016)",
                        "ref_id": "BIBREF63"
                    },
                    {
                        "start": 1421,
                        "end": 1438,
                        "text": "(Xu et al., 2016)",
                        "ref_id": "BIBREF66"
                    },
                    {
                        "start": 1466,
                        "end": 1486,
                        "text": "(Yavuz et al., 2016)",
                        "ref_id": "BIBREF69"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 385,
                        "end": 392,
                        "text": "Table 3",
                        "ref_id": "TABREF5"
                    },
                    {
                        "start": 1521,
                        "end": 1528,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Comparison Systems",
                "sec_num": "4.4"
            },
            {
                "text": "LAMBDA on WebQuestions for English, we do not see large performance gaps in other settings, suggesting that GRAPHPARSER is either able to learn context-sensitive semantics of ungrounded predicates or that the datasets do not contain ambiguous nsubj, dobj and nsubjpass mappings. Finally, while these results confirm that GraphQuestions is much harder compared to WebQuestions, we note that both datasets predominantly contain single-hop questions, as indicated by the competitive performance of SINGLEEVENT on both datasets. Table 4 compares UDEPLAMBDA with previously published models which exist only for English and have been mainly evaluated on Web-Questions. These are either symbolic like ours (first block) or employ neural networks (second block). Results for models using additional task-specific training resources, such as ClueWeb09, Wikipedia, or SimpleQuestions (Bordes et al., 2015) are shown in parentheses. On GraphQuestions, we achieve a new state-of-the-art result with a gain of 4.8 F 1points over the previously reported best result. On WebQuestions we are 2.1 points below the best model using comparable resources, and 3.8 points below the state of the art. Most related to our work is the English-specific system of . We attribute the 0.8 point difference in F 1score to their use of the more fine-grained PTB tag set and Stanford Dependencies.",
                "cite_spans": [
                    {
                        "start": 875,
                        "end": 896,
                        "text": "(Bordes et al., 2015)",
                        "ref_id": "BIBREF16"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 525,
                        "end": 532,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Results",
                "sec_num": "4.5"
            },
            {
                "text": "Our work continues the long tradition of building logical forms from syntactic representations initiated by Montague (1973) . The literature is rife with attempts to develop semantic interfaces for HPSG (Copestake et al., 2005) , LFG (Kaplan and Bresnan, 1982; Dalrymple et al., 1995; Crouch and King, 2006) , TAG (Kallmeyer and Joshi, 2003; Gardent and Kallmeyer, 2003; Nesson and Shieber, 2006) , and CCG (Baldridge and Kruijff, 2002; Bos et al., 2004; Artzi et al., 2015) . Unlike existing semantic interfaces, UDEPLAMBDA uses dependency syntax, a widely available syntactic resource.",
                "cite_spans": [
                    {
                        "start": 108,
                        "end": 123,
                        "text": "Montague (1973)",
                        "ref_id": "BIBREF46"
                    },
                    {
                        "start": 203,
                        "end": 227,
                        "text": "(Copestake et al., 2005)",
                        "ref_id": "BIBREF21"
                    },
                    {
                        "start": 230,
                        "end": 260,
                        "text": "LFG (Kaplan and Bresnan, 1982;",
                        "ref_id": null
                    },
                    {
                        "start": 261,
                        "end": 284,
                        "text": "Dalrymple et al., 1995;",
                        "ref_id": "BIBREF23"
                    },
                    {
                        "start": 285,
                        "end": 307,
                        "text": "Crouch and King, 2006)",
                        "ref_id": "BIBREF22"
                    },
                    {
                        "start": 314,
                        "end": 341,
                        "text": "(Kallmeyer and Joshi, 2003;",
                        "ref_id": "BIBREF37"
                    },
                    {
                        "start": 342,
                        "end": 370,
                        "text": "Gardent and Kallmeyer, 2003;",
                        "ref_id": "BIBREF27"
                    },
                    {
                        "start": 371,
                        "end": 396,
                        "text": "Nesson and Shieber, 2006)",
                        "ref_id": "BIBREF47"
                    },
                    {
                        "start": 407,
                        "end": 436,
                        "text": "(Baldridge and Kruijff, 2002;",
                        "ref_id": "BIBREF6"
                    },
                    {
                        "start": 437,
                        "end": 454,
                        "text": "Bos et al., 2004;",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 455,
                        "end": 474,
                        "text": "Artzi et al., 2015)",
                        "ref_id": "BIBREF5"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "5"
            },
            {
                "text": "A common trend in previous work on semantic interfaces is the reliance on rich typed feature structures or semantic types coupled with strong type constraints, which can be very informative but unavoidably language specific. Instead, UDEP-LAMBDA relies on generic unlexicalized information present in dependency treebanks and uses a simple type system (one type for dependency labels, and one for words) along with a combinatory mechanism, which avoids type collisions. Earlier attempts at extracting semantic representations from dependencies have mainly focused on languagespecific dependency representations (Spreyer and Frank, 2005; Simov and Osenova, 2011; Hahn and Meurers, 2011; Falke et al., 2016; Beltagy, 2016) , and multi-layered dependency annotations (Jakob et al., 2010; B\u00e9daride and Gardent, 2011) . In contrast, UDEPLAMBDA derives semantic representations for multiple languages in a common schema directly from Universal Dependencies. This work parallels a growing interest in creating other forms of multilingual semantic representations (Akbik et al., 2015; Vanderwende et al., 2015; White et al., 2016; Evang and Bos, 2016) .",
                "cite_spans": [
                    {
                        "start": 611,
                        "end": 636,
                        "text": "(Spreyer and Frank, 2005;",
                        "ref_id": "BIBREF61"
                    },
                    {
                        "start": 637,
                        "end": 661,
                        "text": "Simov and Osenova, 2011;",
                        "ref_id": "BIBREF60"
                    },
                    {
                        "start": 662,
                        "end": 685,
                        "text": "Hahn and Meurers, 2011;",
                        "ref_id": "BIBREF31"
                    },
                    {
                        "start": 686,
                        "end": 705,
                        "text": "Falke et al., 2016;",
                        "ref_id": "BIBREF25"
                    },
                    {
                        "start": 706,
                        "end": 720,
                        "text": "Beltagy, 2016)",
                        "ref_id": "BIBREF10"
                    },
                    {
                        "start": 764,
                        "end": 784,
                        "text": "(Jakob et al., 2010;",
                        "ref_id": "BIBREF34"
                    },
                    {
                        "start": 785,
                        "end": 812,
                        "text": "B\u00e9daride and Gardent, 2011)",
                        "ref_id": "BIBREF9"
                    },
                    {
                        "start": 1056,
                        "end": 1076,
                        "text": "(Akbik et al., 2015;",
                        "ref_id": "BIBREF2"
                    },
                    {
                        "start": 1077,
                        "end": 1102,
                        "text": "Vanderwende et al., 2015;",
                        "ref_id": "BIBREF64"
                    },
                    {
                        "start": 1103,
                        "end": 1122,
                        "text": "White et al., 2016;",
                        "ref_id": "BIBREF65"
                    },
                    {
                        "start": 1123,
                        "end": 1143,
                        "text": "Evang and Bos, 2016)",
                        "ref_id": "BIBREF24"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "5"
            },
            {
                "text": "We evaluate UDEPLAMBDA on semantic parsing for question answering against a knowledge base. Here, the literature offers two main modeling paradigms: (1) learning of task-specific grammars that directly parse language to a grounded representation (Zelle and Mooney, 1996; Zettlemoyer and Collins, 2005; Berant et al., 2013; Flanigan et al., 2014; Pasupat and Liang, 2015; Groschwitz et al., 2015) ; and (2) converting language to a linguistically motivated task-independent representation that is then mapped to a grounded representation (Kwiatkowski et al., 2013; Reddy et al., 2014; Krishnamurthy and Mitchell, 2015; Gardner and Krishnamurthy, 2017) . Our work belongs to the latter paradigm, as we map natural language to Freebase indirectly via logical forms. Capitalizing on natural-language syntax affords interpretability, scalability, and reduced duplication of effort across applications (Bender et al., 2015) . Our work also relates to literature on parsing multiple languages to a common executable representation (Cimiano et al., 2013; Haas and Riezler, 2016) . However, existing approaches still map to the target meaning representations (more or less) directly (Kwiatkowksi et al., 2010; Jones et al., 2012; Jie and Lu, 2014) .",
                "cite_spans": [
                    {
                        "start": 246,
                        "end": 270,
                        "text": "(Zelle and Mooney, 1996;",
                        "ref_id": "BIBREF71"
                    },
                    {
                        "start": 271,
                        "end": 301,
                        "text": "Zettlemoyer and Collins, 2005;",
                        "ref_id": "BIBREF72"
                    },
                    {
                        "start": 302,
                        "end": 322,
                        "text": "Berant et al., 2013;",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 323,
                        "end": 345,
                        "text": "Flanigan et al., 2014;",
                        "ref_id": "BIBREF26"
                    },
                    {
                        "start": 346,
                        "end": 370,
                        "text": "Pasupat and Liang, 2015;",
                        "ref_id": "BIBREF52"
                    },
                    {
                        "start": 371,
                        "end": 395,
                        "text": "Groschwitz et al., 2015)",
                        "ref_id": "BIBREF29"
                    },
                    {
                        "start": 537,
                        "end": 563,
                        "text": "(Kwiatkowski et al., 2013;",
                        "ref_id": "BIBREF42"
                    },
                    {
                        "start": 564,
                        "end": 583,
                        "text": "Reddy et al., 2014;",
                        "ref_id": "BIBREF55"
                    },
                    {
                        "start": 584,
                        "end": 617,
                        "text": "Krishnamurthy and Mitchell, 2015;",
                        "ref_id": "BIBREF40"
                    },
                    {
                        "start": 618,
                        "end": 650,
                        "text": "Gardner and Krishnamurthy, 2017)",
                        "ref_id": "BIBREF28"
                    },
                    {
                        "start": 896,
                        "end": 917,
                        "text": "(Bender et al., 2015)",
                        "ref_id": "BIBREF11"
                    },
                    {
                        "start": 1024,
                        "end": 1046,
                        "text": "(Cimiano et al., 2013;",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 1047,
                        "end": 1070,
                        "text": "Haas and Riezler, 2016)",
                        "ref_id": "BIBREF30"
                    },
                    {
                        "start": 1174,
                        "end": 1200,
                        "text": "(Kwiatkowksi et al., 2010;",
                        "ref_id": "BIBREF41"
                    },
                    {
                        "start": 1201,
                        "end": 1220,
                        "text": "Jones et al., 2012;",
                        "ref_id": "BIBREF36"
                    },
                    {
                        "start": 1221,
                        "end": 1238,
                        "text": "Jie and Lu, 2014)",
                        "ref_id": "BIBREF35"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "5"
            },
            {
                "text": "We introduced UDEPLAMBDA, a semantic interface for Universal Dependencies, and showed that the resulting semantic representation can be used for question-answering against a knowledge base in multiple languages. We provided translations of benchmark datasets in German and Spanish, in the hope to stimulate further multilingual research on semantic parsing and question answering in general. We have only scratched the surface when it comes to applying UDEPLAMBDA to natural language understanding tasks. In the future, we would like to explore how this framework can benefit applications such as summarization (Liu et al., 2015) and machine reading (Sachan and Xing, 2016) .",
                "cite_spans": [
                    {
                        "start": 611,
                        "end": 629,
                        "text": "(Liu et al., 2015)",
                        "ref_id": "BIBREF44"
                    },
                    {
                        "start": 650,
                        "end": 673,
                        "text": "(Sachan and Xing, 2016)",
                        "ref_id": "BIBREF58"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusions",
                "sec_num": "6"
            },
            {
                "text": "As of v1.3, UD annotations are available for 47 languages at http://universaldependencies.org.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "UD encodes voice as a morphological feature, but most syntactic analyzers do not produce this information yet.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "UD v1.3 has 40 dependency labels, and the number of substitution rules in UDEPLAMBDA are 61, with some labels having multiple rules, and some representing lexical semantics.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "http://128.2.220.95/multilingual/data/.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "The parser accuracies (%) are 87.33, 81.38 and 79.91for English, German and Spanish respectively.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "This work greatly benefited from discussions with Michael Collins, Dipanjan Das, Federico Fancellu, Julia Hockenmaier, Tom Kwiatkowski, Adam Lopez, Valeria de Paiva, Martha Palmer, Fernando Pereira, Emily Pitler, Vijay Saraswat, Nathan Schneider, Bonnie Webber, Luke Zettlemoyer, and the members of ILCC Edinburgh University, the Microsoft Research Redmond NLP group, the Stanford NLP group, and the UW NLP and Linguistics group. We thank Reviewer 2 for useful feedback. The authors would also like to thank the Universal Dependencies community for the treebanks and documentation. This research is supported by a Google PhD Fellowship to the first author. We acknowledge the financial support of the European Research Council (Lapata; award number 681760).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Acknowledgements",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "The Parallel Meaning Bank: Towards a Multilingual Corpus of Translations Annotated with Compositional Meaning Representations",
                "authors": [
                    {
                        "first": "Lasha",
                        "middle": [],
                        "last": "Abzianidze",
                        "suffix": ""
                    },
                    {
                        "first": "Johannes",
                        "middle": [],
                        "last": "Bjerva",
                        "suffix": ""
                    },
                    {
                        "first": "Kilian",
                        "middle": [],
                        "last": "Evang",
                        "suffix": ""
                    },
                    {
                        "first": "Hessel",
                        "middle": [],
                        "last": "Haagsma",
                        "suffix": ""
                    },
                    {
                        "first": "Rik",
                        "middle": [],
                        "last": "Van Noord",
                        "suffix": ""
                    },
                    {
                        "first": "Pierre",
                        "middle": [],
                        "last": "Ludmann",
                        "suffix": ""
                    },
                    {
                        "first": "Duc-Duy",
                        "middle": [],
                        "last": "Nguyen",
                        "suffix": ""
                    },
                    {
                        "first": "Johan",
                        "middle": [],
                        "last": "Bos",
                        "suffix": ""
                    }
                ],
                "year": 2017,
                "venue": "Proceedings of the",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Lasha Abzianidze, Johannes Bjerva, Kilian Evang, Hessel Haagsma, Rik van Noord, Pierre Ludmann, Duc-Duy Nguyen, and Johan Bos. 2017. The Par- allel Meaning Bank: Towards a Multilingual Cor- pus of Translations Annotated with Compositional Meaning Representations. In Proceedings of the",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "European Chapter of the Association for Computational Linguistics",
                "authors": [],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "242--247",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "European Chapter of the Association for Compu- tational Linguistics. Association for Computational Linguistics, Valencia, Spain, pages 242-247.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "Generating High Quality Proposition Banks for Multilingual Semantic Role Labeling",
                "authors": [
                    {
                        "first": "Alan",
                        "middle": [],
                        "last": "Akbik",
                        "suffix": ""
                    },
                    {
                        "first": "Marina",
                        "middle": [],
                        "last": "Danilevsky",
                        "suffix": ""
                    },
                    {
                        "first": "Yunyao",
                        "middle": [],
                        "last": "Li",
                        "suffix": ""
                    },
                    {
                        "first": "Shivakumar",
                        "middle": [],
                        "last": "Vaithyanathan",
                        "suffix": ""
                    },
                    {
                        "first": "Huaiyu",
                        "middle": [],
                        "last": "Zhu",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Association for Computational Linguistics and the International Joint Conference on Natural Language Processing. Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "397--407",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Alan Akbik, laura chiticariu, Marina Danilevsky, Yun- yao Li, Shivakumar Vaithyanathan, and Huaiyu Zhu. 2015. Generating High Quality Proposition Banks for Multilingual Semantic Role Labeling. In Pro- ceedings of the Association for Computational Lin- guistics and the International Joint Conference on Natural Language Processing. Association for Com- putational Linguistics, Beijing, China, pages 397- 407.",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "Polyglot: Distributed Word Representations for Multilingual NLP",
                "authors": [
                    {
                        "first": "Rami",
                        "middle": [],
                        "last": "Al-Rfou",
                        "suffix": ""
                    },
                    {
                        "first": "Bryan",
                        "middle": [],
                        "last": "Perozzi",
                        "suffix": ""
                    },
                    {
                        "first": "Steven",
                        "middle": [],
                        "last": "Skiena",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Proceedings of the Computational Natural Language Learning. Sofia, Bulgaria",
                "volume": "",
                "issue": "",
                "pages": "183--192",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rami Al-Rfou, Bryan Perozzi, and Steven Skiena. 2013. Polyglot: Distributed Word Representations for Multilingual NLP. In Proceedings of the Com- putational Natural Language Learning. Sofia, Bul- garia, pages 183-192.",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "Cornell SPF: Cornell Semantic Parsing Framework",
                "authors": [
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Artzi",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "arXiv": [
                        "arXiv:1311.3011"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Yoav Artzi. 2013. Cornell SPF: Cornell Semantic Pars- ing Framework. arXiv:1311.3011 [cs.CL] .",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Broad-coverage CCG Semantic Parsing with AMR",
                "authors": [
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Artzi",
                        "suffix": ""
                    },
                    {
                        "first": "Kenton",
                        "middle": [],
                        "last": "Lee",
                        "suffix": ""
                    },
                    {
                        "first": "Luke",
                        "middle": [],
                        "last": "Zettlemoyer",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Empirical Methods on Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1699--1710",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Yoav Artzi, Kenton Lee, and Luke Zettlemoyer. 2015. Broad-coverage CCG Semantic Parsing with AMR. In Proceedings of the Empirical Methods on Natural Language Processing. pages 1699-1710.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "Coupling CCG and Hybrid Logic Dependency Semantics",
                "authors": [
                    {
                        "first": "Jason",
                        "middle": [],
                        "last": "Baldridge",
                        "suffix": ""
                    },
                    {
                        "first": "-",
                        "middle": [],
                        "last": "Geert",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "319--326",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jason Baldridge and Geert-Jan Kruijff. 2002. Coupling CCG and Hybrid Logic Dependency Semantics. In Proceedings of the Association for Computational Linguistics. pages 319-326.",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "Abstract Meaning Representation for Sembanking",
                "authors": [
                    {
                        "first": "Laura",
                        "middle": [],
                        "last": "Banarescu",
                        "suffix": ""
                    },
                    {
                        "first": "Claire",
                        "middle": [],
                        "last": "Bonial",
                        "suffix": ""
                    },
                    {
                        "first": "Shu",
                        "middle": [],
                        "last": "Cai",
                        "suffix": ""
                    },
                    {
                        "first": "Madalina",
                        "middle": [],
                        "last": "Georgescu",
                        "suffix": ""
                    },
                    {
                        "first": "Kira",
                        "middle": [],
                        "last": "Griffitt",
                        "suffix": ""
                    },
                    {
                        "first": "Ulf",
                        "middle": [],
                        "last": "Hermjakob",
                        "suffix": ""
                    },
                    {
                        "first": "Kevin",
                        "middle": [],
                        "last": "Knight",
                        "suffix": ""
                    },
                    {
                        "first": "Philipp",
                        "middle": [],
                        "last": "Koehn",
                        "suffix": ""
                    },
                    {
                        "first": "Martha",
                        "middle": [],
                        "last": "Palmer",
                        "suffix": ""
                    },
                    {
                        "first": "Nathan",
                        "middle": [],
                        "last": "Schneider",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Linguistic Annotation Workshop and Interoperability with Discourse",
                "volume": "",
                "issue": "",
                "pages": "178--186",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer, and Nathan Schneider. 2013. Abstract Meaning Representation for Sembanking. In Linguistic Annotation Workshop and Interoperability with Discourse. Sofia, Bulgaria, pages 178-186.",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "More Accurate Question Answering on Freebase",
                "authors": [
                    {
                        "first": "Hannah",
                        "middle": [],
                        "last": "Bast",
                        "suffix": ""
                    },
                    {
                        "first": "Elmar",
                        "middle": [],
                        "last": "Haussmann",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of ACM International Conference on Information and Knowledge Management",
                "volume": "",
                "issue": "",
                "pages": "1431--1440",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hannah Bast and Elmar Haussmann. 2015. More Ac- curate Question Answering on Freebase. In Pro- ceedings of ACM International Conference on Infor- mation and Knowledge Management. pages 1431- 1440.",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "Deep Semantics for Dependency Structures",
                "authors": [
                    {
                        "first": "Paul",
                        "middle": [],
                        "last": "B\u00e9daride",
                        "suffix": ""
                    },
                    {
                        "first": "Claire",
                        "middle": [],
                        "last": "Gardent",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "Proceedings of Conference on Intelligent Text Processing and Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "277--288",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Paul B\u00e9daride and Claire Gardent. 2011. Deep Seman- tics for Dependency Structures. In Proceedings of Conference on Intelligent Text Processing and Com- putational Linguistics. pages 277-288.",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "title": "Natural Language Semantics Using Probabilistic Logic",
                "authors": [
                    {
                        "first": "Islam",
                        "middle": [],
                        "last": "Beltagy",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Islam Beltagy. 2016. Natural Language Semantics Us- ing Probabilistic Logic. Ph.D. thesis, Department of Computer Science, The University of Texas at Austin.",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "Layers of Interpretation: On Grammar and Compositionality",
                "authors": [
                    {
                        "first": "Emily",
                        "middle": [
                            "M"
                        ],
                        "last": "Bender",
                        "suffix": ""
                    },
                    {
                        "first": "Dan",
                        "middle": [],
                        "last": "Flickinger",
                        "suffix": ""
                    },
                    {
                        "first": "Stephan",
                        "middle": [],
                        "last": "Oepen",
                        "suffix": ""
                    },
                    {
                        "first": "Woodley",
                        "middle": [],
                        "last": "Packard",
                        "suffix": ""
                    },
                    {
                        "first": "Ann",
                        "middle": [],
                        "last": "Copestake",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the International Conference on Computational Semantics",
                "volume": "",
                "issue": "",
                "pages": "239--249",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Emily M. Bender, Dan Flickinger, Stephan Oepen, Woodley Packard, and Ann Copestake. 2015. Lay- ers of Interpretation: On Grammar and Composition- ality. In Proceedings of the International Confer- ence on Computational Semantics. Association for Computational Linguistics, London, UK, pages 239- 249.",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "Semantic Parsing on Freebase from Question-Answer Pairs",
                "authors": [
                    {
                        "first": "Jonathan",
                        "middle": [],
                        "last": "Berant",
                        "suffix": ""
                    },
                    {
                        "first": "Andrew",
                        "middle": [],
                        "last": "Chou",
                        "suffix": ""
                    },
                    {
                        "first": "Roy",
                        "middle": [],
                        "last": "Frostig",
                        "suffix": ""
                    },
                    {
                        "first": "Percy",
                        "middle": [],
                        "last": "Liang",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Proceedings of the Empirical Methods on Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1533--1544",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jonathan Berant, Andrew Chou, Roy Frostig, and Percy Liang. 2013. Semantic Parsing on Freebase from Question-Answer Pairs. In Proceedings of the Em- pirical Methods on Natural Language Processing. pages 1533-1544.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Semantic Parsing via Paraphrasing",
                "authors": [
                    {
                        "first": "Jonathan",
                        "middle": [],
                        "last": "Berant",
                        "suffix": ""
                    },
                    {
                        "first": "Percy",
                        "middle": [],
                        "last": "Liang",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1415--1425",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jonathan Berant and Percy Liang. 2014. Semantic Pars- ing via Paraphrasing. In Proceedings of the Asso- ciation for Computational Linguistics. pages 1415- 1425.",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Imitation Learning of Agenda-Based Semantic Parsers. Transactions of the Association for",
                "authors": [
                    {
                        "first": "Jonathan",
                        "middle": [],
                        "last": "Berant",
                        "suffix": ""
                    },
                    {
                        "first": "Percy",
                        "middle": [],
                        "last": "Liang",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Computational Linguistics",
                "volume": "3",
                "issue": "",
                "pages": "545--558",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jonathan Berant and Percy Liang. 2015. Imitation Learning of Agenda-Based Semantic Parsers. Trans- actions of the Association for Computational Lin- guistics 3:545-558.",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Multilingual Semantic Role Labeling",
                "authors": [
                    {
                        "first": "Anders",
                        "middle": [],
                        "last": "Bjrkelund",
                        "suffix": ""
                    },
                    {
                        "first": "Love",
                        "middle": [],
                        "last": "Hafdell",
                        "suffix": ""
                    },
                    {
                        "first": "Pierre",
                        "middle": [],
                        "last": "Nugues",
                        "suffix": ""
                    }
                ],
                "year": 2009,
                "venue": "Proceedings of Computational Natural Language Learning",
                "volume": "",
                "issue": "",
                "pages": "43--48",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Anders Bjrkelund, Love Hafdell, and Pierre Nugues. 2009. Multilingual Semantic Role Labeling. In Proceedings of Computational Natural Language Learning (CoNLL 2009): Shared Task. Association for Computational Linguistics, Boulder, Colorado, pages 43-48.",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "Large-scale simple question answering with memory networks",
                "authors": [
                    {
                        "first": "Antoine",
                        "middle": [],
                        "last": "Bordes",
                        "suffix": ""
                    },
                    {
                        "first": "Nicolas",
                        "middle": [],
                        "last": "Usunier",
                        "suffix": ""
                    },
                    {
                        "first": "Sumit",
                        "middle": [],
                        "last": "Chopra",
                        "suffix": ""
                    },
                    {
                        "first": "Jason",
                        "middle": [],
                        "last": "Weston",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Antoine Bordes, Nicolas Usunier, Sumit Chopra, and Jason Weston. 2015. Large-scale simple ques- tion answering with memory networks. CoRR abs/1506.02075.",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "Wide-Coverage Semantic Representations from a CCG Parser",
                "authors": [
                    {
                        "first": "Johan",
                        "middle": [],
                        "last": "Bos",
                        "suffix": ""
                    },
                    {
                        "first": "Stephen",
                        "middle": [],
                        "last": "Clark",
                        "suffix": ""
                    },
                    {
                        "first": "Mark",
                        "middle": [],
                        "last": "Steedman",
                        "suffix": ""
                    },
                    {
                        "first": "James",
                        "middle": [
                            "R"
                        ],
                        "last": "Curran",
                        "suffix": ""
                    },
                    {
                        "first": "Julia",
                        "middle": [],
                        "last": "Hockenmaier",
                        "suffix": ""
                    }
                ],
                "year": 2004,
                "venue": "Proceedings of the Conference on Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1240--1246",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier. 2004. Wide- Coverage Semantic Representations from a CCG Parser. In Proceedings of the Conference on Com- putational Linguistics. pages 1240-1246.",
                "links": null
            },
            "BIBREF18": {
                "ref_id": "b18",
                "title": "Multilingual question answering over linked data (QALD-3): Lab overview",
                "authors": [
                    {
                        "first": "Philipp",
                        "middle": [],
                        "last": "Cimiano",
                        "suffix": ""
                    },
                    {
                        "first": "Vanessa",
                        "middle": [],
                        "last": "Lopez",
                        "suffix": ""
                    },
                    {
                        "first": "Christina",
                        "middle": [],
                        "last": "Unger",
                        "suffix": ""
                    },
                    {
                        "first": "Elena",
                        "middle": [],
                        "last": "Cabrio",
                        "suffix": ""
                    },
                    {
                        "first": "Axel-Cyrille Ngonga",
                        "middle": [],
                        "last": "Ngomo",
                        "suffix": ""
                    },
                    {
                        "first": "Sebastian",
                        "middle": [],
                        "last": "Walter",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Information Access Evaluation. Multilinguality, Multimodality, and Visualization",
                "volume": "8138",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Philipp Cimiano, Vanessa Lopez, Christina Unger, Elena Cabrio, Axel-Cyrille Ngonga Ngomo, and Sebastian Walter. 2013. Multilingual question an- swering over linked data (QALD-3): Lab overview. In Information Access Evaluation. Multilinguality, Multimodality, and Visualization. Springer, Valencia, Spain, volume 8138.",
                "links": null
            },
            "BIBREF19": {
                "ref_id": "b19",
                "title": "Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms",
                "authors": [
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Collins",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the Empirical Methods on Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1--8",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Michael Collins. 2002. Discriminative Training Meth- ods for Hidden Markov Models: Theory and Exper- iments with Perceptron Algorithms. In Proceedings of the Empirical Methods on Natural Language Pro- cessing. pages 1-8.",
                "links": null
            },
            "BIBREF20": {
                "ref_id": "b20",
                "title": "Natural language processing (almost) from scratch",
                "authors": [
                    {
                        "first": "Ronan",
                        "middle": [],
                        "last": "Collobert",
                        "suffix": ""
                    },
                    {
                        "first": "Jason",
                        "middle": [],
                        "last": "Weston",
                        "suffix": ""
                    },
                    {
                        "first": "Leon",
                        "middle": [],
                        "last": "Bottou",
                        "suffix": ""
                    },
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Karlen",
                        "suffix": ""
                    },
                    {
                        "first": "Koray",
                        "middle": [],
                        "last": "Kavukcuoglu",
                        "suffix": ""
                    },
                    {
                        "first": "Pavel",
                        "middle": [],
                        "last": "Kuks",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "Journal of Machine Learning Research",
                "volume": "12",
                "issue": "",
                "pages": "2493--2537",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ronan Collobert, Jason Weston, Leon Bottou, Michael Karlen, Koray Kavukcuoglu, and Pavel Kuks. 2011. Natural language processing (almost) from scratch. Journal of Machine Learning Research 12:2493- 2537.",
                "links": null
            },
            "BIBREF21": {
                "ref_id": "b21",
                "title": "Minimal Recursion Semantics: An Introduction",
                "authors": [
                    {
                        "first": "Ann",
                        "middle": [],
                        "last": "Copestake",
                        "suffix": ""
                    },
                    {
                        "first": "Dan",
                        "middle": [],
                        "last": "Flickinger",
                        "suffix": ""
                    },
                    {
                        "first": "Carl",
                        "middle": [],
                        "last": "Pollard",
                        "suffix": ""
                    },
                    {
                        "first": "Ivan",
                        "middle": [
                            "A"
                        ],
                        "last": "Sag",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Research on Language and Computation",
                "volume": "3",
                "issue": "2-3",
                "pages": "281--332",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ann Copestake, Dan Flickinger, Carl Pollard, and Ivan A. Sag. 2005. Minimal Recursion Semantics: An Introduction. Research on Language and Com- putation 3(2-3):281-332.",
                "links": null
            },
            "BIBREF22": {
                "ref_id": "b22",
                "title": "Semantics via f-structure rewriting",
                "authors": [
                    {
                        "first": "Dick",
                        "middle": [],
                        "last": "Crouch",
                        "suffix": ""
                    },
                    {
                        "first": "Tracy Holloway",
                        "middle": [],
                        "last": "King",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of the LFG'06 Conference",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Dick Crouch and Tracy Holloway King. 2006. Seman- tics via f-structure rewriting. In Proceedings of the LFG'06 Conference. CSLI Publications, page 145.",
                "links": null
            },
            "BIBREF23": {
                "ref_id": "b23",
                "title": "Linear Logic for Meaning Assembly",
                "authors": [
                    {
                        "first": "Mary",
                        "middle": [],
                        "last": "Dalrymple",
                        "suffix": ""
                    },
                    {
                        "first": "John",
                        "middle": [],
                        "last": "Lamping",
                        "suffix": ""
                    },
                    {
                        "first": "C",
                        "middle": [
                            "N"
                        ],
                        "last": "Fernando",
                        "suffix": ""
                    },
                    {
                        "first": "Vijay",
                        "middle": [
                            "A"
                        ],
                        "last": "Pereira",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Saraswat",
                        "suffix": ""
                    }
                ],
                "year": 1995,
                "venue": "Proceedings of Computational Logic for Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Mary Dalrymple, John Lamping, Fernando C. N. Pereira, and Vijay A. Saraswat. 1995. Linear Logic for Meaning Assembly. In Proceedings of Computa- tional Logic for Natural Language Processing.",
                "links": null
            },
            "BIBREF24": {
                "ref_id": "b24",
                "title": "Cross-lingual Learning of an Open-domain Semantic Parser",
                "authors": [
                    {
                        "first": "Kilian",
                        "middle": [],
                        "last": "Evang",
                        "suffix": ""
                    },
                    {
                        "first": "Johan",
                        "middle": [],
                        "last": "Bos",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Conference on Computational Linguistics. The COLING 2016 Organizing Committee",
                "volume": "",
                "issue": "",
                "pages": "579--588",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kilian Evang and Johan Bos. 2016. Cross-lingual Learning of an Open-domain Semantic Parser. In Proceedings of the Conference on Computational Linguistics. The COLING 2016 Organizing Com- mittee, Osaka, Japan, pages 579-588.",
                "links": null
            },
            "BIBREF25": {
                "ref_id": "b25",
                "title": "Porting an Open Information Extraction System from English to German",
                "authors": [
                    {
                        "first": "Tobias",
                        "middle": [],
                        "last": "Falke",
                        "suffix": ""
                    },
                    {
                        "first": "Gabriel",
                        "middle": [],
                        "last": "Stanovsky",
                        "suffix": ""
                    },
                    {
                        "first": "Iryna",
                        "middle": [],
                        "last": "Gurevych",
                        "suffix": ""
                    },
                    {
                        "first": "Ido",
                        "middle": [],
                        "last": "Dagan",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "892--898",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Tobias Falke, Gabriel Stanovsky, Iryna Gurevych, and Ido Dagan. 2016. Porting an Open Information Ex- traction System from English to German. In Pro- ceedings of the Empirical Methods in Natural Lan- guage Processing. Association for Computational Linguistics, Austin, Texas, pages 892-898.",
                "links": null
            },
            "BIBREF26": {
                "ref_id": "b26",
                "title": "A Discriminative Graph-Based Parser for the Abstract Meaning Representation",
                "authors": [
                    {
                        "first": "Jeffrey",
                        "middle": [],
                        "last": "Flanigan",
                        "suffix": ""
                    },
                    {
                        "first": "Sam",
                        "middle": [],
                        "last": "Thomson",
                        "suffix": ""
                    },
                    {
                        "first": "Jaime",
                        "middle": [],
                        "last": "Carbonell",
                        "suffix": ""
                    },
                    {
                        "first": "Chris",
                        "middle": [],
                        "last": "Dyer",
                        "suffix": ""
                    },
                    {
                        "first": "Noah",
                        "middle": [
                            "A"
                        ],
                        "last": "Smith",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1426--1436",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jeffrey Flanigan, Sam Thomson, Jaime Carbonell, Chris Dyer, and Noah A. Smith. 2014. A Discrimi- native Graph-Based Parser for the Abstract Meaning Representation. In Proceedings of the Association for Computational Linguistics. pages 1426-1436.",
                "links": null
            },
            "BIBREF27": {
                "ref_id": "b27",
                "title": "Semantic Construction in Feature-based TAG",
                "authors": [
                    {
                        "first": "Claire",
                        "middle": [],
                        "last": "Gardent",
                        "suffix": ""
                    },
                    {
                        "first": "Laura",
                        "middle": [],
                        "last": "Kallmeyer",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of European Chapter of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "123--130",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Claire Gardent and Laura Kallmeyer. 2003. Semantic Construction in Feature-based TAG. In Proceedings of European Chapter of the Association for Compu- tational Linguistics. pages 123-130.",
                "links": null
            },
            "BIBREF28": {
                "ref_id": "b28",
                "title": "Open-Vocabulary Semantic Parsing with both Distributional Statistics and Formal Knowledge",
                "authors": [
                    {
                        "first": "Matt",
                        "middle": [],
                        "last": "Gardner",
                        "suffix": ""
                    },
                    {
                        "first": "Jayant",
                        "middle": [],
                        "last": "Krishnamurthy",
                        "suffix": ""
                    }
                ],
                "year": 2017,
                "venue": "Proceedings of Association for the Advancement of Artificial Intelligence",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Matt Gardner and Jayant Krishnamurthy. 2017. Open- Vocabulary Semantic Parsing with both Distribu- tional Statistics and Formal Knowledge. In Proceed- ings of Association for the Advancement of Artificial Intelligence.",
                "links": null
            },
            "BIBREF29": {
                "ref_id": "b29",
                "title": "Graph parsing with s-graph grammars",
                "authors": [
                    {
                        "first": "Jonas",
                        "middle": [],
                        "last": "Groschwitz",
                        "suffix": ""
                    },
                    {
                        "first": "Alexander",
                        "middle": [],
                        "last": "Koller",
                        "suffix": ""
                    },
                    {
                        "first": "Christoph",
                        "middle": [],
                        "last": "Teichmann",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1481--1490",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jonas Groschwitz, Alexander Koller, and Christoph Te- ichmann. 2015. Graph parsing with s-graph gram- mars. In Proceedings of the Association for Compu- tational Linguistics. pages 1481-1490.",
                "links": null
            },
            "BIBREF30": {
                "ref_id": "b30",
                "title": "A Corpus and Semantic Parser for Multilingual Natural Language Querying of OpenStreetMap",
                "authors": [
                    {
                        "first": "Carolin",
                        "middle": [],
                        "last": "Haas",
                        "suffix": ""
                    },
                    {
                        "first": "Stefan",
                        "middle": [],
                        "last": "Riezler",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
                "volume": "",
                "issue": "",
                "pages": "740--750",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Carolin Haas and Stefan Riezler. 2016. A Corpus and Semantic Parser for Multilingual Natural Language Querying of OpenStreetMap. In Proceedings of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies. Association for Computational Linguistics, San Diego, California, pages 740-750.",
                "links": null
            },
            "BIBREF31": {
                "ref_id": "b31",
                "title": "On deriving semantic representations from dependencies: A practical approach for evaluating meaning in learner corpora",
                "authors": [
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Hahn",
                        "suffix": ""
                    },
                    {
                        "first": "Detmar",
                        "middle": [],
                        "last": "Meurers",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "Proceedings of the Int. Conference on Dependency Linguistics",
                "volume": "",
                "issue": "",
                "pages": "94--103",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Michael Hahn and Detmar Meurers. 2011. On deriv- ing semantic representations from dependencies: A practical approach for evaluating meaning in learner corpora. In Proceedings of the Int. Conference on Dependency Linguistics (Depling 2011). Barcelona, pages 94-103.",
                "links": null
            },
            "BIBREF32": {
                "ref_id": "b32",
                "title": "The CoNLL-2009 shared task: Syntactic and semantic dependencies in multiple languages",
                "authors": [
                    {
                        "first": "Jan",
                        "middle": [],
                        "last": "Haji",
                        "suffix": ""
                    },
                    {
                        "first": "Massimiliano",
                        "middle": [],
                        "last": "Ciaramita",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Johansson",
                        "suffix": ""
                    },
                    {
                        "first": "Daisuke",
                        "middle": [],
                        "last": "Kawahara",
                        "suffix": ""
                    },
                    {
                        "first": "Maria",
                        "middle": [
                            "Antnia"
                        ],
                        "last": "Mart",
                        "suffix": ""
                    },
                    {
                        "first": "Llus",
                        "middle": [],
                        "last": "Mrquez",
                        "suffix": ""
                    },
                    {
                        "first": "Adam",
                        "middle": [],
                        "last": "Meyers",
                        "suffix": ""
                    },
                    {
                        "first": "Joakim",
                        "middle": [],
                        "last": "Nivre",
                        "suffix": ""
                    },
                    {
                        "first": "Sebastian",
                        "middle": [],
                        "last": "Pad",
                        "suffix": ""
                    }
                ],
                "year": 2009,
                "venue": "Proceedings of the Computational Natural Language Learning: Shared Task",
                "volume": "",
                "issue": "",
                "pages": "1--18",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jan Haji, Massimiliano Ciaramita, Richard Johans- son, Daisuke Kawahara, Maria Antnia Mart, Llus Mrquez, Adam Meyers, Joakim Nivre, Sebastian Pad, Jan tpnek, and others. 2009. The CoNLL-2009 shared task: Syntactic and semantic dependencies in multiple languages. In Proceedings of the Compu- tational Natural Language Learning: Shared Task. Association for Computational Linguistics, pages 1- 18.",
                "links": null
            },
            "BIBREF33": {
                "ref_id": "b33",
                "title": "Translation Invariant Word Embeddings",
                "authors": [
                    {
                        "first": "Kejun",
                        "middle": [],
                        "last": "Huang",
                        "suffix": ""
                    },
                    {
                        "first": "Matt",
                        "middle": [],
                        "last": "Gardner",
                        "suffix": ""
                    },
                    {
                        "first": "Evangelos",
                        "middle": [],
                        "last": "Papalexakis",
                        "suffix": ""
                    },
                    {
                        "first": "Christos",
                        "middle": [],
                        "last": "Faloutsos",
                        "suffix": ""
                    },
                    {
                        "first": "Nikos",
                        "middle": [],
                        "last": "Sidiropoulos",
                        "suffix": ""
                    },
                    {
                        "first": "Tom",
                        "middle": [],
                        "last": "Mitchell",
                        "suffix": ""
                    },
                    {
                        "first": "Partha",
                        "middle": [
                            "P"
                        ],
                        "last": "Talukdar",
                        "suffix": ""
                    },
                    {
                        "first": "Xiao",
                        "middle": [],
                        "last": "Fu",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1084--1088",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kejun Huang, Matt Gardner, Evangelos Papalex- akis, Christos Faloutsos, Nikos Sidiropoulos, Tom Mitchell, Partha P. Talukdar, and Xiao Fu. 2015. Translation Invariant Word Embeddings. In Pro- ceedings of the Empirical Methods in Natural Lan- guage Processing. Lisbon, Portugal, pages 1084- 1088.",
                "links": null
            },
            "BIBREF34": {
                "ref_id": "b34",
                "title": "Mapping between Dependency Structures and Compositional Semantic Representations",
                "authors": [
                    {
                        "first": "Max",
                        "middle": [],
                        "last": "Jakob",
                        "suffix": ""
                    },
                    {
                        "first": "Mark\u00e9ta",
                        "middle": [],
                        "last": "Lopatkov\u00e1",
                        "suffix": ""
                    },
                    {
                        "first": "Valia",
                        "middle": [],
                        "last": "Kordoni",
                        "suffix": ""
                    }
                ],
                "year": 2010,
                "venue": "Proceedings of the Fifth International Conference on Language Resources and Evaluation",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Max Jakob, Mark\u00e9ta Lopatkov\u00e1, and Valia Kordoni. 2010. Mapping between Dependency Structures and Compositional Semantic Representations. In Pro- ceedings of the Fifth International Conference on Language Resources and Evaluation.",
                "links": null
            },
            "BIBREF35": {
                "ref_id": "b35",
                "title": "Multilingual Semantic Parsing : Parsing Multiple Languages into Semantic Representations",
                "authors": [
                    {
                        "first": "Zhanming",
                        "middle": [],
                        "last": "Jie",
                        "suffix": ""
                    },
                    {
                        "first": "Wei",
                        "middle": [],
                        "last": "Lu",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Conference on Computational Linguistics. Dublin City University and Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1291--1301",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Zhanming Jie and Wei Lu. 2014. Multilingual Seman- tic Parsing : Parsing Multiple Languages into Se- mantic Representations. In Proceedings of the Con- ference on Computational Linguistics. Dublin City University and Association for Computational Lin- guistics, Dublin, Ireland, pages 1291-1301.",
                "links": null
            },
            "BIBREF36": {
                "ref_id": "b36",
                "title": "Semantic Parsing with Bayesian Tree Transducers",
                "authors": [
                    {
                        "first": "Keeley",
                        "middle": [],
                        "last": "Bevan",
                        "suffix": ""
                    },
                    {
                        "first": "Mark",
                        "middle": [],
                        "last": "Jones",
                        "suffix": ""
                    },
                    {
                        "first": "Sharon",
                        "middle": [],
                        "last": "Johnson",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Goldwater",
                        "suffix": ""
                    }
                ],
                "year": 2012,
                "venue": "Proceedings of the Association for Computational Linguistics. Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "488--496",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Bevan Keeley Jones, Mark Johnson, and Sharon Gold- water. 2012. Semantic Parsing with Bayesian Tree Transducers. In Proceedings of the Association for Computational Linguistics. Association for Compu- tational Linguistics, Stroudsburg, PA, USA, pages 488-496.",
                "links": null
            },
            "BIBREF37": {
                "ref_id": "b37",
                "title": "Factoring predicate argument and scope semantics: Underspecified semantics with LTAG",
                "authors": [
                    {
                        "first": "Laura",
                        "middle": [],
                        "last": "Kallmeyer",
                        "suffix": ""
                    },
                    {
                        "first": "Aravind",
                        "middle": [],
                        "last": "Joshi",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Research on Language and Computation",
                "volume": "1",
                "issue": "1-2",
                "pages": "3--58",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Laura Kallmeyer and Aravind Joshi. 2003. Factor- ing predicate argument and scope semantics: Under- specified semantics with LTAG. Research on Lan- guage and Computation 1(1-2):3-58.",
                "links": null
            },
            "BIBREF38": {
                "ref_id": "b38",
                "title": "Lexicalfunctional grammar: A formal system for grammatical representation",
                "authors": [
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Ronald",
                        "suffix": ""
                    },
                    {
                        "first": "Joan",
                        "middle": [],
                        "last": "Kaplan",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Bresnan",
                        "suffix": ""
                    }
                ],
                "year": 1982,
                "venue": "Formal Issues in Lexical-Functional Grammar",
                "volume": "",
                "issue": "",
                "pages": "29--130",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ronald M Kaplan and Joan Bresnan. 1982. Lexical- functional grammar: A formal system for gram- matical representation. Formal Issues in Lexical- Functional Grammar pages 29-130.",
                "links": null
            },
            "BIBREF39": {
                "ref_id": "b39",
                "title": "Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations. Transactions of the Association for Computational Linguistics",
                "authors": [
                    {
                        "first": "Eliyahu",
                        "middle": [],
                        "last": "Kiperwasser",
                        "suffix": ""
                    },
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Goldberg",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "",
                "volume": "4",
                "issue": "",
                "pages": "313--327",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Eliyahu Kiperwasser and Yoav Goldberg. 2016. Sim- ple and Accurate Dependency Parsing Using Bidi- rectional LSTM Feature Representations. Transac- tions of the Association for Computational Linguis- tics 4:313-327.",
                "links": null
            },
            "BIBREF40": {
                "ref_id": "b40",
                "title": "Learning a Compositional Semantics for Freebase with an Open Predicate Vocabulary",
                "authors": [
                    {
                        "first": "Jayant",
                        "middle": [],
                        "last": "Krishnamurthy",
                        "suffix": ""
                    },
                    {
                        "first": "Tom",
                        "middle": [
                            "M"
                        ],
                        "last": "Mitchell",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Transactions of the Association for Computational Linguistics",
                "volume": "3",
                "issue": "",
                "pages": "257--270",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jayant Krishnamurthy and Tom M. Mitchell. 2015. Learning a Compositional Semantics for Freebase with an Open Predicate Vocabulary. Transactions of the Association for Computational Linguistics 3:257-270.",
                "links": null
            },
            "BIBREF41": {
                "ref_id": "b41",
                "title": "Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification",
                "authors": [
                    {
                        "first": "Tom",
                        "middle": [],
                        "last": "Kwiatkowksi",
                        "suffix": ""
                    },
                    {
                        "first": "Luke",
                        "middle": [],
                        "last": "Zettlemoyer",
                        "suffix": ""
                    },
                    {
                        "first": "Sharon",
                        "middle": [],
                        "last": "Goldwater",
                        "suffix": ""
                    },
                    {
                        "first": "Mark",
                        "middle": [],
                        "last": "Steedman",
                        "suffix": ""
                    }
                ],
                "year": 2010,
                "venue": "Proceedings of the Empirical Methods on Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1223--1233",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Tom Kwiatkowksi, Luke Zettlemoyer, Sharon Goldwa- ter, and Mark Steedman. 2010. Inducing Probabilis- tic CCG Grammars from Logical Form with Higher- Order Unification. In Proceedings of the Empiri- cal Methods on Natural Language Processing. pages 1223-1233.",
                "links": null
            },
            "BIBREF42": {
                "ref_id": "b42",
                "title": "Scaling Semantic Parsers with On-the-Fly Ontology Matching",
                "authors": [
                    {
                        "first": "Tom",
                        "middle": [],
                        "last": "Kwiatkowski",
                        "suffix": ""
                    },
                    {
                        "first": "Eunsol",
                        "middle": [],
                        "last": "Choi",
                        "suffix": ""
                    },
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Artzi",
                        "suffix": ""
                    },
                    {
                        "first": "Luke",
                        "middle": [],
                        "last": "Zettlemoyer",
                        "suffix": ""
                    }
                ],
                "year": 2013,
                "venue": "Proceedings of the Empirical Methods on Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1545--1556",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Tom Kwiatkowski, Eunsol Choi, Yoav Artzi, and Luke Zettlemoyer. 2013. Scaling Semantic Parsers with On-the-Fly Ontology Matching. In Proceedings of the Empirical Methods on Natural Language Pro- cessing. pages 1545-1556.",
                "links": null
            },
            "BIBREF43": {
                "ref_id": "b43",
                "title": "Tregex and tsurgeon: tools for querying and manipulating tree data structures",
                "authors": [
                    {
                        "first": "Roger",
                        "middle": [],
                        "last": "Levy",
                        "suffix": ""
                    },
                    {
                        "first": "Galen",
                        "middle": [],
                        "last": "Andrew",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of LREC",
                "volume": "",
                "issue": "",
                "pages": "2231--2234",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Roger Levy and Galen Andrew. 2006. Tregex and tsur- geon: tools for querying and manipulating tree data structures. In Proceedings of LREC. pages 2231- 2234.",
                "links": null
            },
            "BIBREF44": {
                "ref_id": "b44",
                "title": "Toward Abstractive Summarization Using Semantic Representations",
                "authors": [
                    {
                        "first": "Fei",
                        "middle": [],
                        "last": "Liu",
                        "suffix": ""
                    },
                    {
                        "first": "Jeffrey",
                        "middle": [],
                        "last": "Flanigan",
                        "suffix": ""
                    },
                    {
                        "first": "Sam",
                        "middle": [],
                        "last": "Thomson",
                        "suffix": ""
                    },
                    {
                        "first": "Norman",
                        "middle": [],
                        "last": "Sadeh",
                        "suffix": ""
                    },
                    {
                        "first": "Noah",
                        "middle": [
                            "A"
                        ],
                        "last": "Smith",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of North American Chapter of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1077--1086",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fei Liu, Jeffrey Flanigan, Sam Thomson, Norman Sadeh, and Noah A. Smith. 2015. Toward Ab- stractive Summarization Using Semantic Represen- tations. In Proceedings of North American Chap- ter of the Association for Computational Linguistics. pages 1077-1086.",
                "links": null
            },
            "BIBREF45": {
                "ref_id": "b45",
                "title": "Building a large annotated corpus of English: The Penn Treebank",
                "authors": [
                    {
                        "first": "Mitchell",
                        "middle": [
                            "P"
                        ],
                        "last": "Marcus",
                        "suffix": ""
                    },
                    {
                        "first": "Mary",
                        "middle": [
                            "Ann"
                        ],
                        "last": "Marcinkiewicz",
                        "suffix": ""
                    },
                    {
                        "first": "Beatrice",
                        "middle": [],
                        "last": "Santorini",
                        "suffix": ""
                    }
                ],
                "year": 1993,
                "venue": "Computational linguistics",
                "volume": "19",
                "issue": "2",
                "pages": "313--330",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of English: The Penn Treebank. Computa- tional linguistics 19(2):313-330.",
                "links": null
            },
            "BIBREF46": {
                "ref_id": "b46",
                "title": "The Proper Treatment of Quantification in Ordinary English",
                "authors": [
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Montague",
                        "suffix": ""
                    }
                ],
                "year": 1973,
                "venue": "Approaches to Natural Language",
                "volume": "49",
                "issue": "",
                "pages": "221--242",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Richard Montague. 1973. The Proper Treatment of Quantification in Ordinary English. In K.J.J. Hin- tikka, J.M.E. Moravcsik, and P. Suppes, editors, Approaches to Natural Language, Springer Nether- lands, volume 49 of Synthese Library, pages 221- 242.",
                "links": null
            },
            "BIBREF47": {
                "ref_id": "b47",
                "title": "Simpler TAG Semantics Through Synchronization",
                "authors": [
                    {
                        "first": "Rebecca",
                        "middle": [],
                        "last": "Nesson",
                        "suffix": ""
                    },
                    {
                        "first": "Stuart",
                        "middle": [
                            "M"
                        ],
                        "last": "Shieber",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of the 11th Conference on Formal Grammar. Center for the Study of Language and Information",
                "volume": "",
                "issue": "",
                "pages": "129--142",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Rebecca Nesson and Stuart M. Shieber. 2006. Simpler TAG Semantics Through Synchronization. In Pro- ceedings of the 11th Conference on Formal Gram- mar. Center for the Study of Language and Informa- tion, Malaga, Spain, pages 129-142.",
                "links": null
            },
            "BIBREF48": {
                "ref_id": "b48",
                "title": "Universal Dependencies v1: A Multilingual Treebank Collection",
                "authors": [
                    {
                        "first": "Joakim",
                        "middle": [],
                        "last": "Nivre",
                        "suffix": ""
                    },
                    {
                        "first": "Marie-Catherine",
                        "middle": [],
                        "last": "De Marneffe",
                        "suffix": ""
                    },
                    {
                        "first": "Filip",
                        "middle": [],
                        "last": "Ginter",
                        "suffix": ""
                    },
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Goldberg",
                        "suffix": ""
                    },
                    {
                        "first": "Jan",
                        "middle": [],
                        "last": "Hajic",
                        "suffix": ""
                    },
                    {
                        "first": "Christopher",
                        "middle": [
                            "D"
                        ],
                        "last": "Manning",
                        "suffix": ""
                    },
                    {
                        "first": "Ryan",
                        "middle": [],
                        "last": "Mcdonald",
                        "suffix": ""
                    },
                    {
                        "first": "Slav",
                        "middle": [],
                        "last": "Petrov",
                        "suffix": ""
                    },
                    {
                        "first": "Sampo",
                        "middle": [],
                        "last": "Pyysalo",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Tenth International Conference on Language Resources and Evaluation. European Language Resources Association (ELRA)",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Joakim Nivre, Marie-Catherine de Marneffe, Filip Gin- ter, Yoav Goldberg, Jan Hajic, Christopher D. Man- ning, Ryan McDonald, Slav Petrov, Sampo Pyysalo, Natalia Silveira, Reut Tsarfaty, and Daniel Zeman. 2016. Universal Dependencies v1: A Multilingual Treebank Collection. In Proceedings of the Tenth In- ternational Conference on Language Resources and Evaluation. European Language Resources Associa- tion (ELRA), Paris, France.",
                "links": null
            },
            "BIBREF49": {
                "ref_id": "b49",
                "title": "Universal dependencies 1.3. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics",
                "authors": [
                    {
                        "first": "Joakim",
                        "middle": [],
                        "last": "Nivre",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Joakim Nivre et al. 2016. Universal dependencies 1.3. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics, Charles University in Prague.",
                "links": null
            },
            "BIBREF50": {
                "ref_id": "b50",
                "title": "The proposition bank: An annotated corpus of semantic roles",
                "authors": [
                    {
                        "first": "Martha",
                        "middle": [],
                        "last": "Palmer",
                        "suffix": ""
                    },
                    {
                        "first": "Daniel",
                        "middle": [],
                        "last": "Gildea",
                        "suffix": ""
                    },
                    {
                        "first": "Paul",
                        "middle": [],
                        "last": "Kingsbury",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Computational linguistics",
                "volume": "31",
                "issue": "1",
                "pages": "71--106",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Martha Palmer, Daniel Gildea, and Paul Kingsbury. 2005. The proposition bank: An annotated corpus of semantic roles. Computational linguistics 31(1):71- 106.",
                "links": null
            },
            "BIBREF51": {
                "ref_id": "b51",
                "title": "Semantic role labeling",
                "authors": [
                    {
                        "first": "Martha",
                        "middle": [],
                        "last": "Palmer",
                        "suffix": ""
                    },
                    {
                        "first": "Daniel",
                        "middle": [],
                        "last": "Gildea",
                        "suffix": ""
                    },
                    {
                        "first": "Nianwen",
                        "middle": [],
                        "last": "Xue",
                        "suffix": ""
                    }
                ],
                "year": 2010,
                "venue": "Synthesis Lectures on Human Language Technologies",
                "volume": "3",
                "issue": "1",
                "pages": "1--103",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Martha Palmer, Daniel Gildea, and Nianwen Xue. 2010. Semantic role labeling. Synthesis Lectures on Hu- man Language Technologies 3(1):1-103.",
                "links": null
            },
            "BIBREF52": {
                "ref_id": "b52",
                "title": "Compositional Semantic Parsing on Semi-Structured Tables",
                "authors": [
                    {
                        "first": "Panupong",
                        "middle": [],
                        "last": "Pasupat",
                        "suffix": ""
                    },
                    {
                        "first": "Percy",
                        "middle": [],
                        "last": "Liang",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1470--1480",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Panupong Pasupat and Percy Liang. 2015. Composi- tional Semantic Parsing on Semi-Structured Tables. In Proceedings of the Association for Computational Linguistics. pages 1470-1480.",
                "links": null
            },
            "BIBREF53": {
                "ref_id": "b53",
                "title": "Glove: Global Vectors for Word Representation",
                "authors": [
                    {
                        "first": "Jeffrey",
                        "middle": [],
                        "last": "Pennington",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Socher",
                        "suffix": ""
                    },
                    {
                        "first": "Christopher",
                        "middle": [],
                        "last": "Manning",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing. Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1532--1543",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. Glove: Global Vectors for Word Representation. In Proceedings of the Empirical Methods in Natural Language Processing. Associ- ation for Computational Linguistics, Doha, Qatar, pages 1532-1543.",
                "links": null
            },
            "BIBREF54": {
                "ref_id": "b54",
                "title": "Multilingual Part-of-Speech Tagging with Bidirectional Long Short-Term Memory Models and Auxiliary Loss",
                "authors": [
                    {
                        "first": "Barbara",
                        "middle": [],
                        "last": "Plank",
                        "suffix": ""
                    },
                    {
                        "first": "Anders",
                        "middle": [],
                        "last": "S\u00f8gaard",
                        "suffix": ""
                    },
                    {
                        "first": "Yoav",
                        "middle": [],
                        "last": "Goldberg",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Annual Meeting of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "412--418",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Barbara Plank, Anders S\u00f8gaard, and Yoav Goldberg. 2016. Multilingual Part-of-Speech Tagging with Bidirectional Long Short-Term Memory Models and Auxiliary Loss. In Proceedings of the Annual Meet- ing of the Association for Computational Linguistics. Berlin, Germany, pages 412-418.",
                "links": null
            },
            "BIBREF55": {
                "ref_id": "b55",
                "title": "Large-scale Semantic Parsing without Question-Answer Pairs",
                "authors": [
                    {
                        "first": "Siva",
                        "middle": [],
                        "last": "Reddy",
                        "suffix": ""
                    },
                    {
                        "first": "Mirella",
                        "middle": [],
                        "last": "Lapata",
                        "suffix": ""
                    },
                    {
                        "first": "Mark",
                        "middle": [],
                        "last": "Steedman",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Transactions of the Association for Computational Linguistics",
                "volume": "2",
                "issue": "",
                "pages": "377--392",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "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.",
                "links": null
            },
            "BIBREF56": {
                "ref_id": "b56",
                "title": "Transforming Dependency Structures to Logical Forms for Semantic Parsing",
                "authors": [
                    {
                        "first": "Siva",
                        "middle": [],
                        "last": "Reddy",
                        "suffix": ""
                    },
                    {
                        "first": "Oscar",
                        "middle": [],
                        "last": "T\u00e4ckstr\u00f6m",
                        "suffix": ""
                    },
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Collins",
                        "suffix": ""
                    },
                    {
                        "first": "Tom",
                        "middle": [],
                        "last": "Kwiatkowski",
                        "suffix": ""
                    },
                    {
                        "first": "Dipanjan",
                        "middle": [],
                        "last": "Das",
                        "suffix": ""
                    },
                    {
                        "first": "Mark",
                        "middle": [],
                        "last": "Steedman",
                        "suffix": ""
                    },
                    {
                        "first": "Mirella",
                        "middle": [],
                        "last": "Lapata",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Transactions of the Association for Computational Linguistics",
                "volume": "4",
                "issue": "",
                "pages": "127--140",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Siva Reddy, Oscar T\u00e4ckstr\u00f6m, Michael Collins, Tom Kwiatkowski, Dipanjan Das, Mark Steedman, and Mirella Lapata. 2016. Transforming Dependency Structures to Logical Forms for Semantic Parsing. Transactions of the Association for Computational Linguistics 4:127-140.",
                "links": null
            },
            "BIBREF57": {
                "ref_id": "b57",
                "title": "Composition of Word Representations Improves Semantic Role Labelling",
                "authors": [
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Roth",
                        "suffix": ""
                    },
                    {
                        "first": "Kristian",
                        "middle": [],
                        "last": "Woodsend",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing (EMNLP)",
                "volume": "",
                "issue": "",
                "pages": "407--413",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Michael Roth and Kristian Woodsend. 2014. Compo- sition of Word Representations Improves Semantic Role Labelling. In Proceedings of the Empirical Methods in Natural Language Processing (EMNLP). Association for Computational Linguistics, Doha, Qatar, pages 407-413.",
                "links": null
            },
            "BIBREF58": {
                "ref_id": "b58",
                "title": "Machine Comprehension using Rich Semantic Representations",
                "authors": [
                    {
                        "first": "Mrinmaya",
                        "middle": [],
                        "last": "Sachan",
                        "suffix": ""
                    },
                    {
                        "first": "Eric",
                        "middle": [],
                        "last": "Xing",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Association for Computational Linguistics. Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "486--492",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Mrinmaya Sachan and Eric Xing. 2016. Machine Com- prehension using Rich Semantic Representations. In Proceedings of the Association for Computational Linguistics. Association for Computational Linguis- tics, Berlin, Germany, pages 486-492.",
                "links": null
            },
            "BIBREF59": {
                "ref_id": "b59",
                "title": "Enhanced English Universal Dependencies: An Improved Representation for Natural Language Understanding Tasks",
                "authors": [
                    {
                        "first": "Sebastian",
                        "middle": [],
                        "last": "Schuster",
                        "suffix": ""
                    },
                    {
                        "first": "D",
                        "middle": [],
                        "last": "Christopher",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Manning",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Tenth International Conference on Language Resources and Evaluation. European Language Resources Association (ELRA)",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Sebastian Schuster and Christopher D. Manning. 2016. Enhanced English Universal Dependencies: An Im- proved Representation for Natural Language Under- standing Tasks. In Proceedings of the Tenth Interna- tional Conference on Language Resources and Eval- uation. European Language Resources Association (ELRA), Paris, France.",
                "links": null
            },
            "BIBREF60": {
                "ref_id": "b60",
                "title": "Towards Minimal Recursion Semantics over Bulgarian Dependency Parsing",
                "authors": [
                    {
                        "first": "Kiril",
                        "middle": [],
                        "last": "Simov",
                        "suffix": ""
                    },
                    {
                        "first": "Petya",
                        "middle": [],
                        "last": "Osenova",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "Proceedings of the International Conference Recent Advances in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "471--478",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kiril Simov and Petya Osenova. 2011. Towards Min- imal Recursion Semantics over Bulgarian Depen- dency Parsing. In Proceedings of the International Conference Recent Advances in Natural Language Processing 2011. RANLP 2011 Organising Commit- tee, Hissar, Bulgaria, pages 471-478.",
                "links": null
            },
            "BIBREF61": {
                "ref_id": "b61",
                "title": "Projecting RMRS from TIGER Dependencies",
                "authors": [
                    {
                        "first": "Kathrin",
                        "middle": [],
                        "last": "Spreyer",
                        "suffix": ""
                    },
                    {
                        "first": "Anette",
                        "middle": [],
                        "last": "Frank",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Proceedings of the HPSG 2005 Conference",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kathrin Spreyer and Anette Frank. 2005. Projecting RMRS from TIGER Dependencies. In Proceedings of the HPSG 2005 Conference. CSLI Publications.",
                "links": null
            },
            "BIBREF62": {
                "ref_id": "b62",
                "title": "On Generating Characteristic-rich Question Sets for QA Evaluation",
                "authors": [
                    {
                        "first": "Yu",
                        "middle": [],
                        "last": "Su",
                        "suffix": ""
                    },
                    {
                        "first": "Huan",
                        "middle": [],
                        "last": "Sun",
                        "suffix": ""
                    },
                    {
                        "first": "Brian",
                        "middle": [],
                        "last": "Sadler",
                        "suffix": ""
                    },
                    {
                        "first": "Mudhakar",
                        "middle": [],
                        "last": "Srivatsa",
                        "suffix": ""
                    },
                    {
                        "first": "Izzeddin",
                        "middle": [],
                        "last": "Gur",
                        "suffix": ""
                    },
                    {
                        "first": "Zenghui",
                        "middle": [],
                        "last": "Yan",
                        "suffix": ""
                    },
                    {
                        "first": "Xifeng",
                        "middle": [],
                        "last": "Yan",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "562--572",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Yu Su, Huan Sun, Brian Sadler, Mudhakar Srivatsa, Izzeddin Gur, Zenghui Yan, and Xifeng Yan. 2016. On Generating Characteristic-rich Question Sets for QA Evaluation. In Proceedings of the Empirical Methods in Natural Language Processing. Austin, Texas, pages 562-572.",
                "links": null
            },
            "BIBREF63": {
                "ref_id": "b63",
                "title": "Simple and Effective Question Answering with Recurrent Neural Networks",
                "authors": [
                    {
                        "first": "Ferhan",
                        "middle": [],
                        "last": "T\u00fcre",
                        "suffix": ""
                    },
                    {
                        "first": "Oliver",
                        "middle": [],
                        "last": "Jojic",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ferhan T\u00fcre and Oliver Jojic. 2016. Simple and Ef- fective Question Answering with Recurrent Neural Networks. CoRR abs/1606.05029.",
                "links": null
            },
            "BIBREF64": {
                "ref_id": "b64",
                "title": "An AMR parser for English, French, German, Spanish and Japanese and a new AMR-annotated corpus",
                "authors": [
                    {
                        "first": "Lucy",
                        "middle": [],
                        "last": "Vanderwende",
                        "suffix": ""
                    },
                    {
                        "first": "Arul",
                        "middle": [],
                        "last": "Menezes",
                        "suffix": ""
                    },
                    {
                        "first": "Chris",
                        "middle": [],
                        "last": "Quirk",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the North American Chapter of the Association for Computational Linguistics: Demonstrations. Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "26--30",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Lucy Vanderwende, Arul Menezes, and Chris Quirk. 2015. An AMR parser for English, French, German, Spanish and Japanese and a new AMR-annotated corpus. In Proceedings of the North American Chap- ter of the Association for Computational Linguistics: Demonstrations. Association for Computational Lin- guistics, Denver, Colorado, pages 26-30.",
                "links": null
            },
            "BIBREF65": {
                "ref_id": "b65",
                "title": "Universal Decompositional Semantics on Universal Dependencies",
                "authors": [
                    {
                        "first": "Aaron",
                        "middle": [],
                        "last": "Steven White",
                        "suffix": ""
                    },
                    {
                        "first": "Drew",
                        "middle": [],
                        "last": "Reisinger",
                        "suffix": ""
                    },
                    {
                        "first": "Keisuke",
                        "middle": [],
                        "last": "Sakaguchi",
                        "suffix": ""
                    },
                    {
                        "first": "Tim",
                        "middle": [],
                        "last": "Vieira",
                        "suffix": ""
                    },
                    {
                        "first": "Sheng",
                        "middle": [],
                        "last": "Zhang",
                        "suffix": ""
                    },
                    {
                        "first": "Rachel",
                        "middle": [],
                        "last": "Rudinger",
                        "suffix": ""
                    },
                    {
                        "first": "Kyle",
                        "middle": [],
                        "last": "Rawlins",
                        "suffix": ""
                    },
                    {
                        "first": "Benjamin",
                        "middle": [],
                        "last": "Van Durme",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "1713--1723",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Aaron Steven White, Drew Reisinger, Keisuke Sak- aguchi, Tim Vieira, Sheng Zhang, Rachel Rudinger, Kyle Rawlins, and Benjamin Van Durme. 2016. Uni- versal Decompositional Semantics on Universal De- pendencies. In Proceedings of the Empirical Meth- ods in Natural Language Processing. Association for Computational Linguistics, Austin, Texas, pages 1713-1723.",
                "links": null
            },
            "BIBREF66": {
                "ref_id": "b66",
                "title": "Question Answering on Freebase via Relation Extraction and Textual Evidence",
                "authors": [
                    {
                        "first": "Kun",
                        "middle": [],
                        "last": "Xu",
                        "suffix": ""
                    },
                    {
                        "first": "Siva",
                        "middle": [],
                        "last": "Reddy",
                        "suffix": ""
                    },
                    {
                        "first": "Yansong",
                        "middle": [],
                        "last": "Feng",
                        "suffix": ""
                    },
                    {
                        "first": "Songfang",
                        "middle": [],
                        "last": "Huang",
                        "suffix": ""
                    },
                    {
                        "first": "Dongyan",
                        "middle": [],
                        "last": "Zhao",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "2326--2336",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Kun Xu, Siva Reddy, Yansong Feng, Songfang Huang, and Dongyan Zhao. 2016. Question Answering on Freebase via Relation Extraction and Textual Evi- dence. In Proceedings of the Association for Compu- tational Linguistics. Association for Computational Linguistics, Berlin, Germany, pages 2326-2336.",
                "links": null
            },
            "BIBREF67": {
                "ref_id": "b67",
                "title": "Lean Question Answering over Freebase from Scratch",
                "authors": [
                    {
                        "first": "Xuchen",
                        "middle": [],
                        "last": "Yao",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of North American Chapter of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "66--70",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Xuchen Yao. 2015. Lean Question Answering over Freebase from Scratch. In Proceedings of North American Chapter of the Association for Computa- tional Linguistics. pages 66-70.",
                "links": null
            },
            "BIBREF68": {
                "ref_id": "b68",
                "title": "Information Extraction over Structured Data: Question Answering with Freebase",
                "authors": [
                    {
                        "first": "Xuchen",
                        "middle": [],
                        "last": "Yao",
                        "suffix": ""
                    },
                    {
                        "first": "Benjamin",
                        "middle": [],
                        "last": "Van Durme",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "956--966",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Xuchen Yao and Benjamin Van Durme. 2014. Infor- mation Extraction over Structured Data: Question Answering with Freebase. In Proceedings of the As- sociation for Computational Linguistics. pages 956- 966.",
                "links": null
            },
            "BIBREF69": {
                "ref_id": "b69",
                "title": "Improving Semantic Parsing via Answer Type Inference",
                "authors": [
                    {
                        "first": "Semih",
                        "middle": [],
                        "last": "Yavuz",
                        "suffix": ""
                    },
                    {
                        "first": "Izzeddin",
                        "middle": [],
                        "last": "Gur",
                        "suffix": ""
                    },
                    {
                        "first": "Yu",
                        "middle": [],
                        "last": "Su",
                        "suffix": ""
                    },
                    {
                        "first": "Mudhakar",
                        "middle": [],
                        "last": "Srivatsa",
                        "suffix": ""
                    },
                    {
                        "first": "Xifeng",
                        "middle": [],
                        "last": "Yan",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Empirical Methods in Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "149--159",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Semih Yavuz, Izzeddin Gur, Yu Su, Mudhakar Srivatsa, and Xifeng Yan. 2016. Improving Semantic Parsing via Answer Type Inference. In Proceedings of the Empirical Methods in Natural Language Processing. Association for Computational Linguistics, Austin, Texas, pages 149-159.",
                "links": null
            },
            "BIBREF70": {
                "ref_id": "b70",
                "title": "Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base",
                "authors": [
                    {
                        "first": "Ming-Wei",
                        "middle": [],
                        "last": "Wen-Tau Yih",
                        "suffix": ""
                    },
                    {
                        "first": "Xiaodong",
                        "middle": [],
                        "last": "Chang",
                        "suffix": ""
                    },
                    {
                        "first": "Jianfeng",
                        "middle": [],
                        "last": "He",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Gao",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "Proceedings of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "1321--1331",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Wen-tau Yih, Ming-Wei Chang, Xiaodong He, and Jianfeng Gao. 2015. Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base. In Proceedings of the Association for Computational Linguistics. pages 1321-1331.",
                "links": null
            },
            "BIBREF71": {
                "ref_id": "b71",
                "title": "Learning to Parse Database Queries Using Inductive Logic Programming",
                "authors": [
                    {
                        "first": "M",
                        "middle": [],
                        "last": "John",
                        "suffix": ""
                    },
                    {
                        "first": "Raymond",
                        "middle": [
                            "J"
                        ],
                        "last": "Zelle",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Mooney",
                        "suffix": ""
                    }
                ],
                "year": 1996,
                "venue": "Proceedings of Association for the Advancement of Artificial Intelligence",
                "volume": "",
                "issue": "",
                "pages": "1050--1055",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "John M. Zelle and Raymond J. Mooney. 1996. Learn- ing to Parse Database Queries Using Inductive Logic Programming. In Proceedings of Association for the Advancement of Artificial Intelligence. pages 1050- 1055.",
                "links": null
            },
            "BIBREF72": {
                "ref_id": "b72",
                "title": "Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars",
                "authors": [
                    {
                        "first": "Luke",
                        "middle": [
                            "S"
                        ],
                        "last": "Zettlemoyer",
                        "suffix": ""
                    },
                    {
                        "first": "Michael",
                        "middle": [],
                        "last": "Collins",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Proceedings of Uncertainty in Artificial Intelligence",
                "volume": "",
                "issue": "",
                "pages": "658--666",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Luke S. Zettlemoyer and Michael Collins. 2005. Learn- ing to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Gram- mars. In Proceedings of Uncertainty in Artificial In- telligence. pages 658-666.",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "type_str": "figure",
                "uris": null,
                "text": "The dependency tree for Disney won an Oscar for the movie Frozen in the Universal Dependencies formalism.",
                "num": null
            },
            "FIGREF1": {
                "type_str": "figure",
                "uris": null,
                "text": "The mapping of a dependency tree to its logical form with the intermediate s-expression.",
                "num": null
            },
            "FIGREF2": {
                "type_str": "figure",
                "uris": null,
                "text": "= Composition (binarziedTree.le f t) 22 rightLF = Composition(binarziedTree.right) 23 mainLF = BetaReduce (mainLF, le f tLF) 24 mainLF = BetaReduce (mainLF, rightLF)",
                "num": null
            },
            "FIGREF3": {
                "type_str": "figure",
                "uris": null,
                "text": "(a), we propose a variable-binding mechanism that differs Anna wants to marry Kristoff",
                "num": null
            },
            "FIGREF4": {
                "type_str": "figure",
                "uris": null,
                "text": "The original and enhanced dependency trees for Anna wants to marry Kristoff.",
                "num": null
            },
            "TABREF2": {
                "html": null,
                "content": "<table><tr><td>k</td><td/><td colspan=\"2\">WebQuestions</td><td colspan=\"3\">GraphQuestions</td></tr><tr><td/><td>en</td><td>de</td><td>es</td><td>en</td><td>de</td><td>es</td></tr><tr><td>1</td><td colspan=\"3\">89.6 82.8 86.7</td><td colspan=\"3\">47.2 39.9 39.5</td></tr><tr><td>10</td><td colspan=\"3\">95.7 91.2 94.0</td><td colspan=\"3\">56.9 48.4 51.6</td></tr></table>",
                "num": null,
                "text": "Example questions and their translations.",
                "type_str": "table"
            },
            "TABREF3": {
                "html": null,
                "content": "<table/>",
                "num": null,
                "text": "Structured perceptron k-best entity linking accuracies on the development sets.",
                "type_str": "table"
            },
            "TABREF5": {
                "html": null,
                "content": "<table/>",
                "num": null,
                "text": "F 1 -scores on the test data.",
                "type_str": "table"
            }
        }
    }
}