论文信息 - On the Inference of Context-Free Grammars Based On Bottom-Up Parsing and Search

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.

[1] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.

[2] J. C. Martin,et al. Introduction to Languages and the Theory of Computation" 3rd Ed , 1991 .

[3] Katsuhiko Nakamura,et al. Incremental learning of context free grammars based on bottom-up parsing and search , 2005, Pattern Recognit..

[4] Leonard Pitt,et al. The minimum consistent DFA problem cannot be approximated within any polynomial , 1993, JACM.

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Yasubumi Sakakibara,et al. Learning Context-Free Grammars from Partially Structured Examples , 2000, ICGI.

[7] Katsuhiko Nakamura,et al. Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm , 2000, ICGI.

[8] Gend Lal Prajapati,et al. Efficient Incremental Model for Learning Context-Free Grammars from Positive Structural Examples , 2008, SETN.

[9] Yasubumi Sakakibara,et al. GA-based Learning of Context-Free Grammars using Tabular Representations , 1999, International Conference on Machine Learning.

[10] Rajesh Parekh,et al. An Incremental Interactive Algorithm for Regular Grammar Inference , 1996, AAAI/IAAI, Vol. 2.