CSE - Probabilistic Programming and Graph Grammars
We are developing a programming language called PERPL (https://github.com/diprism/perpl) that is probabilistic (programs compute a probability distribution over values instead of a single value) and compiles into graph grammars (like context-free grammars, but for graphs). The compiler can often change what appears to be an exponential-time algorithm into a polynomial-time algorithm. Specific topics will depend on the interests and background of the student..
Name of research group, project, or lab
NLP Group
Website
Representative publication