Meeting of the European Chapter of the Association of Computational Linguistics, pp. 195-202, April 2003

We define a back-and-forth translation between Hole Semantics and
dominance constraints, two formalisms used in underspecified
semantics. There are fundamental differences between the two, but we
show that they disappear on practically useful descriptions. Our
encoding bridges a gap between two underspecification formalisms, and
speeds up the processing of Hole Semantics.