Learning languages with help

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

Volumn 2484, Issue , 2002, Pages 161-173

  Kermorvant, Christopher ^a   De La Higuera, Colin ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES;

DETERMINISTIC FINITE AUTOMATA; FORMAL GRAMMARS; GRAMMATICAL INFERENCES; LEARNING DATA; LEARNING LANGUAGES; LEARNING TASKS;

COMPUTATIONAL LINGUISTICS;

EID: 84943231970     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_13     Document Type: Conference Paper

References (22)

1. D. Angluin. Learning regular sets from queries and counterexamples. Information and Control, 39:337-350, 1987.
2. M. Bernard and A. Habrard. Learning stochastic logic programs. Int. Conf. on Inductive Logic Programming, Work in progress session, 2001.
3. H. Boström. Theory-Guided Induction of Logic Programs by Inference of Regular Languages. In Int. Conf. on Machine Learning, 1996.
4. R. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In ICGI'94, number 862 in LNAI, pages 139-150, 1994.
5. C. de la Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27:125-138, 1997.
6. C. de la Higuera and M. Bernard. Apprentissage de programmes logiques par inférence grammaticale. Revue d'Intelligence Artificielle, 14(3):375-396, 2001.
7. C. de la Higuera, J. Oncina, and E. Vidal. Identification of DFA: data-dependent versus data-independent algorithm. In ICGI'96, number 1147 in LNAI, pages 313-325, 1996.
8. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In ICGI '94, number 862 in LNAI, pages 25-37, 1994.
9. H. Fernau. Identification of function distinguishable languages. In Int. Conf. on Algorithmic Learning Theory, volume 1968 of LNCS, pages 116-130, 2000.
10. H. Fernau. Learning xml grammars. In Machine Learning and Data Mining in Pattern Recognition MLDM'01, number 2123 in LNCS, pages 73-87, 2001.
11. K. S. Fu and T. L. Booth. Grammatical inference: Introduction and survey. part i and ii. IEEE Transactions on Syst. Man. and Cybern., 5:59-72 and 409-423, 1975.
12. T. Goan, N. Benson, and O. Etzioni. A grammar inference algorithm for the world wide web. In Proc. of AAAI Spring Symp. on Machine Learning in Information Access., 1996.
13. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
14. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
15. K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In ICGI'98, number 1433 in LNAI, pages 1-12, 1998.
16. S. Muggleton. Inductive Logic Programming. In The MIT Encyclopedia of the Cognitive Sciences (MITECS). MIT Press, 1999.
17. J. Oncina and P. Garciá. Identifying regular languages in polynomial time. In Advances in Structural and Syntactic Pattern Recognition, pages 99-108. 1992.
18. D. Ron, Y. Singer, and N. Tishby. On the learnability and usage of acyclic probabilistic finite automata. In Proc. of COLT 1995, pages 31-40, 1995.
19. Y. Sakakibara. Recent advances of grammatical inference. Theoretical Computer Science, 185:15-45, 1997.
20. Y. Sakakibara and H. Muramatsu. Learning context-free grammars from partially structured examples. In ICGI'00, number 1891 in LNAI, pages 229-240, 2000.
21. L. G. Valiant. A theory of the learnable. Com. of the ACM, 27(11):1134-1142, 1984.
22. M. Young-Lai and F. W. Tompa. Stochastic grammatical inference of text database structure. Machine Learning, 40(2):111-137, 2000.