Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations

The tension between expressive power and computational tractability poses an acute problem for theories of underspecified semantic representation. In previous work we have presented an account of underspecified scope representations within Property Theory with Curry Typing, an intensional first-order theory for natural language semantics. Here we show how filters applied to the underspecified-scope terms of PTCT permit both expressive completeness and the reduction of computational complexity in a significant class of non-worst case scenarios
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,495
External links

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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
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.
Finite H-Dimension Does Not Imply Expressive Completeness.Ian Hodkinson - 1994 - Journal of Philosophical Logic 23 (5):535 - 573.
Ways of Scope Taking.Anna Szabolcsi (ed.) - 1997 - Kluwer Academic Publishers.
Added to PP index

Total downloads
20 ( #265,816 of 2,210,574 )

Recent downloads (6 months)
1 ( #356,847 of 2,210,574 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature