ACL-OCL / Base_JSON /prefixD /json /dmr /2020.dmr-1.2.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T16:24:52.413061Z"
},
"title": "Separating Argument Structure from Logical Structure in AMR",
"authors": [
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Groningen",
"location": {}
},
"email": "[email protected]"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The AMR (Abstract Meaning Representation) formalism for representing meaning of natural language sentences puts emphasis on predicate-argument structure and was not designed to deal with scope and quantifiers. By extending AMR with indices for contexts and formulating constraints on these contexts, a formalism is derived that makes correct predictions for inferences involving negation and bound variables. The attractive core predicate-argument structure of AMR is preserved. The resulting framework is similar to the meaning representations of Discourse Representation Theory employed in the Parallel Meaning Bank.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "The AMR (Abstract Meaning Representation) formalism for representing meaning of natural language sentences puts emphasis on predicate-argument structure and was not designed to deal with scope and quantifiers. By extending AMR with indices for contexts and formulating constraints on these contexts, a formalism is derived that makes correct predictions for inferences involving negation and bound variables. The attractive core predicate-argument structure of AMR is preserved. The resulting framework is similar to the meaning representations of Discourse Representation Theory employed in the Parallel Meaning Bank.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Abstract Meaning Representation, AMR (Langkilde and Knight, 1998) , or the PENMAN notation it is based on (Kasper, 1989) , puts emphasis on argument structure. In this paper I put forward a proposal to extend AMRs with a logical dimension, in order to-from a formal semantics point of view-correctly capture negation, quantification, and presuppositional phenomena. It is desirable to investigate such an extension, because (i) it would make a comparison of AMR with other semantics formalisms possible (in particular Discourse Representation Theory); (ii) it would make AMR suitable for performing logical inferences; and (iii) it would be an important step in sharing resources for semantic parsing. The aim is to do this in such a way that existing AMR-annotated corpora (Banarescu et al., 2013) can be relatively easily extended with the desired extensions. This is not the first proposal of extending the PENMAN notation to handle scope phenomena. The need to do so was recognized by other researchers (Bos, 2016; Stabler, 2017; Lai et al., 2020) . Pustejovsky et al. (2019) extend AMR with a possibility of adding explicit scope relations. This extension, however, doesn't solve a fundamental problem that AMR faces, namely viewing AMRs as directed acyclic graphs and basing their interpretation on this. Consider examples such as \"every snake bit itself\" or \"all dogs want to swim\". In the original AMR graph notation, where quantifiers are expressed as a predicate rather than taking scope, the resulting diagrams are:",
"cite_spans": [
{
"start": 37,
"end": 65,
"text": "(Langkilde and Knight, 1998)",
"ref_id": "BIBREF15"
},
{
"start": 106,
"end": 120,
"text": "(Kasper, 1989)",
"ref_id": "BIBREF13"
},
{
"start": 774,
"end": 798,
"text": "(Banarescu et al., 2013)",
"ref_id": "BIBREF2"
},
{
"start": 1007,
"end": 1018,
"text": "(Bos, 2016;",
"ref_id": "BIBREF5"
},
{
"start": 1019,
"end": 1033,
"text": "Stabler, 2017;",
"ref_id": null
},
{
"start": 1034,
"end": 1051,
"text": "Lai et al., 2020)",
"ref_id": "BIBREF14"
},
{
"start": 1054,
"end": 1079,
"text": "Pustejovsky et al. (2019)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The corresponding interpretations for these sentences could be paraphrased as \"every snake bit every snake\" and \"all dogs want all dogs to swim\", which are not the meanings that the sentences express. Let's refer to this issue as the bound variable problem.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "But there is a second, perhaps an even more pressing issue, which could be dubbed the scope representation problem. AMRs, in their original PENMAN format (Kasper, 1989) , cannot be used directly for drawing valid inferences. Let me demonstrate why this is so. Using the simple conjunction elimination rule (if the conjunction \"A and B\" is true, then \"A\" is true, and \"B\" is true), and assuming that an AMR is interpreted as a conjunction of clauses, AMR will make the right predictions as long as no negation is involved (e.g., it will yield the correct inference \"Mary left\" from \"Mary left yesterday\"). But since, in AMR, negation is represented as a predicate rather than an operator that takes scope, it will make wrong predications for negated sentences (e.g., it will allow the inference \"Mary left\" from \"Mary did not leave\". This is why AMRs need some kind of reformulation before interpretation, and that is exactly what has been proposed in earlier work (Artzi et al., 2015; Bos, 2016; Stabler, 2017; Lai et al., 2020) .",
"cite_spans": [
{
"start": 154,
"end": 168,
"text": "(Kasper, 1989)",
"ref_id": "BIBREF13"
},
{
"start": 964,
"end": 984,
"text": "(Artzi et al., 2015;",
"ref_id": "BIBREF1"
},
{
"start": 985,
"end": 995,
"text": "Bos, 2016;",
"ref_id": "BIBREF5"
},
{
"start": 996,
"end": 1010,
"text": "Stabler, 2017;",
"ref_id": null
},
{
"start": 1011,
"end": 1028,
"text": "Lai et al., 2020)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper I seek the solution at the representational level. I think the contribution of this paper is that this extension is simpler of nature than those proposed earlier (Bos, 2016; Stabler, 2017) . It bears similarities with named graphs for semantic representations (Crouch and Kalouli, 2018) . I argue that, if we want to fix the bound variable problem and the scope representation problem, AMR requires explicit scope in their representations (Bos and Abzianidze, 2019) . I propose a method to do this by keeping the underlying predicate-argument structure, and adding a second, logical layer (Section 2). In Section 3, a list of examples of extended AMRs demonstrate the approach. Some loose ends are discussed in Section 4.",
"cite_spans": [
{
"start": 176,
"end": 187,
"text": "(Bos, 2016;",
"ref_id": "BIBREF5"
},
{
"start": 188,
"end": 202,
"text": "Stabler, 2017)",
"ref_id": null
},
{
"start": 274,
"end": 300,
"text": "(Crouch and Kalouli, 2018)",
"ref_id": "BIBREF8"
},
{
"start": 453,
"end": 479,
"text": "(Bos and Abzianidze, 2019)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The idea is to extend the AMR with logical structure, obtaining a scoped representation AMR + with two dimensions: one level comprising predicate-argument structure (the original AMR, minus polarity attributes), and one level consisting of the logical structure (information about logical operators such as negation and the scope they take). This is achieved by viewing an AMR as a recursive structure, rather than interpreting it as a graph, and performing two operations on them:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "1. assign an index to each (sub-)AMR;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "2. add structural constraints to the AMR via the indices.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "AMRs can be seen as a recursive structure by viewing every slash within an AMR as a sub-AMR (Bos, 2016) . If a (sub-)AMR contains relations, those relations will introduce nested AMRs. (A constant is also an AMR, following this view.) An AMR (and all its sub-AMRs) will be labeled by decorating the slashes with indices (indices will be indicated by numbers enclosed in square brackets).",
"cite_spans": [
{
"start": 92,
"end": 103,
"text": "(Bos, 2016)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "Every AMR is augmented by a set of scoping constraints on the labels. This way, a sub-AMR can be viewed as describing a \"context\". The constraints state how the contexts relate to each other. They can be declared as the same contexts (=), a negated context (\u00ac), a conditional context (\u21d2), or a presuppositional context (<). Colons are used to denote inclusion, i.e., l : C states that context l contains condition C.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "Note that these labels are similar in spirit to those used in underspecification formalisms as proposed in the early 1990s (Reyle, 1993; Copestake et al., 1995; Bos, 1996) . The treatment of presuppositions is inspired by semantic formalism extending Discourse Representation Theory (Van der Sandt, 1992; Geurts, 1999; Venhuizen et al., 2013; Venhuizen et al., 2018) .",
"cite_spans": [
{
"start": 123,
"end": 136,
"text": "(Reyle, 1993;",
"ref_id": "BIBREF17"
},
{
"start": 137,
"end": 160,
"text": "Copestake et al., 1995;",
"ref_id": "BIBREF7"
},
{
"start": 161,
"end": 171,
"text": "Bos, 1996)",
"ref_id": "BIBREF4"
},
{
"start": 305,
"end": 318,
"text": "Geurts, 1999;",
"ref_id": "BIBREF10"
},
{
"start": 319,
"end": 342,
"text": "Venhuizen et al., 2013;",
"ref_id": "BIBREF21"
},
{
"start": 343,
"end": 366,
"text": "Venhuizen et al., 2018)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "Below I illustrate the idea with several canonical examples involving existential and universal quantification, definite descriptions, proper names, and, of course, negation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "3"
},
{
"text": "Consider the AMR for \"a dog scared a cat\" with a transitive verb and two indefinite noun phrases in PENMAN notation:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "(e / scare-01 :ARG0 (x / dog) :ARG1 (y / cat))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "Within this AMR we can identify three sub-AMRs. We index and constrain them and arrive at the following AMR + :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "(e /1/ scare-01 :ARG0 (x /2/ dog) :ARG1 (y /3/ cat)) {1 = 2, 1 = 3}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "Here, there is just one context shared by all three sub-AMRs, as one would expect with existential quantification: scope does not play a pivotal role here. As equivalent alternative, the following simplified, constraint-free AMR + can be obtained after eliminating the identity constraints:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "(e /1/ scare-01 :ARG0 (x /1/ dog) :ARG1 (y /1/ cat)) {}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Existential Quantification",
"sec_num": "3.1"
},
{
"text": "A sentence like \"the bear growled\" contains a definite description triggering an existential presupposition. Presuppositions yield new contexts:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definite Descriptions and Proper Names",
"sec_num": "3.2"
},
{
"text": "(e /1/ growl-01 :ARG0 (x /2/ bear)) {2<1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definite Descriptions and Proper Names",
"sec_num": "3.2"
},
{
"text": "In other words, the definite article triggers a presupposition that there is a bear (the AMR with index 2) with respect to context provided by the AMR indexed as 1. Proper names can be handled similarly, as the AMR + for the sentence \"Fido barked\" shows (the existence of a dog named \"Fido\" is a presupposition for the barking event):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definite Descriptions and Proper Names",
"sec_num": "3.2"
},
{
"text": "(e /1/ bark-01 :ARG0 (x /2/ dog :Name \"Fido\")) {2<1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Definite Descriptions and Proper Names",
"sec_num": "3.2"
},
{
"text": "Negation introduces a new (negated) context in AMR + . This makes the :polarity-relation in AMR obsolete. As negation is always part of another context in some cases a context needs to be coerced (second and third example below, see also Section 4.1). Consider the representations for \"a woman didn't smile\", \"the woman didn't smile\", and \"no woman smiled\":",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Negation",
"sec_num": "3.3"
},
{
"text": "(e /1/ smile-01 :ARG0 (x /2/ woman)) {2:\u00ac1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Negation",
"sec_num": "3.3"
},
{
"text": "(e /1/ smile-01 :ARG0 (x /3/ woman)) {3<1,2:\u00ac1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Negation",
"sec_num": "3.3"
},
{
"text": "(e /1/ smile.v.01 :Agent (x /1/ woman)) {2:\u00ac1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Negation",
"sec_num": "3.3"
},
{
"text": "Universal quantification introduces a conditional context in AMR + . Below are examples for quantifiers in subject position, object position, subject and object position, and a quantification with a bound variable. Note that the mod-relation used in AMR becomes obsolete.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Universal Quantification",
"sec_num": "3.4"
},
{
"text": "\"Everyone smiled.\" (e /1/ smile-01 :ARG0 (x /2/ person.n.01)) {3:2=>1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Universal Quantification",
"sec_num": "3.4"
},
{
"text": "\"A dog scared every cat.\" (e /1/ scare-01 :ARG0 (x /3/ dog) :ARG1 (y /2/ cat)) {3:2=>1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Universal Quantification",
"sec_num": "3.4"
},
{
"text": "\"Every dog scared every cat.\" (e /1/ scare-01 :ARG0 (x /2/ dog.n.01) :ARG1 (y /3/ cat)) {5:3=>4,4:2=>1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Universal Quantification",
"sec_num": "3.4"
},
{
"text": "\"Every student revised their paper.\" (e /1/ revise-01 :ARG0 (x /2/ student) :ARG1 (y /3/ paper :poss x)) {2=3,3<1,4:2=>1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Universal Quantification",
"sec_num": "3.4"
},
{
"text": "The AMR + representations share characteristics with the Discourse Representation Structure (DRS) introduced in Discourse Representation Theory, DRT for short (Kamp and Reyle, 1993) . It is important to compare AMR + with DRS for various reasons. DRT is a well-studied formalism with a modeltheoretic component. If we are able to show that the representations are equivalent then this has positive consequences for AMR, as all inferential properties supplied by DRT could be transferred to AMR. As a matter of fact, there is a rather straightforward way of converting labelled AMRs to DRS in the style of the Parallel Meaning Bank (Abzianidze et al., 2017) . This conversion comprises three main steps (\u03c4 is the translation function, \u2295 is a DRS-merge operation, and v is a function mapping an AMR to its main variable):",
"cite_spans": [
{
"start": 159,
"end": 181,
"text": "(Kamp and Reyle, 1993)",
"ref_id": "BIBREF11"
},
{
"start": 631,
"end": 656,
"text": "(Abzianidze et al., 2017)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "1. Replace each sub-AMR by a DRS. This DRS contains exactly one discourse referent, a one-place predicate, and zero or more two-place relations. The first argument of the two-place relation is the main variable of the sub-AMR; the second argument of the two-place relation is the main variable of the sub-AMR. So given an AMR + (x/i/C :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "R 1 A 1 ... R n A n ), the corresponding DRS is \u03c4 (i) = x C'(x) R' 1 (x,v(A 1 )) ... R' n (x,v(A n )) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "2. Merge all DRSs that are indexed with the same index. A merge of two DRSs (\u2295) consists of taking the unions of their respective domains and conditions. Assign an empty DRS to inferred contexts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "3. Construct the final DRS by following the structure expressed by the constraints. For instance, 3:2=>1 is translated as \u03c4 (3) \u2295 \u03c4 (2) \u21d2 \u03c4 (1) , and 1:\u00ac2 is translated as \u03c4 (1) \u2295 \u00ac \u03c4 (2) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "Here are two examples that illustrate this translation, converting AMR predicates to PMB WordNet synsets, and AMR PropBank relations to PMB VerbNet roles: \"A dog scared every cat.\" (e /1/ scare-01 :ARG0 (x /1/ dog) :ARG1 (y /2/ cat)) {3:2=>1} In terms of expressive power, AMR + is equivalent with the dialect of DRS employed in the Parallel Meaning Bank (Abzianidze et al., 2017) , where relations cannot have arity larger than two. In general, DRS is a more expressive meaning representation language.",
"cite_spans": [
{
"start": 355,
"end": 380,
"text": "(Abzianidze et al., 2017)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "From AMR to DRS",
"sec_num": "3.5"
},
{
"text": "In this section I discuss some loose ends that emerged when designing AMR + : the issue of inferred labels, annotation work required to implement the approach, and the conversion to triples.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "4"
},
{
"text": "In the current proposal, negation and conditionals introduce new indices, that do not appear in the predicate-argument level of the AMR. These are necessary to ensure a well-formed logical structure. But they are (perhaps) not intuitive, and therefore harder to annotate by coders. It would be useful to investigate whether these labels can be inferred, in such a way that constraints with colons (for negation and conditionals) could be simplified. In what direction could this go? First note that inferred contexts are needed in cases of negation (and conditionals). In DRT, a negation is formed recursively, where the negation material (represented as a DRS) is embedded into the wider context (again, represented as a DRS). But when there is nothing available in the wider context, the corresponding DRS will be empty (and as a result, there won't be a corresponding labelled AMR). As we proposed in Section 3.3, we infer an index to meet the requirements of a well-formed logical structure. Instead, we can adopt a short-hand notation for such cases, i.e., {\u00acj} meaning {i : \u00acj}, and {j \u21d2 k} meaning {i : j \u21d2 k}. But in general, conditionals would require an equivalent notation in terms of negation, so {\u00acj, j : \u00ack} as short for {i : \u00acj, j : \u00ack}, which is logically equivalent to {i : j \u21d2 k}. This would cover all cases in Section 3.4.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Inferred Labels",
"sec_num": "4.1"
},
{
"text": "Existing AMR annotations can be monotonically extended: all \"slashes\" that occur in AMRs need to be indexed, and constraints need to be added. Given an annotated AMR corpus (Banarescu et al., 2013) , this can be done semi-automatically: first add indices automatically (by replacing \"/\" by \"/1/\"). Then manually correct cases of negation (search for \":polarity -\"), universal quantification, and definite descriptions, for a sample of the corpus. Finally, use machine learning to annotate the rest (or hire or persuade human annotators to do the job). The polarity and mod relations can be optionally removed from the AMRs. An interesting question concerns the use of existing parsing models developed for AMR (Artzi et al., 2015; Damonte et al., 2017) . How can these be extended to deal with the extended AMRs as proposed in this paper? As the original AMR is not affected, a sensible approach would be one in a modular fashion, where datasets consisting of AMRs paired with AMR + s could be used as training material.",
"cite_spans": [
{
"start": 173,
"end": 197,
"text": "(Banarescu et al., 2013)",
"ref_id": "BIBREF2"
},
{
"start": 710,
"end": 730,
"text": "(Artzi et al., 2015;",
"ref_id": "BIBREF1"
},
{
"start": 731,
"end": 752,
"text": "Damonte et al., 2017)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Annotation Work",
"sec_num": "4.2"
},
{
"text": "AMRs are converted to sets of triples for evaluation purposes. Therefore, a sensible question to ask is how the logical constraints in this proposal are converted to triples. There are two new types of triple instances. The indexed sub-AMRs all introduce a membership triple (with the edge named IN) linking an instance with a scope index. Secondly, each scoping constraint introduces one or more \"structural\" triples. Constraints that involve two indices introduce a single triple. Constraints that involve three indices introduce two triples. Here is an example: \"Nobody smiled.\" (e /1/ smile-01 :ARG0 (x /2/ person)) {4:2=>3,3:\u00ac1}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Triple Format of Logical Structure",
"sec_num": "4.3"
},
{
"text": "This will introduce the membership triples < e , IN , 1 > and < x , IN , 2 >, the triple for negation < 3 , NOT , 1 >, and the triples for the implication < 4 , IF , 2 >, and < 2 , THEN , 3 >. As a consequence, standard tools for AMR evaluation ) can be used, or extended to more fine-grained scores (Damonte et al., 2017) .",
"cite_spans": [
{
"start": 300,
"end": 322,
"text": "(Damonte et al., 2017)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Triple Format of Logical Structure",
"sec_num": "4.3"
},
{
"text": "The original AMR notation can be extended by a layer of logical structure that gives correct interpretation of linguistic phenomena that require scope or quantification. The resulting framework bears strong similarities with Discourse Representation Theory as implemented in the Parallel Meaning Bank, and it deals with the bound variable problem and the scope representation problem. So what's next? Let's get an AMR corpus annotated with logical structure!",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "5"
}
],
"back_matter": [
{
"text": "This work was funded by the NWO-VICI grant Lost in . I thank the three anonymous reviewers for their feedback. Reviewer 1 rightly reminded me to cite Artzi et al. (2015) , and so I did; and I also followed their suggestion to say more about the inferred contexts (they can now be found in Section 4.1), and include more negation examples in Section 3.3 (I added \"no woman smiled\"). Reviewer 2 was under the incorrect assumption that I was unaware of Crouch and Kalouli (2018), but actually, I already referred to this article in the submitted version of this paper, which indeed shares many points of contact with my work. Reviewer 3 had some excellent suggestions, and also requested a formal definition of the translation, and I thought this was a great idea. I somehow managed to squeeze it in this short paper, forcing me to leave out some of the details. Thanks again!",
"cite_spans": [
{
"start": 150,
"end": 169,
"text": "Artzi et al. (2015)",
"ref_id": "BIBREF1"
}
],
"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 15th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "242--247",
"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 Parallel Meaning Bank: Towards a multilingual corpus of translations annotated with compositional meaning representations. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, pages 242-247, Valencia, Spain.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"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 2015 Conference on Empirical Methods in 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 2015 Conference on Empirical Methods in Natural Language Processing, pages 1699-1710, Lisbon, Portugal. Association for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"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": "Proceedings of the 7th 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 Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, pages 178-186, Sofia, Bulgaria, August.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Thirty musts for meaning banking",
"authors": [
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": ""
},
{
"first": "Lasha",
"middle": [],
"last": "Abzianidze",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the First International Workshop on Designing Meaning Representations",
"volume": "",
"issue": "",
"pages": "15--27",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Johan Bos and Lasha Abzianidze. 2019. Thirty musts for meaning banking. In Proceedings of the First In- ternational Workshop on Designing Meaning Representations, pages 15-27, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Predicate Logic Unplugged",
"authors": [
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the Tenth Amsterdam Colloquium",
"volume": "",
"issue": "",
"pages": "133--143",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Johan Bos. 1996. Predicate Logic Unplugged. In P. Dekker and M. Stokhof, editors, Proceedings of the Tenth Amsterdam Colloquium, pages 133-143, ILLC/Dept. of Philosophy, University of Amsterdam.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Expressive power of abstract meaning representations",
"authors": [
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": ""
}
],
"year": 2016,
"venue": "Computational Linguistics",
"volume": "42",
"issue": "3",
"pages": "527--535",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Johan Bos. 2016. Expressive power of abstract meaning representations. Computational Linguistics, 42(3):527- 535.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Smatch: an evaluation metric for semantic feature structures",
"authors": [
{
"first": "Shu",
"middle": [],
"last": "Cai",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "748--752",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shu Cai and Kevin Knight. 2013. Smatch: an evaluation metric for semantic feature structures. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), pages 748-752, Sofia, Bulgaria, August. Association for Computational Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Translation using Minimal Recursion Semantics",
"authors": [
{
"first": "Ann",
"middle": [],
"last": "Copestake",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Flickinger",
"suffix": ""
},
{
"first": "Rob",
"middle": [],
"last": "Malouf",
"suffix": ""
},
{
"first": "Susanne",
"middle": [],
"last": "Riehemann",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of the Sixth International Conference on Theoretical and Methodological Issues in Machine Translation",
"volume": "",
"issue": "",
"pages": "15--32",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ann Copestake, Dan Flickinger, Rob Malouf, Susanne Riehemann, and Ivan Sag. 1995. Translation using Minimal Recursion Semantics. In Proceedings of the Sixth International Conference on Theoretical and Methodological Issues in Machine Translation, pages 15-32, University of Leuven, Belgium.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Named graphs for semantic representations",
"authors": [
{
"first": "Dick",
"middle": [],
"last": "Crouch",
"suffix": ""
},
{
"first": "Aikaterini-Lida",
"middle": [],
"last": "Kalouli",
"suffix": ""
}
],
"year": 2018,
"venue": "The Seventh Joint Conference on Lexical and Computational Semantics (*SEM 2018)",
"volume": "",
"issue": "",
"pages": "113--118",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dick Crouch and Aikaterini-Lida Kalouli. 2018. Named graphs for semantic representations. In The Seventh Joint Conference on Lexical and Computational Semantics (*SEM 2018), pages 113-118, New Orleans.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "An incremental parser for Abstract Meaning Representation",
"authors": [
{
"first": "Marco",
"middle": [],
"last": "Damonte",
"suffix": ""
},
{
"first": "Shay",
"middle": [
"B"
],
"last": "Cohen",
"suffix": ""
},
{
"first": "Giorgio",
"middle": [],
"last": "Satta",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 15th Conference of the European Chapter",
"volume": "1",
"issue": "",
"pages": "536--546",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marco Damonte, Shay B. Cohen, and Giorgio Satta. 2017. An incremental parser for Abstract Meaning Represen- tation. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pages 536-546, Valencia, Spain.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Presuppositions and Pronouns",
"authors": [
{
"first": "Bart",
"middle": [],
"last": "Geurts",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bart Geurts. 1999. Presuppositions and Pronouns. Elsevier, London.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "From Discourse to Logic",
"authors": [
{
"first": "Hans",
"middle": [],
"last": "Kamp",
"suffix": ""
},
{
"first": "Uwe",
"middle": [],
"last": "Reyle",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hans Kamp and Uwe Reyle. 1993. From Discourse to Logic;",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "An Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and DRT",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "An Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and DRT. Kluwer, Dordrecht.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A flexible interface for linking applications to penman's sentence generator",
"authors": [
{
"first": "Robert",
"middle": [
"T"
],
"last": "Kasper",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of the DARPA Speech and Natural Language Workshop",
"volume": "",
"issue": "",
"pages": "153--158",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert T. Kasper. 1989. A flexible interface for linking applications to penman's sentence generator. In Proceed- ings of the DARPA Speech and Natural Language Workshop, pages 153-158, Philadelphia.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "A continuation semantics for abstract meaning representation",
"authors": [
{
"first": "Kenneth",
"middle": [],
"last": "Lai",
"suffix": ""
},
{
"first": "Lucia",
"middle": [],
"last": "Donatelli",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Pustejovsky",
"suffix": ""
}
],
"year": 2020,
"venue": "The Second International Workshop on Designing Meaning Representations (DMR 2020)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenneth Lai, Lucia Donatelli, and James Pustejovsky. 2020. A continuation semantics for abstract meaning representation. In The Second International Workshop on Designing Meaning Representations (DMR 2020), Barcelona, Spain.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Generation that exploits corpus-based statistical knowledge",
"authors": [
{
"first": "Irene",
"middle": [],
"last": "Langkilde",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 1998,
"venue": "The 17th International Conference on Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "704--710",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Irene Langkilde and Kevin Knight. 1998. Generation that exploits corpus-based statistical knowledge. In COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics, pages 704-710.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Modeling quantification and scope in abstract meaning representations",
"authors": [
{
"first": "James",
"middle": [],
"last": "Pustejovsky",
"suffix": ""
},
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Kenneth",
"middle": [],
"last": "Lai",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the First International Workshop on Designing Meaning Representations",
"volume": "",
"issue": "",
"pages": "28--33",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James Pustejovsky, Nianwen Xue, and Kenneth Lai. 2019. Modeling quantification and scope in abstract meaning representations. In Proceedings of the First International Workshop on Designing Meaning Representations, pages 28-33, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction",
"authors": [
{
"first": "Uwe",
"middle": [],
"last": "Reyle",
"suffix": ""
}
],
"year": 1993,
"venue": "Journal of Semantics",
"volume": "10",
"issue": "",
"pages": "123--179",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Uwe Reyle. 1993. Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction. Journal of Semantics, 10:123-179.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Reforming AMR. In Formal Grammar",
"authors": [],
"year": 2017,
"venue": "Lecture Notes in Computer Science",
"volume": "10686",
"issue": "",
"pages": "72--87",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ed Stabler. 2017. Reforming AMR. In Formal Grammar 2017. Lecture Notes in Computer Science, volume 10686, pages 72-87. Springer.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Van der Sandt. 1992. Presupposition Projection as Anaphora Resolution",
"authors": [
{
"first": "A",
"middle": [],
"last": "Rob",
"suffix": ""
}
],
"year": null,
"venue": "Journal of Semantics",
"volume": "9",
"issue": "",
"pages": "333--377",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rob A. Van der Sandt. 1992. Presupposition Projection as Anaphora Resolution. Journal of Semantics, 9:333- 377.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Neural semantic parsing by character-based translation: Experiments with abstract meaning representations",
"authors": [
{
"first": "Rik",
"middle": [],
"last": "Van Noord",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": ""
}
],
"year": 2017,
"venue": "Computational Linguistics in the Netherlands Journal",
"volume": "7",
"issue": "",
"pages": "93--108",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rik Van Noord and Johan Bos. 2017. Neural semantic parsing by character-based translation: Experiments with abstract meaning representations. Computational Linguistics in the Netherlands Journal, 7:93-108.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Parsimonious semantic representations with projection pointers",
"authors": [
{
"first": "J",
"middle": [],
"last": "Noortje",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Venhuizen",
"suffix": ""
},
{
"first": "Harm",
"middle": [],
"last": "Bos",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brouwer",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 10th International Conference on Computational Semantics (IWCS 2013) -Long Papers",
"volume": "",
"issue": "",
"pages": "252--263",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Noortje J. Venhuizen, Johan Bos, and Harm Brouwer. 2013. Parsimonious semantic representations with projec- tion pointers. In Proceedings of the 10th International Conference on Computational Semantics (IWCS 2013) - Long Papers, pages 252-263, Potsdam, Germany, March. Association for Computational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Discourse semantics with information structure",
"authors": [
{
"first": "Noortje",
"middle": [],
"last": "Venhuizen",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Bos",
"suffix": ""
},
{
"first": "Petra",
"middle": [],
"last": "Hendriks",
"suffix": ""
},
{
"first": "Harm",
"middle": [],
"last": "Brouwer",
"suffix": ""
}
],
"year": 2018,
"venue": "Journal of Semantics",
"volume": "35",
"issue": "1",
"pages": "127--169",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Noortje Venhuizen, Johan Bos, Petra Hendriks, and Harm Brouwer. 2018. Discourse semantics with information structure. Journal of Semantics, 35(1):127-169.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Mary didn't smile.\" (e /1/ smile-01 :ARG0 (x /2/ person.n.01 :Name \"Mary\")) {2<3,3",
"num": null,
"uris": null,
"type_str": "figure"
}
}
}
}