Context Free Languages

We apply a complexity theoretic notion of feasible learnability called "polynomial learnabillty" to the eval- uation of grammatical formalisms for linguistic descrip- tion. We show that a novel, nontriviai constraint …...

We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Lan- guages. The LR parsing strategy for Context Free Grammars is extended …...

In Optimality-Theoretic Syntax, optimiza- tion with unrestricted expressive power on the side of the OT constraints is unde- cidable. This paper provides a proof for the decidability of optimization based …...