Introducing domain and typing bias in automata inference

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

Volumn 3264, Issue , 2004, Pages 115-126

  Coste, François ^a   Fredouille, Daniel ^b   Kermorvant, Christopher ^c   De La Higuera, Colin ^d  

^a CAMPUS DE BEAULIEU   (France)

^b ROBERT GORDON UNIVERSITY   (United Kingdom)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

^d UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Automata Inference; Background Knowledge

Indexed keywords

ALGORITHMS; DATA PROCESSING; FINITE AUTOMATA; FORMAL LANGUAGES; LEARNING SYSTEMS; RANDOM PROCESSES; AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS;

AUTOMATA INFERENCE; BACKGROUND KNOWLEDGE; SEQUENTIAL LEARNING DATA; TYPING BIAS; ALGORITHMIC SOLUTIONS; BACK-GROUND KNOWLEDGE; FORMAL GRAMMARS; GRAMMATICAL INFERENCES; LEARNING FRAMEWORKS; STATE-MERGING;

AUTOMATA THEORY; INFERENCE ENGINES;

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

References (16)

1. D. Angluin. Learning regular sets from queries and counterexamples. Information and Control, 39:337-350, 1987.
2. E. Brill. Some advances in rule-based part of speech tagging. In Proc. National Conference on Artificial Intelligence, 1994.
3. A. Cano, J. Ruiz, and P. Garcia. Inferring subclasses of regular languages faster using RPNI and forbidden configurations. In Proc. Int. Coll. on Gram. Inference, volume 2484 of LNCS, pages 28-36. Springer, 2002.
4. R. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In Proc. Int. Coll. on Gram. Inference, number 862 in LNCS, pages 139-150. Springer Verlag, 1994.
5. F. Coste and D. Fredouille. Efficient ambiguity detection in c-nfa, a step toward inference of non deterministic automata. In Proc. Int. Coll. on Gram. Inference, pages 25-38, 2000.
6. F. Coste and D. Fredouille. Unambiguous automata inference by means of statemerging methods. In European Conference on Machine Learning, pages 60-71, 2003.
7. C. de la Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27:125-138, 1997.
8. F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using rfsa. In Proc. Int. Conf. on Alg. Learning Theory, LNCS, pages 348-363. Springer-Verlag, 2001.
9. P. Dupont, L. Miclet, and E. Vidai. What is the search space of the regular inference? In Proc. Int. Coll. on Gram. Inference, number 862 in LNCS, pages 25-37. Springer Verlag, 1994.
10. T. Goan, N. Benson, and O. Etzioni. A grammar inference algorithm for the world wide web. In Proc. of AAAI Spring Symposium on Machine Learning in Information Access. AAAI Press, 1996.
11. C. Kermorvant and C. de la Higuera. Learning languages with help. In Proc. Int. Coll. on Gram. Inference, volume 2484 of LNCS, pages 161-173. Springer, 2002.
12. C. Kermorvant, C. de la Higuera, and P. Dupont. Improving probabilistic automata learning with additional knowledge. In Proc. of the IAPR International Workshops SSPR and SPR, 2004.
13. S. Muggleton. Inductive Logic Programming. In The MIT Encyclopedia of the Cognitive Sciences (MITECS). MIT Press, 1999.
14. J. Oncina and P. García. Identifying regular languages in polynomial time. In H. Bunke, editor, Advances in Structural and Syntactic Pattern Recognition, volume 5, pages 99-108. World Scientific, 1992.
15. J. Oncina and M. A. Varó. Using domain information during the learning of a subsequential transducer. In Proc. Int. Coll. on Gram. Inference, volume 1147 of LNCS, pages 301-312. Springer, 1996.
16. Y. Sakakibara and H. Muramatsu. Learning context-free grammars from partially structured examples. In Proc. Int. Coll. on Gram. Inference, number 1891 in LNCS, pages 229-240. Springer-Verlag, 2000.