Non Compositional Semantics Using Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2011

Non Compositional Semantics Using Rewriting


We present a system for recognising sentential entailment which combines logical inference with a semantic calculus producing ''normalised semantic representations'' using a cascade of rewrite rule 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.

Dates and versions

hal-00639843 , version 1 (10-11-2011)



Paul Bedaride, Claire Gardent. Non Compositional Semantics Using Rewriting. Zygmunt Vetulani. Human Language Technology. Challenges for Computer Science and Linguistics, 6562, Springer Verlag, pp.257-267, 2011, Lecture Notes in Computer Science, 978-3-642-20094-6. ⟨10.1007/978-3-642-20095-3_24⟩. ⟨hal-00639843⟩
69 View
0 Download



Gmail Facebook X LinkedIn More