Abstract

In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.

Highlights

  • 2.1 Higher-Order Logic with Sorts and 6 TypesIn this paper we interpret natural language phrases as logical formulas

  • A question that might arise is: why did we not use the FraCaS suite, which provides a section on anaphora with 27 examples? The answer is multi-fold: 1. FraCaS assumes a fully-fledged inference engine

  • In this paper we only propose a method to generate formulas

Read more

Summary

B Stergios Chatzikyriakidis

Anaphora is a vast topic that has been exploited and discussed from the point of view of different formal semantics systems, each focusing on different phenomena Cooper (1979); Evans (1980); Roberts (1989, 1990); Groenendijk and Stokhof (1991); Poesio and Zucchi (1992). We find that our treatment of E-type pronouns and Bach–Peters sentences is a novel one, and as such can be considered a contribution to formal semantics in their own right. Acknowledging this fact, we concentrate the discussion in this paper on the elements which build up to our accounts for these phenomena, and we direct the reader to the long version of this paper (Bernardy et al 2020) for an even broader discussion of supported phenomena.

Higher-Order Logic with Sorts and 6 Types
Monads
Do-notation
Generalized Effectful Semantics for Anaphora
Structure of the Environment and Basic Anaphoric Cases
Refinement
Strict and Sloppy Anaphora
Anaphoric Scope Flexibility
Scoping with Universal Quantifiers
CN Scoping
Scoping with Existential Quantifiers
Prototypical Donkey Sentence
E-type Pronouns
Scope Extension Algorithm
Cataphora
Bach–Peters Sentences
Implementation
Dynamic Semantics
Evaluation
Related Work
A scope-extension mechanism

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.