Simulating Feature Structures with Simple Types

no code implementations • NAACL (ACL) 2022 • Valentin D. Richard

Feature structures have been several times considered to enrich categorial grammars in order to build fine-grained grammars.

Embedding Intentional Semantic into Inquisitive Semantics

no code implementations • MoL (ACL) 2021 • Philippe de Groote, Valentin D. Richard

Introducing Proof Tree Automata and Proof Tree Graphs

no code implementations • 13 Jun 2022 • Valentin D. Richard

We introduce two novel tools to help working on calculi using the approach of graph theory and automata theory.

Keyboards as a new model of computation

no code implementations • 19 Feb 2021 • Yoan Géran, Bastien Laboureix, Corto Mascle, Valentin D. Richard

We consider a set of elementary operations (writing/erasing a letter, going to the right or to the left,...) and we define a keyboard as a set of finite sequences of such operations, called keys.

Introduction of Quantification in Frame Semantics

no code implementations • 25 Jan 2020 • Valentin D. Richard

Finally, we give a transcription to type-logical formulas to interact with the context in the view of dynamic semantics.

Attribute Sentence +1

Traduction des Grammaires Catégorielles de Lambek dans les Grammaires Catégorielles Abstraites

no code implementations • 23 Jan 2020 • Valentin D. Richard

Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types.