Abstract
This work is the continuation of the development of polynomial event semantics (a dialect of Neo-Davidsonian event semantics), using the FraCaS textual entailment corpus as a whetstone. This time we grapple with various, often complicated, relative clauses.
Relative clauses have hardly been analyzed before in event semantics. Although simple cases are straightforward, challenges arise when a clause contains quantification, coordination or negation. We deal with such complications in the present paper, focusing on entailments.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
1 Introduction
This work is the continuation of [5,6,7] on polynomial event semantics and textual entailment.
Deciding entailments ‘by pure logic’ – without resorting to meaning postulates – is one of the most attractive features of event semantics. However, beyond the classical “Brutus stabbed Caesar violently”, one quickly runs into problems. One is quantification, described and dealt with in [5, 7]; another is negation [6]. Then there are relative clauses, which are rarely considered in event semantics. In fact, the recent survey [10] and the extensive study [3] give, among the multitude of examples, not a single analysis of a sentence with a relative clause.
A relative clause appears already in the very first problem in the FraCaS textual inference problem set [4, 9]:
Such a simple case was analyzed in [7]. But even a slightly more complicated problem 018 below requires quite a non-trivial entailment reasoning involving the relative clause.
As in all FraCaS problems, the goal is to determine the entailment of the last sentence (in our case, (4)) from the others. We must stress that FraCaS collects not only positive examples of expected entailments, but also negative examples where entailment does not hold – and also “yes and no” cases where entailment comes through only on some readings. Our goal is hence not only to derive entailments where expected, but also to explain why entailment does not hold in negative examples, as well as to reproduce several readings where present.
FraCaS has quite a few problems similar to the above, with copula relative clauses (problems 005, 006, 028) and quantifiers like ‘most’ (problem 074). Object relative clauses also appear (e.g., problems 133 and 344):
There are further complications, with quantified or coordinated relative clauses:
We take FraCaS as a whetstone of a semantic theory, as a necessary application – but by no means sufficient. For example, NPs of the following form are quite common, but do not appear in FraCaS:
One should be able to analyze them and derive entailments. A reviewer has pointed further interesting examples, such as
The present paper gives analysis of all such sentences and NPs, focusing on entailments.
2 Background
First a brief reminder of polynomial event semantics. It deals with events, notated e, such as ‘having become the world’s greatest tenor’ or ‘being Italian’ or ‘having the right to live in Europe’ (we denote the latter set of events as \(\mathinner {\mathop {\textsf{RtlE}}}\)). It should be clear that we take events in a broad sense (as detailed in [10]): associated not only with actions but also states. Besides events, there are also individuals, notated i, such as \(\mathinner {\mathop {\textsf{john}}}\), and relations between events and individuals (written as \(\mathinner {\mathop {\mathsf {rel'}}}\)) such as
where \(\mathinner {\mathop {\textsf{ag}}}\) and \(\mathinner {\mathop {\textsf{th}}}\) are thematic functions (for subjects and direct objects, resp.). Their names are mere the nod to the tradition in the event semantics literature (see §7).
If \(\mathsf {rel'}\) is a relation of events to individuals,
is the set of events related to i. In particular,
is the set of events whose subject is \(\mathinner {\mathop {\textsf{john}}}\). The semantics of a simple sentence such as “John has the right to live in Europe” is given compositionally as
Subject, predicate, complements all denote event sets, and the whole sentence is their intersection. In particular, our sentence denotes – or, is witnessed by – the events of having the right to live in Europe whose subject is John. The denotation is hence an event set – or the formula representing it, as (12), which one may think of as a query of the record of events in the world. A sentence is true in that world just in case the result of the query is a non-empty event set.
The denotation of the subject is also determined compositionally, by applying \(\mathinner {\mathop {\mathsf {subj'}}}\) to the denotation of NP, in our case, \(\mathinner {\mathop {\textsf{john}}}\).
If \(d_1\) and \(d_2\) are two denotations (queries), we say \(d_1\) entails \(d_2\) (in symbols: \(d_1 \Longrightarrow d_2\)) just in case for any record of events (for any world), whenever \(d_1\) delivers a non-empty set of witnessing events, so does \(d_2\). If \(d_1\) and \(d_2\) entail each other, they are called equivalent.
2.1 Coordination and Quantification
We often deal not with individuals but with sets of individuals such as \(\mathinner {\mathop {\textsf{Student}}}\) or \(\mathinner {\mathop {\textsf{European}}}\), which are the denotations of common nouns. Determiners pick which individuals from this set to consider. Correspondingly, they call for generalization: the introduction of (internal) choice \(\sqcup \) (for narrow-scope existentials and indefinites), external choice \(\oplus \) (wide-scope ones) and grouping \(\otimes \). Thus \(\mathinner {\mathop {\textsf{john}}} \sqcup \mathinner {\mathop {\textsf{bill}}}\) is a choice between John and Bill, whereas \(\mathinner {\mathop {\textsf{john}}} \otimes \mathinner {\mathop {\textsf{bill}}}\) is a group of John and Bill: both have to be involved, not necessarily in the same action however. Likewise, event sets are generalized to polyconcepts, such as \(d_1 \otimes d_2\) for two disjoint event sets \(d_1\) and \(d_2\), which specifies that an event from \(d_1\) and an event from \(d_2\) must have transpired. Grouping is quite different from intersection \(\cap \) (generalized to \(\sqcap \) for polyconcepts), which describes common events. In particular, if d is a singleton event set, then \(d\otimes d = \bot \) (the empty polyconcept), but \(d\sqcap d = d\).
We define for convenience
The meaning of “All Europeans/Every European” is then \(\mathcal {A}\mathinner {\mathop {\textsf{European}}}\); on the other hand, \([\![\text {A European}]\!]\) (narrow scope) is \(\mathcal {E}\mathinner {\mathop {\textsf{European}}}\). Therefore, (1), repeated below
has as its denotation
where \(\sqcap \) is the generalization of set intersection \(\cap \) to polyconcepts; \(\mathinner {\mathop { \mathsf {subj'}/\,\mathsf {}}}\) is likewise generalized to apply to sets of individuals and poly-individuals – as homomorphism.
The distribution laws detailed in [7] lead to (13), which asserts there is a group of non-empty events of having right to live in Europe, and each European is a subject of some event in that group.
The notion of entailment extends to polyconcepts: The polyconcept \(d_1\) entails \(d_2\) just in case \(d_1 \not = \bot \Longrightarrow d_2 \not = \bot \). For example, [7] described several equational laws of polyconcepts, among whose is
from which it logically follows that
That is, (13) entails \(\mathsf {subj'}/\, {i} \;\cap \; \mathinner {\mathop {\textsf{RtlE}}}\) for any individual \(i \in \mathinner {\mathop {\textsf{European}}}\). In other words, if John is European, (1) entails that “John has the right to live in Europe”.
2.2 Negation
The central idea of polynomial event semantics is that the sentence denotation is a query (formula), which when applied to the record of events in a world, selects the events that support, or witness, the sentence. If that set of events turns out empty, the sentence is not supported (in that world). Negation hence presents a problem: what is the witness for the absence of support?
Our resolution [6] is to consider counter-examples. The denotation of a sentence with negation or negative quantification is also a query, but what it selects is interpreted as counter-examples. If the set of counter-examples is empty, the corresponding sentence is not contradicted. To distinguish counter-example–selecting queries and polyconcepts, they are marked with the \(\lnot \) sign.
For example, the denotation of (15) below is (16), which can be re-written to (17) according to the laws of [6].
Likewise, the denotation for (18) is (19):
Indeed, the counter-example for (18) would be a group of John skipping class events, for each class.
Negation calls for further generalization of entailment. If \(d_1\) and \(d_2\) are polyconcepts marked as negative, \(d_1 \Longrightarrow d_2\) just in case \(d_2 \not = \bar{\bot }\Longrightarrow d_1 \not = \bar{\bot }\): whenever \(d_2\) is contradicted, then so is \(d_1\). We thus obtain that (15) entails (18).
Suppose that \(\mathinner {\mathop {\textsf{Attend}}}\) and \(\mathinner {\mathop {\textsf{Skip}}}\) are disjoint event sets. Then if “John attended the PE class” is supported, “John didn’t skip the PE class” cannot be contradicted. For the sake of such entailments, we introduce (see [6, 7])
which lets us define entailment most generally: \(d_1\) entails \(d_2\) just in case \(\textrm{justified}(d_1)\) logically entails \(\textrm{justified}(d_2)\). For example, we may now derive that “John attended the PE class” entails (18).
3 Subject Relative Clauses
The problem is hence determining the meaning of “who has the right to live in Europe.” If \(\mathinner {\mathop {\textsf{RtlE}}}\) is the set of events of having the right to live in Europe, then who has that right is the subject of these events. Thus the denotation of our subject relative clause, to be notated as \(\mathinner {\mathop { \mathsf {\overline{subj}'}/\,\textsf{RtlE}}}\), is the set of individuals
Then (3), recalled below,
has as its denotation
where \(\mathinner {\mathop {\textsf{CtfE}}}\) is the set of events of having the possibility to freely travel within Europe. This analysis is more or less what was described in [7], but recast now in simpler terms. It takes us quite far: many more FraCaS problems can be analyzed similarly.
However, relative clauses with quantifiers, coordination or negation present a problem. Again we need to generalize. Remembering the definition of the \(\mathinner {\mathop {\mathsf {subj'}}}\) relation, we may re-write (21) as
One may notice that \(\mathsf {subj'}/\, {i} \cap \mathinner {\mathop {\textsf{RtlE}}}\) is exactly the meaning of “i has the right to live in Europe”. That is, “who has the right to live in Europe” is the set of those i in the domain of the \(\mathinner {\mathop {\mathsf {subj'}}}\) who make the sentence true (in the world of the discourse). The denotation of a subject relative clause “who C” may hence be defined as
This is already helpful, to solve FraCaS 018, which is, recall
For (1) we have earlier obtained the denotation (13), which says that \(\mathsf {subj'}/\, {i} \;\cap \; \mathinner {\mathop {\textsf{RtlE}}}\) is non-empty for all \(i \in \mathinner {\mathop {\textsf{European}}}\). Then (23) immediately gives \(\mathinner {\mathop {\textsf{European}}} \subset \mathinner {\mathop { \mathsf {\overline{subj}'}/\,\textsf{RtlE}}}\); in words: the set of who has the right to live in Europe includes all Europeans. Likewise, (2) gives \(\mathinner {\mathop {\textsf{European}}} \subset \mathinner {\mathop {\textsf{Person}}}\), leading to \(\mathinner {\mathop {\textsf{European}}} \subset (\mathinner {\mathop {\textsf{Person}}} \cap \mathinner {\mathop { \mathsf {\overline{subj}'}/\,\textsf{RtlE}}})\). Then, by monotonicity of \(\mathcal {A}\), (22) entails \(\mathinner {\mathop { \mathsf {subj'}/\,\mathsf {(\mathcal {A}European)}}} \sqcap \mathinner {\mathop {\textsf{CtfE}}}\), which is the denotation of (4). The entailment of (4) from the other sentences of the problem indeed holds.
Definition (23), unlike (21), now easily generalizes to the case when the denotation of the rest of the clause d is not an event set but a polyconcept with choice or grouping:
The generalization lets us analyze quantified and coordinated relative clauses such as (5)-(7). For example, for (5), repeated below,
we obtain the denotation (\(\mathcal {E}\) \(\mathinner {\mathop {\textsf{Be}}}\) is an existence event, see [7])
where, to remind, \(\mathinner {\mathop { \mathsf {\overline{subj}'}/\,\mathsf {(\mathinner {\mathop {\textsf{Sign}}} \sqcap \mathinner {\mathop { \mathsf {ob1'}/\,\mathsf {\mathcal {A}Report}}})}}}\) is a set of those individuals i such that
is justified. By the very construction, the scope of the universal does not extend past its clause. We return to this example in §5 and show a more intuitive, and useful for entailment, analysis.
4 Other Relative Clauses
The approach introduced in §3 easily extends to object, locative, etc. relative clauses. A good example to illustrate is as follows, also containing an interesting case of coordination:Footnote 1
We concentrate on one constituent:
Section 2 already introduced the relation \(\mathinner {\mathop {\mathsf {ob1'}}}\) between an action and its direct object; analogous to it is the relation \(\mathinner {\mathop {\mathsf {inloc'}}}\) between an action and an individual denoting location. Let \(\mathinner {\mathop {\textsf{Land}}}\) be the set of such location-individuals. Similarly to (24) we may then define
which gives us
where \(\mathinner {\mathop {\textsf{He}}}\) is a particular individual to which the pronoun “he” is resolved. The repetitiveness and boilerplate are apparent: generalization is in order.
We have been assigning the denotation to a sentence in a surface form – at least, how it appeared so far. In reality, we take as input a parse tree, with Penn-treebank–like annotations (see [2]). For example, “land he had created” and “land he had lived in” are represented as:
where T is the trace. Denotations (28) and (29) then clearly correspond to the annotated trees (30) and (31), resp. In fact, they are built as follows:
where C/i means replacing the trace with i. (Aspect/tense is out of scope, and the auxiliary had\(_\textsf {\tiny HVD}\) is ignored.) Connections of any constituents are uniformly represented as the intersection (\(\cap \) or \(\sqcap \)) of their denotations. Therefore, for the original clause (25) we have:Footnote 2
which lets us do entailments. For example, from (28) and (14), we obtain that
There remains a puzzle, however: (32) seems postulated, with the operation C/i of trace substitution coming out of the blue. It is also hardly compositional. We now describe how (32) comes about, and how to derive denotations (28), (29) and (33) and others like them rigorously and compositionally. We will also see what is the denotation of trace after all.
4.1 Relative Algebra
Recall, to give denotations in the polynomial event semantics we use the algebra of polyconcepts (denoted by the metavariable d) with the operations \(\bot \), \(\oplus \), \(\otimes \), \(\sqcap \) and \(\sqcup \). Strictly speaking, there are two algebras: their operations are the same, but generators differ: individuals vs. event sets. The two algebras are homomorphic: the operations \(\mathinner {\mathop { \mathsf {subj'}/\,\mathsf {\cdot }}}\), \(\mathinner {\mathop { \mathsf {ob1'}/\,\mathsf {\cdot }}}\), etc. are the homomorphisms.
We now introduce yet another algebra – called relative algebra – whose carrier are relations between individuals and polyconcepts: sets of pairs (i, d) where i is an individual ranging over \(\mathbb {I}\), the set of all individuals. The operations of the relative algebra are the lifted operations on polyconcepts: \(\bot \) of relative algebra is \(\{ (i,\bot ) \mid i \in \mathbb {I} \}\), and
and similarly for the other operations. Relative algebra is clearly homomorphic to a polyconcept algebra: for each polyconcept d there is a corresponding (we say, ‘lifted’) element of the relative algebra:
with the algebra operations commuting with lifting, as we already observed. Relative algebra also has elements that are not lifted polyconcepts. Among them is so-called \(t^r\):
Let \([\![{C}]\!]_{rel}\) be the denotation of a clause/constituent C in terms of relative algebra. It is built compositionally, mostly from the lifted denotations of its sub-constituents; the exception is the denotation of trace, which is \(t^r\). The denotation of a relative clause is then
This is the compositional analogue of (32): with it and the denotation of trace as \(t^r\), we may build denotations of arbitrary relative clauses. In particular, the denotation of (25) works out to be exactly (33).
5 Relative Clauses, Database Joins, and Trace as a Wide-Scope Indefinite
We now show two other, related, points of view on relative clauses. One treats relative clauses as database joins. The other regards trace as a wide-scope indefinite, and separates out the relative clause into an independent sentence, to which the original sentence anaphorically refers.
Relative clauses are NP modifiers: for example, in “land (that) he created”, the relative clause modifies the common noun “land”. As described earlier, polynomial event semantics derives the compositional denotation
(The denotation of the relative clause is also derived compositionally per (34).) Since the trace is related to “land”, one may wonder about a way to reflect that relation in the denotation. Although this breaks compositionality to some (small) extent, the insight seems worth it.
Among operations of the (relative) polyconcept algebra, \(\oplus \) stands out: it distributes across/commutes with any other operation. For example, letting \(d_{hc}\) be \(\mathinner {\mathop { \mathsf {subj'}/\,\textsf{He}}} \sqcap \mathinner {\mathop {\textsf{Created}}}\),
where a\(_W\) is a wide-scope indefinite. Let
which is a bona fide polyconcept. Let us introduce a ‘lifted’ \(\mathcal {I}\):
and note that
looks like a relative algebra denotation of some clause, which we call \(C_{hcal}\) for the time being. Treating it as if it were a relative clause
gives an interesting result: on one hand, the denotation of “land he created” may be computed compositionally per (35), from \([\![\text {land}_\textsf {\tiny N}]\!]\) and the denotation of the proper relative clause (with trace interpreted as \(t^r\)). On the other hand, the entire \([\![\text {land}\textsf {\tiny N}\, [_\textsf {\tiny IP-REL}\text { he created }\textsf {T}]]\!]\) can be computed in one scoop, as the denotation of a “relative clause” \(C_{hcal}\), as we have just shown. What is \(C_{hcal}\) then? Comparing (37) with (36) we notice they are almost the same: only the former uses relative algebra, and instead of a\(_W\), denoted by \(\mathcal {I}\), we have something else, denoted by \(\mathcal {I}^r\). One may call it a\(^r_W\): a wide scope indefinite to which one may refer to. We thus obtained that “land he created” – the relative clause together with the modified noun – is related to an independent sentence “he created a\(^r_W\) land”. In fact, it is a set of referents created by the indefinite a\(^r_W\) of that sentence.
Hence, speaking in database terms, relative clause is a join. Using a FraCaS example, the denotation of (3) may be regarded as a database join, of “A person has the right to live in Europe.” with “can travel freely within Europe” on subject. Such database join may be illustrated by a (bit contrived) paraphrase: “Some people have the right to live in Europe. Every one of them can travel freely within Europe.” That is, the relative clause is moved out into a separate sentence, with the trace filled with a (wide-scope) indefinite. The original sentence anaphorically refers to that indefinite. One can generalize: “It builds up muscles people thought didn’t exist.” to paraphrase as “People thought some muscles didn’t exists. It builds up them.”
This replacement of trace with the indefinite leads to a variety of analyses. Returning to (5), repeated below,
we obtain the denotation
where \(\mathcal {E}\textsf{Be}\) is an existence event (see [7]). This denotation is equivalent to \([\![\text {auditor who signed all the reports}]\!]\), which is equivalent to \([\![\text {a}^r_W \mathrm {\ auditor\ signed} \mathrm {\ all\ the\ reports}]\!]\). In other words, (5) is equivalent to, or mutually entails, “One particular auditor/the same auditor signed all the reports” – which is what FraCaS problem 196 is all about.
Similarly, we obtain that (6) is equivalent to “John and Bill own the same car”. For problem 308, we obtain (7) is equivalent to “Smith wrote to a representative every week.” on the wide-scope reading of the indefinite – with no entailment for the narrow-scope reading.
6 Negation in Relative Clauses
Negation calls for one more generalization of (24) and related denotations:
We calculate, for example
by unrolling definitions and applying the distributive laws of negation touched upon in Sect. 2.2. Comparing with
we easily see that the two sets are complementary. Likewise, “student who skipped no classes” is the complement of the set of students who skipped a class.
7 Related Work, Discussion and Conclusions
Semantic and syntactic analyses are often tightly coupled: e.g., lexical entries are assigned syntactic categories or features, as well as semantic interpretations (often as lambda-terms). Examples include various categorial-grammar–based analyses (see [8] for the latest example), minimalist grammars ([12] for the latest), etc. As a result, semantic analysis is coupled to a particular parsing technique. In contrast, we, like Butler’s Treebank semantics [1], start with an already parsed sentence: to be precise, Penn-treebank–like annotated tree (see [2] for details on annotations). The annotations can be assigned manually or by any appropriate parser (e.g., Stanford CoreNLP [1]). Starting from an annotated sentence is also common in dependency-tree–based approaches, see [11]. (Our approach can also be adapted to dependency trees).
Closest to our work is the dependency-tree semantics of Tian et al. [11], who also represent the meaning of a sentence as an abstract query. The paper [11] briefly mentions relative clauses, analyzed along the lines of (21). Our and dependency-tree semantics diverge when it comes to quantification and coordination: we depart relational algebra for polyconcepts, expressing grouping and choice.
Analyses of relative clauses in event semantics are rare. One of the few is the relatively recent [12, §4.2.1 and §6], which uses Minimalist Grammar coupled with a continuation-based approach (in the spirit of [3]).
As a nod to the tradition, Sect. 2 mentioned thematic functions \(\mathinner {\mathop {\textsf{ag}}}\) and \(\mathinner {\mathop {\textsf{th}}}\) when defining the \(\mathinner {\mathop {\mathsf {subj'}}}\) and \(\mathinner {\mathop {\mathsf {ob1'}}}\) relations. These relations are meant to be grammatical subject and object relations, with \(\mathinner {\mathop {\textsf{ag}}}\) specifying the grammatical subject of an action carried by a verb, rather than the semantic agent. After all, event semantics is widely praised for avoiding meaning postulates as far as possible and deriving entailments from the structure alone. Likewise, the focus of FraCaS is textual entailment without relying on world knowledge. We, too, concentrate on the structure: Just as verbs have arguments, events – records in a world database – have attributes. The functions \(\mathinner {\mathop {\textsf{ag}}}\) and \(\mathinner {\mathop {\textsf{th}}}\), etc. merely refer to these attributes. As a consequence, we treat active and passive VP as completely separate, and do not consider entailments between active and passive forms of the same verb. In the future, we may introduce a postulate that, say, for any event \(e \in \mathinner {\mathop {\textsf{See}}}\) there exists an event \(e' \in \mathinner {\mathop {\textsf{BeSeen}}}\) such that \(\mathinner {\mathop {\textsf{ag}}}\!(e') = \mathinner {\mathop {\textsf{th}}}\!(e)\) and \(\mathinner {\mathop {\textsf{intstr}}}\!(e') = \mathinner {\mathop {\textsf{ag}}}\!(e)\). One may also deal with passive constructions syntactically: convert passive construction to active at parsing time (see Prithiviraj Damodaran’s Styleformer based on Stanford CoreNLP.)
In conclusion, we demonstrated handling of relative clauses in polynomial event semantics, from simple to coordinated and quantified. The approach handles the subject, object, locative, etc. relative clauses. Extension to tense/time is straightforward. Future work is the mechanical implementation of the approach to derive the entailments automatically.
Notes
- 1.
from Clifford Irving, The Valley (1961) – sentence 170 of susanne_N02 included in [2].
- 2.
The annotated form is https://oncoj.orinst.ox.ac.uk/cgi-bin/tspc.sh?tree=170_susanne_N02@21 &mode=clip.
References
Butler, A.: From discourse to logic with stanford CoreNLP and treebank semantics. In: Sakamoto, M., Okazaki, N., Mineshima, K., Satoh, K. (eds.) JSAI-isAI 2019. LNCS (LNAI), vol. 12331, pp. 182–196. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58790-1_12
Butler, A.: The treebank semantics parsed corpus (TSPC). https://entrees.github.io (2022)
Champollion, L.: The interaction of compositional semantics and event semantics. Linguist. Philos. 38(1), 31–66 (2015)
Cooper, R., et al.: Using the framework. Deliverable D16, FraCaS Project (1996)
Kiselyov, O.: Polynomial event semantics. In: Kojima, K., Sakamoto, M., Mineshima, K., Satoh, K. (eds.) JSAI-isAI 2018. LNCS (LNAI), vol. 11717, pp. 313–324. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31605-1_23
Kiselyov, O.: Polynomial event semantics: negation. In: Okazaki, N., Yada, K., Satoh, K., Mineshima, K. (eds.) JSAI-isAI 2020. LNCS (LNAI), vol. 12758, pp. 82–95. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79942-7_6
Kiselyov, O., Watanabe, H.: QNP textual entailment with polynomial event semantics. In: Yada, K., Takama, Y., Mineshima, K., Satoh, K. (eds.) JSAI-isAI 2021. LNCS (LNAI), vol. 13856, pp. 198–211. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-36190-6_14
Kubota, Y., Levine, R.D.: Type-Logical Syntax. The MIT Press, Cambridge, MA (2020)
MacCartney, B.: The FRACAS textual inference problem set. https://nlp.stanford.edu/~wcmac/downloads/fracas.xml
Maienborn, C.: Event semantics, chap. 8, pp. 232–266. Semantics - Theories, De Gruyter Mouton (2019). https://doi.org/10.1515/9783110589245-008
Tian, R., Miyao, Y., Matsuzaki, T.: Logical inference on dependency-based compositional semantics. In: ACL (1), pp. 79–89. The Association for Computer Linguistics (2014). http://aclweb.org/anthology/P/P14/
Tomita, Y.: Solving event quantification and free variable problems in semantics for minimalist grammars. In: Proceedings of the 30th Pacific Asia Conference on Language, Information and Computation, PACLIC 30: Oral Papers, pp. 219–227. ACL, Seoul, South Korea (2016), https://aclanthology.org/Y16-2020/
Acknowledgments
We are very grateful to the reviewers and the participants of LENLS19 for their insightful comments and questions. We particularly appreciate the interesting examples to analyze (Sect. 4) pointed out by a reviewer. This work was partially supported by a JSPS KAKENHI Grant Number 17K00091.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kiselyov, O., Watanabe, H. (2023). Events and Relative Clauses. In: Bekki, D., Mineshima, K., McCready, E. (eds) Logic and Engineering of Natural Language Semantics. LENLS 2022. Lecture Notes in Computer Science, vol 14213. Springer, Cham. https://doi.org/10.1007/978-3-031-43977-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-43977-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43976-6
Online ISBN: 978-3-031-43977-3
eBook Packages: Computer ScienceComputer Science (R0)