Synthesizing context free grammars from sample strings based on inductive CYK algorithm

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

Volumn 1891, Issue , 2000, Pages 186-195

  Nakamura, Katsuhiko ^a   Ishiwata, Takashi ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b COM Software Co Ltd ^*  (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ENGINES; KNOWLEDGE ENGINEERING;

GRAMMATICAL INFERENCES; INCREMENTAL LEARNING; NEGATIVE SAMPLES; PRODUCTION RULES; UNAMBIGUOUS GRAMMAR;

CONTEXT FREE GRAMMARS;

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

References (7)

1. Balzer, Robert, An 8-State Minimal Time Solution to the Firing Squad Synchronization Problem, Information and Control 10 (1967) 22-42.
2. Bratko, Ivan, Refining Complete Hypothesis in ILP, Proceedings of 9th International Workshop ILP '99 (eds. S. Dzeroski and D. Flach), Springer-Verlag LNAI 1634 (1999) 44-55.
3. Floyd, R. W., Nondeterministic Algorithms, Jour. of ACM 14, No. 4 (1967) 636-644.
4. Hopcroft, John E. and Ullman, Jefirey E., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).
5. Parekh, Rajesh and Honavor, Vasant, An Incremental Interactive Algorithm for Regular Grammar Inference, Third International Colloquium, ICGI-96 (1996) 222-237.
6. Sakakibara, Yasubumi, Recent Advances of Grammatical Inference, Theoretical Computer Science 185, (1997) 15-45.
7. Sakakibara, Yasubumi and Kondo, Mitsuhiro, GA-Based Learning of Context-Free Grammars Using Tabular Representations, Proc. 16th International Conference of Machine Learning (1999) 354-360.