This week Matthew Hayden will be giving us an introduction to control grammars. Intuitively, a control grammar is a grammar whose possible paths of derivation are constrained by some set of strings, called the control language. Matthew will go over the basics of control grammars, discuss their expressibility, and compare …
For the first session, Kenneth will be talking about mixed-relation TSL.
String TSL involves relativizing the precedence relation to a tier of salient elements. For trees, there are more choices: we can relativize dominance and precedence (Graf 2022) as well as derived relations such as d-command (Graf and Shafiei 2019 …
For the first session, Anton will be revisiting Jeff's session on equational learning from last semester.
Jeff pointed out two challenges with this new approach to learning transductions:
finding a method to identify characteristic samples which is independent of the class of transductions to be learned
finding a computationally tractable …