On the Inference of Context-Free Grammars Based On Bottom-Up Parsing and Search

We consider the problem of incremental learning of context-free grammars, using inductive CYK (Cocke-YoungerKasami) algorithm [4], based on the non-deterministic learning scheme proposed by Nakamura and Matsumoto in 2005 [1]. We implement their learning scheme deterministically and illustrate several examples in order to understand the incremental learning process efficiently. On the basis of this study we also point out some lines of research for possible enhancements.