Representing languages by learnable rewriting systems

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

Volumn 3264, Issue , 2004, Pages 139-150

  Eyraud, Rémi ^a   De La Higuera, Colin ^a   Janodet, Jean Christophe ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Learning Context Free Languages; Rewriting Systems

Indexed keywords

FORMAL LANGUAGES; LEARNING ALGORITHMS; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; INFERENCE ENGINES; POLYNOMIAL APPROXIMATION;

CONTEXT-FREE GRAMMARS; GRAMMATICAL INFERENCE; LEARNING CONTEXT-FREE LANGUAGES; REWRITING SYSTEMS; GRAMMATICAL INFERENCES; LARGE AMOUNTS; LEARNABILITY; NON-TRIVIAL; PARENTHESIS LANGUAGES; POLYNOMIAL-TIME;

NATURAL LANGUAGE PROCESSING SYSTEMS; CONTEXT FREE LANGUAGES;

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

References (20)

1. R. Book and P. Otto. String-Rewriting Systems. Springer-Verlag, 1993.
2. C. de la Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning Journal, 27:125-138, 1997.
3. N. Dershowitz and J. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Formal Methods and Semantics, volume B, chapter 6, pages 243-320. North Holland, Amsterdam, 1990.
4. P. Dupont. Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In R. C. Carrasco and J. Oncina, editors, Grammatical Inference and Applications, Proceedings of ICGI '94, number 862 in LNAI, pages 236-245, Berlin, Heidelberg, 1994. Springer-Verlag.
5. M. Frazier and C.D. Page Jr. Prefix grammars: An alternative characterisation of the regular languages. Information Processing Letters, 51(2):67-71, 1994.
6. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
7. J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-112. Oxford University Press, 1992.
8. T. Koshiba, E. Mäkinen, and Y. Takada. Inferring pure context-free languages from positive data. Acta Cybernetica, 14(3):469-477, 2000.
9. K. Lang, B. A. Pearlmutter, and R. A. Price. The Abbadingo one DFA learning competition. In Proceedings of ICGI'98, pages 1-12, 1998.
10. S. Lee. Learning of context-free languages: A survey of the literature. Technical Report TR-12-96, Center for Research in Computing Technology, Harvard University, Cambridge, Massachusetts, 1996.
11. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal of the. Association for Computing Machinery, 35(2):324-344, 1988.
12. K. Nakamura and M. Matsumoto. Incremental learning of context-free grammars. In P. Adriaans, H. Fernau, and M. van Zaannen, editors, Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '02, volume 2484 of LNAI, pages 174-184, Berlin, Heidelberg, 2002. Springer-Verlag.
13. C. Nevill-Manning and I. Witten. Identifying hierarchical structure in sequences: a linear-time algorithm. Journal of Artificial Intelligence Research, 7:67-82, 1997.
14. M. Nivat. On some families of languages related to the dyck language. In Proc. 2nd Annual Symposium on Theory of Computing, 1970.
15. J. Oncina and P. Garcia. Identifying regular languages in polynomial time. In H. Bunke, editor, Advances in Structural and Syntactic Pattern Recognition, volume 5 of Series in Machine Perception and Artificial Intelligence, pages 99-108. World Scientific, 1992.
16. G. Petasis, G. Paliouras, V. Karkaletsis, C. Halatsis, and C. Spyropoulos. E-grids: Computationally efficient grammatical inference from positive examples, to appear in Grammars, 2004.
17. Y. Sakakibara. Recent advances of grammatical inference. Theoretical Computer Science, 185:15-45, 1997.
18. Y. Sakakibara and M. Kondo. Ga-based learning of context-free grammars using tabular representations. In Proceedings of 16th International Conference on Machine Learning (ICML-99), pages 354-360, 1999.
19. B. Starkie, F. Coste, and M. van Zaanen. Omphalos context-free language learning competition, http://www.irisa.fr/~0mphalos, 2004.
20. T. Yokomori. Polynomial-time identification of very simple grammars from positive data. Theor. Comput. Sci., 1(298): 179-206, 2003.