The subject of the lecture was beyond my competence. After the first five minutes I was completely lost. At the end of the lecture an arcane dialogue took place between the speaker and some members of the audience—Ambrose and Singer if I remember correctly. There followed a period of tense silence. Professor Struik broke the ice. He raised his hand and said, ``Give us something to take home!’’ Calabi obliged, and in the next five minutes he explained in beautiful simple terms the gist of his lecture. Everybody filed out with a feeling of satisfaction.

—Gian-Carlo Rota

Tutorial on Probabilistic Graph Formalisms

I helped Sorcha Gilroy teach a tutorial on graph grammars and automata, and their interaction with probability:

  • Materials from our week-long tutorial at NASSLLI 2018.
  • Materials from our half-day tutorial at EMNLP 2018.

Sorcha’s excellent PhD thesis presents this tutorial material and much more, with extensive narration and explanation of the many examples, alongside several novel proofs. I recommend her thesis to anyone in NLP who wants to learn about probabilistic generative models of graphs.

Courses at the University of Edinburgh

I am on leave from the University and no longer teaching

Courses at Johns Hopkins University