Non Compositional Semantics Using Rewriting

Paul Bedaride 1 Claire Gardent 1
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Chapitre d'ouvrage
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〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00639843
Contributeur : Claire Gardent <>
Soumis le : jeudi 10 novembre 2011 - 09:38:57
Dernière modification le : jeudi 11 janvier 2018 - 06:21:35

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

151