Encoding Generalized Quantifiers in Dependency based Compositional Semantics
For textual entailment recognition systems, it is often important to correctly handle Generalized quantifiers (GQ) In this paper, we explore ways of encoding GQs in a recent framework of Dependency based Compositional Semantics, especially aiming to correctly handle linguistic knowledge like hyponymy when GQs are involved. We use both the selection operator mechanism and a new relation extension to implement some major properties of GQs, reducing 69% errors of a previous system, and a further error analysis suggests extensions towards more powerful logical systems.
PACLIC