Learning context-free grammars using tabular representations

Pattern Recognition

Volumn 38, Issue 9, 2005, Pages 1372-1383

  Sakakibara, Yasubumi ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Context free grammar; Dynamic programming; Genetic algorithm; Grammatical inference; Structured example

Indexed keywords

DATA STRUCTURES; DYNAMIC PROGRAMMING; FINITE AUTOMATA; GENETIC ALGORITHMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; SET THEORY; TOPOLOGY;

COCKE-YOUNGER-KASAMI ALGORITHM; GRAMMATICAL INFERENCE; PARSE TABLE; STRUCTURED EXAMPLE;

CONTEXT FREE GRAMMARS;

EID: 19944376889     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2004.03.021     Document Type: Article

References (16)

1. Y. Sakakibara Recent advances of grammatical inference Theoret. Computer Sci. 185 1997 15 45
2. E.M. Gold Complexity of automaton identification from given data Inform. Control 37 1978 302 320
3. D. Angluin On the complexity of minimum inference of regular sets Inform. Control 39 1978 337 350
4. D. Angluin Inference of reversible languages J. ACM 29 1982 741 765
5. P. Dupont, Regular grammatical inference from positive and negative samples by genetic search: the GIG method, in: Proceedings of Second International Colloquium on Grammatical Inference (ICGI-94), Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, 1994, pp. 236-245.
6. D. Angluin A note on the number of queries needed to identify regular languages Inform. Control 51 1981 76 87
7. Y. Sakakibara Efficient learning of context-free grammars from positive structural examples Inform. Comput. 97 1992 23 60
8. A.V. Aho, J.D. Ullman, The Theory of Parsing, Translation and Compiling, vol. I: Parsing, Prentice-Hall, Englewood Cliffs, NJ, 1972.
9. Z. Michalewicz Genetic Algorithms + Data Structures = Evolution Programs 1996 Springer Berlin
10. G. von Laszewski, Intelligent structural operators for the k -way graph partitioning problem, in: Proceedings of Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1991, pp. 45-52.
11. P. Dupont, L. Miclet, E. Vidal, What is the search space of the regular inference?, in: Proceedings of Second International Colloquium on Grammatical Inference (ICGI-94), Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, 1994, pp. 26-37.
12. Y. Sakakibara Learning context-free grammars from structural data in polynomial time Theoret. Computer Sci. 76 1990 223 242
13. K. Nakamura, T. Ishiwata, Synthesizing context free grammars from sample strings based on inductive CYK algorithm, in: Proceedings of the Fifth International Colloquium on Grammatical Inference (ICGI-2000), Lecture Notes Artificial Intelligence, vol. 1891, Springer, Berlin, 2000, pp. 186-195.
14. K. Nakamura, M. Matsuno, Incremental learning of context-free grammars, in: Proceedings of Sixth International Colloquium on Grammatical Inference (ICGI-2002), Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, 2002, pp. 174-184.
15. Y. Sakakibara, M. Kondo, GA-based learning of context-free grammars using tabular representations, in: Proceedings of 16th International Conference on Machine Learning (ICML-99), Morgan-Kaufmann, Los Altos, CA, 1999, pp. 354-360.
16. Y. Sakakibara, H. Muramatsu, Context-free grammars from partially structured examples, in: Proceedings of Fifth International Colloquium on Grammatical Inference (ICGI-2000), Lecture Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, 2000, pp. 229-240.