Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Linguistically motivated large-scale NLP with C&C and boxer
ACL '07 Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions
Semantic normalisation: a framework and an experiment
IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
Natural language inference
The PASCAL recognising textual entailment challenge
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
GrGen: a fast SPO-based graph rewriting tool
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.01 |
We present a system for recognising sentential entailment which combines logical inference with a semantic calculus producing "normalised semantic representations" using a cascade of rewriting systems. We start by presenting the core rewrite rules underlying our semantic calculus. We then focus on the detection of entailment relations between sentence pairs involving noun/verb alternations and we show that the system correctly predicts a range of interactions between basic noun/verb predications and semantic phenomena such as quantification, negation and non factive contexts.