Abstract
This paper describes inductive inference for synthesizing context free grammars from positive and negative sample strings, implemented in Synapse system. For effective inference of grammars, Synapse employs the following mechanisms.
-
1.
A rule generating method called “inductive CYK algorithm,” which generates minimum production rules required for parsing positive samples.
-
2.
Incremental learning for adding newly generated rules to previously obtained rules.
Synapse can synthesize both ambiguous grammars and unambiguous grammars. Experimental results show recent improvement of Synapse system to synthesize context free grammars.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. E. Hopcroft, and J. E. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).
P. Langley and S. Stromsten, Learning Context-Free Grammars with a Simplicity Bias, Machine Learning: ECML 2000, LNAI1810, Springer-Verlag, 220–228(2000).
K. Nakamura, and Y. Ishiwata, Synthesizing context free grammars from sample strings based on inductive CYK algorithm, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 186–195 (2000).
R. Parekh, and V. Honavor, An incremental interactive algorithm for regular grammar inference, Third International Colloquium on Grammatical Inference (ICGI-96), 222–237 (1996).
Y. Sakakibara, Recent advances of grammatical inference, Theoretical Computer Science, 185, 15–45(1997).
Y. Sakakibara, and M. Kondo, GA-based learning of context-free grammars using tabular representations, Proc. 16th International Conference of Machine Learning, 354–360 (1999).
Y. Sakakibara, and H. Muramatsu, Learning of context-free grammars partially structured examples, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 229–240 (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, K., Matsumoto, M. (2002). Incremental Learning of Context Free Grammars. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-45790-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44239-4
Online ISBN: 978-3-540-45790-9
eBook Packages: Springer Book Archive