This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...