In the rest of this lecture, we will explore algorithms that do not enumerate all readings from a syntactic analysis, but instead derive just one, underspecified description of them all. It will still be possible to efficiently extract all readings from the description, but we want to delay this enumeration step for as long as possible. At the same time, the description itself will be very compact (not much bigger than one single reading), and we will be able to compute a description from a syntactic analysis efficiently.