A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
Faizan Javed, Marjan Mernik, Barrett R. Bryant, Al...