Computer Science Colloquium, 2005-2006

Shalom Lappin Department of Philosophy, King's College London
May 10th, 2006
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 (PTCT), 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.

Joint work with Chris Fox.

Shuly Wintner
Last modified: Tue Apr 25 20:38:39 IDT 2006