My main area of research deals with the use of tabulation techniques in Computational Linguistics and Logic Programming, relying on the notions of Push-Down Automata and Dynamic Programming. I wish to show that many linguistic formalisms may benefit from well defined and understood tabulation mechanisms, for instance in the case of Tree Adjoining Grammars (TAG), and, more generally, of Midly Context Sensitive (MCS) formalisms using Thread Automata. This work is completed by the development of system DyALog.

Since 2003, I became more and more interested by the notion of Meta-Grammar that provides an abstract layer of syntactic description based on hierachies of classes grouping elementary constraints and providing/requiring resources. These classes may be ``compiled'' to get a grammar, in some target formalism, such as TAGs or LFGs. This interest has led to the development of a MG compiler MGCOMP and of FRMG, a French MG that uses factorization operators provided by DyALog to produce a very compact TAG. New More information about FRMG may be found on FRMG Wiki.