Ограничения доминирования

Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify the natural fragment of …...

We define a back-and-forth translation between Hole Semantics and dominance constraints, two formalisms used in un- derspecified semantics. There are funda- mental differences between the two, but we show that …...