Learning context-free grammars from partially structured examples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1891, Issue , 2000, Pages 229-240

  Sakakibara, Yasubumi ^a   Muramatsu, Hidenori ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; GENETIC ALGORITHMS; INFERENCE ENGINES; LEARNING SYSTEMS;

LEARNING CONTEXT; LEARNING METHODS; PRODUCTION RULES; STRUCTURED EXAMPLE; TABULAR REPRESENTATIONS;

LEARNING ALGORITHMS;

EID: 84974705310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_19     Document Type: Conference Paper

References (7)

1. A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation and Compiling, Vol. I: Parsing. Prentice Hall, 1972.
2. P. Dupont. Regular grammatical inference from positive and negative samples by genetic search: the GIG method. Proceedings of Second International Colloquium on Grammatical Inference (ICGI-94) (LNAI 862, Springer-Verlag, 1994), 236-245.
3. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37, 1978, 302-320.
4. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996.
5. Y. Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 97, 1992, 23-60.
6. Y. Sakakibara. Recent advances of grammatical inference. Theoretical Computer Science, 185, 1997, 15-45.
7. Y. Sakakibara and M. Kondo. GA-based learning of context-free grammars using tabular representations. Proceedings of 16th International Conference on Machine Learning (ICML-99), Bled, Slovenia, 1999.