- DGfS Fall School: In September 2019 I'll be teaching a course called Syntactic Structures Can't Be Just Anything in the Fall School in Computational Linguistics of the German Linguistic Society (DGfS)
- Keynote address: On May 3, 2019 I'll participate in UU's Annual Symposium Connecting Mathematical Methods across Utrecht University with a talk called What makes a language a human language? Mathematical perspectives on Universal Grammar
- Assistant professorship at Universiteit Utrecht: February 1, 2019 I began a job as a universitair docent at UU in the Netherlands. I'm teaching in the AI program and belong to the linguistics department.
- ACL Paper: Our paper on semantic graph parsing was presented at ACL 2018 (slides). The paper is AMR dependency parsing with a typed semantic algebra by Jonas Groschwitz, Matthias Lindemann, me, Mark Johnson and Alexander Koller.
- Oslo workshop on universal dependency parsing: March 19-22 I attended a workshop at the Oslo Center for Advanced Study (CAS) to discuss semantic enhancements for Univeral Dependencies. We ( Jonas Groschwitz, Alexander Koller, and I) presented our AM-algebra and its dependency parser for AMRs, and met a bunch of interesting researchers.
- IWCS Paper: On Sept 20, 2017, Jonas Groschwitz presented joint work with me, Alexander Koller, and Marc Johnson at IWCS on a constrainted algebra for AMRs. AMRs can be decomposed with an s-graph algebra such as the HR algebra of Courcelle, but, for example, a graph with 5 nodes has an average of 1017 different ways it could be built. The HR algebra therefore needs to be constrained to make it useable. Previous work constrains it in an ad-hoc manner; our Apply-Modify Algebra uses well-understood principles of semantic composition to constrain it in a way that keeps the linguistically reasonable derivations. The Apply-Modify algebra finds an average of only 21 terms for a 5-node graph.
- Degree awarded: Sept 15, 2017: I have a PhD!
- TAG+ Paper and presentation: On Sept 4, 2017 I presented a joint paper with Alexander Koller at TAG+13 on Minimalist parsing. We show how an MG can be encoded into an Interpreted Regular Tree Grammar, and use the encoding to show that the parsing complexity is much lower than previously thought, at O(n2|lic|+32|lic|)
- In 2007 I spoke at my first conference, an undergraduate
conference called McGill's Canadian Conference for Linguistics
Undergrads (McCCLU I). Michelle St Amour and I edited the
proceedings, which seem to have disappeared off the web, so I'll put
them here: McCCLU I
Inspiration for this page design was taken in part from this lovely site: http://www.mpi-sws.org/~cristian/
article on smartphone nomenclature that I gave an interview for
in fall 2014
- I'm working on a project on birdsong with
biologist Charles Taylor, linguist Ed Stabler, and neuroscientist Floris van Vugt. We believe some
birds, like the California Thrasher, must use a complex, even
human-like grammar to produce their songs. I'm working primarily as a programmer to help show this must be the case.