eg-GRIDS: Context-free grammatical inference from positive examples using genetic search

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3264, Issue , 2004, Pages 223-234

  Petasis, Georgios ^a   Paliouras, Georgios ^a   Spyropoulos, Constantine D ^a   Halatsis, Constantine ^b  

^a INSTITUTE OF INFORMATICS AND TELECOMMUNICATIONS   (Greece)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Context free grammars; Genetic algorithms; Grammatical inference; Minimum description length; Positive examples

Indexed keywords

COMPUTATIONAL METHODS; ENCODING (SYMBOLS); INFORMATION RETRIEVAL SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBABILITY; ALGORITHMS; COMPUTATIONAL GRAMMARS; CONTEXT FREE GRAMMARS; GENETIC ALGORITHMS;

CONTEXT-FREE GRAMMARS; GENETIC SEARCH; GRAMMATICAL INFERENCE; MINIMUM DESCRIPTION LENGTH; POSITIVE EXAMPLES; BEAM SEARCH; CONTEXT-FREE; EVALUATION RESULTS; GRAMMATICAL INFERENCES; SEARCH SPACES;

GENETIC ALGORITHMS; INFERENCE ENGINES;

EID: 22944455207     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30195-0_20     Document Type: Conference Paper

References (20)

1. D. Angluin, "Inference of reversible languages", Journal of ACM, vol. 29, pp. 741-765, 1982.
2. J. D. Emerald, K. G. Subramanian, D. G. Thomas, "Learning Code regular and Code linear languages", Proceedings of International Colloquium on Grammatical Inference (ICGI-96), Lecture Notes in Artificial Intelligence 1147, Springer - Verlag, pp. 211-221, 1996.
3. P. García, E. Vidal, "Inference of K-testable languages in the strict sense and applications to syntactic pattern recognition", Journal of IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12(9), pp. 920-925, 1990.
4. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation. Addison - Wesley, 1979.
5. T. Koshiba, E. Makinen, Y. Takada, "Inferring pure context-free languages from positive data", Technical report A-1997-14, Department of Computer Science, University of Tampere, 1997.
6. P. Langley, S. Stromsten, "Learning Context-Free Grammars with a Simplicity Bias", Proceedings of the Eleventh European Conference on Machine Learning (ECML 2000), Lecture Notes in Artificial Intelligence 1810, Springer - Verlag, pp. 220-228, Barcelona, Spain, 2000.
7. F. Mäkinen, "On the structural grammatical inference problem for some classes of context-free grammars", Information Processing Letters, 42, pp. 193-199, 1992.
8. K. Nakamura, T. Ishiwata, "Synthesizing Context Free Grammars from Simple Strings Based on Inductive CYK Algorithm", Proceedings of the Fifth International Colloquium on Grammatical Inference (ICGI 2000), Grammatical Inference: Algorithms and Applications, Oliveira A. (ed.), Portugal, 2000. Springer.
9. R. Parekh, V. Honavar, "Grammar Inference, Automata Induction, and Language Acquisition", R. Dale, H. Moisi, and H. Somers (eds.), Handbook of Natural Language Processing, chapter 29, pp. 727-764, Marcel Dekker Inc., 2000.
10. G. Petasis, G. Paliouras, V. Karkaletsis, C. Halatsis and C.D. Spyropoulos, "e-GRIDS: Computationally Efficient Grammatical Inference from Positive Examples," Grammars, Special Issue, 2004. Available from http://217.125.102.104/special4.asp.
11. J. Rissanen, Stochastic Complexity in Statistical Inquiry, World Scientific Publishing Co, Singapore, 1989.
12. H. Rulot, E. Vidal, "Modelling (sub)string-length-based constraints through grammatical inference methods", Devijer and Kittler (eds.), Springer - Verlag, 1987.
13. Y. Sakakibara, "Efficient learning of context-free grammars from positive structural examples", Information and Computation, 97, pp. 23-60, 1992.
14. Y. Sakakibara, H. Muramatsu, "Learning Context-Free Grammars from Partially Structured Examples", Proceedings of the Fifth International Colloquium on Grammatical Inference (ICGI 2000), Grammatical Inference: Algorithms and Applications, Oliveira A. (ed.), Portugal, 2000. Springer.
15. A. Stolcke, "Bayesian Learning of Probabilistic Language Models", PhD Thesis, University of California at Berkley, 1994.
16. A. Stolcke, S. Omohundro, "Inducing Probabilistic Grammars by Bayesian Model Merging", Proceedings of International Colloquium on Grammatical Inference (ICGI-94), Lecture Notes in Artificial Intelligence 862, Springer - Verlag, pp. 106-118, 1994.
17. N. Tanida, T. Yokomori, "Inductive Inference of Monogenic Pure Context-free languages", Lecture Notes in Artificial Intelligence 872, Springer - Verlag, pp. 560-573, 1994.
18. G. Wolff, "Grammar Discovery as data compression", Proceedings of the AISB/GI Conference on Artificial Intelligence, pp. 375-379, Hamburg, West Germany, 1978.
19. G. Wolff, "Language Acquisition, Data Compression and Generalisation", Language and Communication, 2, pp. 57-89, 1982.
20. T. Yokomori, "On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata", Journal of Machine Learning, vol. 19, pp. 153-179, 1995.