Representing Anaphora with Dependent Types

Factivity and presupposition in Dependent Type Semantics

“…Dependent Type Semantics (Bekki 2014) provides such a procedure. To give an explicit compositional mapping from sentences to semantic representations, we adopt Combinatory Categorial Grammar (CCG, Steedman 2000) as a syntactic framework.…”

“…To give an explicit compositional mapping from sentences to semantic representations, we adopt Combinatory Categorial Grammar (CCG, Steedman 2000) as a syntactic framework. Note that, as emphasized in Bekki (2014), DTS can be combined with other categorial grammars; see Kubota and Levine (2017) for a concrete proposal that combines DTS with a type-logical grammar. In compositional mapping, an anaphoric expression is mapped on to an underspecified element.…”

“…More specifically, the process of anaphora/presupposition resolution is defined as follows (Bekki 2014 …”

Paychecks, Presupposition, and Dependent Types

“…DTS has been developed as an alternative framework to model-theoretic dynamic semantics such as DRT (Kamp and Reyle, 1993) and DPL (Groenendijk and Stokhof, 1991), providing a compositional account of anaphora and presupposition from a proof-theoretic perspective. In particular, DTS provides a unified analysis of various uses of pronouns, including coreference, bound variable anaphora, E-type anaphora, and donkey anaphora (Bekki, 2014;Bekki and Mineshima, 2017). The goal of the paper is to extend this analysis to paycheck sentences such as (1) and to show that it gives an adequate analysis of paycheck pronouns without introducing any special machinery for handling them.…”

“…For instance, the notion of accessibility is obtained for free from the structure of dependent types Σ and Π (cf. Bekki, 2014). Agreement on pronouns, such as gender, person, and number agreement, can be also accounted for by annotating the underspecified term with more fine-grained types, as in the case of presupposition (Tanaka et al, 2017a).…”