Left Aligned Grammars - Identifying a class of Context-free Grammar in the limit from Positive Data

This paper introduces a class of context-free grammar known as left-aligned grammars, and an algorithm for inferring left-aligned grammars from unlabelled positive examples. The paper includes a proof sketch that the algorithm can identify any given left-aligned grammar in the limit using only unlabelled positive examples from that grammar. Given any set of example sentences, a left-aligned grammar exists that generates those sentences.