Achieving expressive completeness and computational efficiency for underspecified scope representations

Abstract

In Fox and Lappin (2005a) we propose Property Theory with Curry Typing (PTCT) as a formal framework for the semantics of natural language. PTCT allows finegrained distinctions of meaning without recourse to modal notions like (im)possible worlds. It also supports a unified dynamic treatment of pronominal anaphora and VP ellipsis, as well as related phenomena such as gapping and pseudo-gapping.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations.Chris Fox & Shalom Lappin - unknown
Underspecified Interpretations in a Curry-Typed Representation Language.Chris Fox & Shalom Lappin - 2005 - Journal of Logic and Computation 15 (2):131--143.
Expressive Completeness and Computational Efficiency for Underspecified Representations.Chris Fox & Shalom Lappin - 2007 - In Lars Borin & Staffan Larsson (eds.), Festschrift for Robin Cooper.
Expressiveness and Complexity in Underspecified Semantics.Chris Fox & Shalom Lappin - 2010 - Linguistic Analysis 36:385--417.
An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics.Chris Fox & Shalom Lappin - 2004 - Logic Journal of the Interest Group in Pure and Applied Logics 12 (2):135--168.
Doing Natural Language Semantics in an Expressive First-Order Logic with Flexible Typing.Shalom Lappin & C. Fox - unknown
A Type-Theoretic Approach to Anaphora and Ellipsis Resolution.Shalom Lappin & C. Fox - unknown
Curry-Typed Semantics in Typed Predicate Logic.Chris Fox - 2014 - In Vit Puncochar (ed.), Logica Yearbook 2013. College Publications.
A Computational Treatment of Anaphora and Its Algorithmic Implementation.Jean-Philippe Bernardy, Stergios Chatzikyriakidis & Aleksandre Maskharashvili - 2020 - Journal of Logic, Language and Information 30 (1):1-29.
Implications of pseudo-gapping for binding and the representation of information structure* mark R. baltin.Mark Baltin - unknown

Analytics

Added to PP
2009-01-28

Downloads
24 (#155,087)

6 months
24 (#640,997)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references