David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
In this paper we address an important issue in the development of an adequate formal theory of underspeciﬁed semantics. The tension between expressive power and computational tractability poses an acute problem for any such theory. Generating the full set of resolved scope readings from an underspeciﬁed representation produces a combinatorial explosion that undermines the eﬃciency of these representations. Moreover, Ebert (2005) shows that most current theories of underspeciﬁed semantic representation suﬀer from expressive incompleteness. In previous work we present an account of underspeciﬁed scope representations within Property Theory with Curry Typing (PTCT), an intensional ﬁrst-order theory for natural language semantics. We review this account, and we show that ﬁlters applied to the underspeciﬁed-scope terms of PTCT permit expressive completeness. While they do not solve the general complexity problem, they do signiﬁcantly reduce the search space for computing the full set of resolved scope readings in non-worst cases. We explore the role of ﬁlters in achieving expressive completeness, and their relationship to the complexity involved in producing full interpretations from underspeciﬁed representations.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
Chris Fox & Shalom Lappin (forthcoming). Type-Theoretic Logic with an Operational Account of Intensionality. Synthese:1-22.
Similar books and articles
Chris Fox & Shalom Lappin, Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations.
Shalom Lappin, Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations.
Chris Fox & Shalom Lappin, Doing Natural Language Semantics in an Expressive First-Order Logic with Flexible Typing.
Chris Fox & Shalom Lappin, An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics.
Chris Fox (2005). Foundations of Intensional Semantics. Blackwell Pub..
Chris Fox, Shalom Lappin & Carl Pollard, First-Order, Curry-Typed Logic for Natural Language Semantics.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Shalom Lappin & C. Fox, Doing Natural Language Semantics in an Expressive First-Order Logic with Flexible Typing.
Keith Stenning & Oliver Lemon (1999). Aligning Logical and Psychological Perspectives on Diagrammatic Reasoning. .
Zhaohui Luo (2012). Formal Semantics in Modern Type Theories with Coercive Subtyping. Linguistics and Philosophy 35 (6):491-513.
Added to index2010-12-22
Total downloads5 ( #209,062 of 1,096,179 )
Recent downloads (6 months)2 ( #126,669 of 1,096,179 )
How can I increase my downloads?