10 code implementations • Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024) 2024 • Maximos Skandalis, Richard Moot, Christian Retoré, Simon Robillard

DACCORD consists of 1034 pairs of sentences and is the first dataset exclusively dedicated to this task and covering among others the topic of the Russian invasion in Ukraine.

2 code implementations • Actes de 18e Conférence en Recherche d'Information et Applications (CORIA) - 30e Conférence sur le Traitement Automatique des Langues Naturelles (TALN), Paris, France 2023 • Maximos Skandalis, Richard Moot, Simon Robillard

In this article, we present DACCORD, a new dataset dedicated to the task of automatically detecting contradictions between sentences in French.

1 code implementation • 23 Feb 2023 • Konstantinos Kogkalidis, Michael Moortgat, Richard Moot

This paper describes SPINDLE - an open source Python module implementing an efficient and accurate parser for written Dutch that transforms raw text input to programs for meaning composition, expressed as {\lambda} terms.

no code implementations • 8 Nov 2022 • Richard Moot

Vertex labelling is a well-studied task in graph neural networks, and different ways of implementing graph generation using neural networks will be explored.

no code implementations • 23 Oct 2020 • Richard Moot

We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019).

1 code implementation • CONLL 2020 • Konstantinos Kogkalidis, Michael Moortgat, Richard Moot

Linear logic and the linear {\lambda}-calculus have a long standing tradition in the study of natural language form and meaning.

no code implementations • 22 Sep 2020 • Richard Moot, Symon Stevens-Guille

This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars.

no code implementations • 17 Aug 2020 • Davide Catta, Richard Moot, Christian Retoré

In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity.

no code implementations • 14 Aug 2020 • Richard Moot

We will investigate proof-theoretic and linguistic aspects of first-order linear logic.

no code implementations • LREC 2020 • Konstantinos Kogkalidis, Michael Moortgat, Richard Moot

{\AE}THEL{'}s types and derivations are obtained by means of an extraction algorithm applied to the syntactic analyses of LASSY Small, the gold standard corpus of written Dutch.

1 code implementation • 29 Dec 2019 • Konstantinos Kogkalidis, Michael Moortgat, Richard Moot

{\AE}THEL's types and derivations are obtained by means of an extraction algorithm applied to the syntactic analyses of LASSY Small, the gold standard corpus of written Dutch.

no code implementations • 6 Apr 2018 • Richard Moot

The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French.

no code implementations • 6 Jun 2016 • Richard Moot

We present a proof net calculus for the Displacement calculus and show its correctness.

no code implementations • 13 May 2016 • Richard Moot, Christian Retoré

This paper is a reflexion on the computability of natural language semantics.

1 code implementation • 2 Feb 2016 • Richard Moot

As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory.

no code implementations • 18 Jun 2015 • Richard Moot

Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic.

no code implementations • 26 May 2014 • Richard Moot

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic.

no code implementations • 3 Jan 2014 • Bruno Mery, Richard Moot, Christian Retoré

We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning, transfers, (in)felicitous co-predication.

no code implementations • 27 May 2013 • Richard Moot

First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus.

no code implementations • JEPTALNRECITAL 2012 • Ana{\"\i}s Lefeuvre, Richard Moot, Christian Retor{\'e}, S, No{\'e}mie-Fleur illon-Rezer

Cannot find the paper you are looking for? You can
Submit a new open access paper.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.