Slides for some of my presentations
This project is maintained by RichardMoot
Slides for some selected presentations, some old, some new. As is usual, these slides serve as support for talks I have given on different occasions, and they have not really been designed as stand-alone reading material. However, feel free to contact me with any remarks or questions about these slides.
Graph rewriting as a universal proof theory for modern type-logical grammars, keynote talk at LACompLing2021.
Supergrover or reconciling vectors and proofs, invited talk at the WoLLIC 2019 workshop on compositionality in formal and distributional semantics. Discusses deep learning, supertagging and vector representations for words.
Proof theoretic aspects of hybrid type-logical grammars, joint work with Symon-Jory Stevens Guile investigating the proof theoretic foundations of hybrid type-logical grammars, notably introducing proof nets for the calculus. Contributed talk at the FG 2019 conference.
First-order linear logic for natural language analysis, invited talk at the workshop on Logic and Algorithms for Computational Linguistics in Stockholm, 2017, about first-order linear logic as a general framework for language modelling and parsing.
Wide coverage semantics, talk in Düsseldorf about wide-coverage semantics using type-logical grammars, one of the first presentations of Grail Light with the deep learning component (DeepGrail); also has some discussion about the difference between type-logical grammars and combinatory categorial grammars.
Towards a computational analysis of debates, invited talk at the NASSLLI 2016 workshop on compositionality in semantics, talking about theories of meaning, wide-coverage semantics and the computational analysis of debates in the context of the AREN project.
Extending lambda grammars, invited talk at the Ohio State University in 2016, about lambda grammars, their extensions (including hybrid type-logical grammars and first-order linear logic), and descriptive adequacy.
Semantics and computability, talk at the 2016 Computability in Europe conference about computability and natural language semantics (join work with Christian Retoré).
Logic and topology, and older talk about logic and topology in the context of the Itipy project, talking notably the logic S4u (the modal logic S4 with a universal modality, denoting true in all worlds).