Non Compositional Semantics Using Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Chapitre D'ouvrage Année : 2011

Non Compositional Semantics Using Rewriting

Résumé

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 et versions

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

Identifiants

Citer

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 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More