Learning tree languages from positive examples and membership queries

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

Volumn 3244, Issue , 2004, Pages 440-453

  Besombes, Jérôme ^a   Marion, Jean Yves ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; LEARNING SYSTEMS; MATHEMATICAL MODELS; SET THEORY; TREES (MATHEMATICS); FORESTRY;

FINITE TREE AUTOMATON; MEMBERSHIP QUERIES; POLYNOMIAL TIME; REGULAR TREE LANGUAGES; COUNTER EXAMPLES; EQUIVALENCE QUERIES; MEMBERSHIP QUERY; NEGATIVE EXAMPLES; POSITIVE EXAMPLES; REPRESENTATIVE SAMPLE; TARGET LANGUAGE;

FORMAL LANGUAGES; COMPUTATIONAL LINGUISTICS;

EID: 22944467504     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30215-5_33     Document Type: Conference Paper

References (23)

1. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76-87, 1981.
2. D. Angluin. Learning regular sets from queries and counter examples. Information and Control, 75:87-106, 1987.
3. D. Angluin. Queries and concept learning. Machine learning, 2:319-342, 1988.
4. J. Besombes and J.Y. Marion. Identification of reversible dependency tree languages. Proceedings of the third Learning Language in Logic workshop, pages 11-22, 2001.
5. J. Besombes and J.Y. Marion. Apprentissage des langages réguliers d'arbres et applications. Conférence d'Apprentissage, Orléans 17, 18 et 19 juin 2002, pages 55-70, 2002.
6. J. Besombes and J.Y. Marion. Learning dependency languages from a teacher. In Proceedings of Formal Grammar 2004, pages 17-28, 2004.
7. J. Besombes and J.Y. Marion. Learning reversible categorial grammars from structures. In Proceedings of the international IIS:IIP WM'04, Advances in Soft Computing, Springer Verlag, pages 181-190, 2004.
8. R.C. Carrasco, J. Oncina, and J. Calera. Stochastic inference of regular tree languages. Lecture Notes in Computer Science, 1433:185-197, 1998.
9. A. Christophe. L'apprentissage du langage. In Université de tous les savoirs, volume 2, pages 41-51. Odile Jacob, 2000.
10. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
11. A. Dikovsky and L. Modina. Dependencies on the other side of the curtain. Traitement automatique des langues, 41(1):67-96, 2000.
12. F. Drewes and J. Högberg. Learning a regular tree language from a teacher. In Z. Ésik and Z. Fülöp, editors, Proc. Developments in Language Theory 2003, volume 2710 of Lecture Notes in Computer Science, pages 279-291. Springer, 2003.
13. F. Drewes and J. Högberg. Learning a regular tree language from a teacher even more efficiently. Technical Report 03.11, Umea University, 2003.
14. H. Fernau. Learning tree languages from text. 2375:153-168, 2002.
15. H. Fukuda and K. Kamata. Inference of tree automata from sample set of trees. International Journal of Computer and Information Sciences, 13(3):177-196, 1984.
16. M.E. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
17. K. Kamata. Inference methods for tree automata from sample set of trees. IEEE International Conference on Systems, Man and Cybernetics, pages 490-493, 1988.
18. M. Kanazawa. Learnable classes of Categorial Grammars. CSLI, 1998.
19. D. Kozen. On the myhill-nerode theorem for trees. EATCS Bulletin, 47:170-173, June 1992.
20. S. Pinker. The language instinct. Harper, 1994.
21. Y. Sakakibara. Inductive inference of logic programs based on algebraic semantics. Technical Report ICOT, 79, 1987.
22. Y. Sakakibara. Inferring parsers of context-free languages from structural examples. Technical Report ICOT, 81, 1987.
23. Y. Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223-242, 1990.