Progressing the state-of-the-art in grammatical inference by competition

AI Communications

Volumn 18, Issue 2, 2005, Pages 93-115

  Starkie, Bradford ^a   Coste, François ^b   Van Zaanen, Menno ^c  

^a TELSTRA RESEARCH LABORATORIES   (Australia)

^b CAMPUS DE BEAULIEU   (France)

^c TILBURG UNIVERSITY   (Netherlands)

Author keywords

Competition; Context free grammars; Grammatical inference

Indexed keywords

ALGORITHMS; COMPETITION; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; LEARNING SYSTEMS;

ABBADINGO COMPETITION; GRAMATICAL INFERENCE; LESSONS; STATE-OF-THE-ART;

CONTEXT FREE LANGUAGES;

EID: 24644474888     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. E.M. Gold, Language identification in the limit, Information and Control 10 (1967), 447-474.
2. Y. Sakakibara, Recent advances of grammatical inference, Theoretical Computer Science 185(1) (1997), 15-45.
3. C. de la Higuera, A bibliographical study of grammatical inference, Pattern Recognition, 2005, Special Issue on Grammatical Inference Techniques and Applications.
4. D. Angluin, Queries revisited, Theoretical Computer Science 313(2) (2004), 175-194.
5. L.G. Valiant, A theory of the learnable, Communications of the Association for Computing Machinery 27(11) (1984), 1134-1142.
6. E.M. Gold, Complexity of automaton identification from given data, Information and Control 37 (1978), 302-320.
7. L. Pitt and M. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, in: Johnson [39], pp. 421-432.
8. L. Pitt and M. Warmuth, Reductions among prediction problems: On the difficulty of predicting automata, in: Third Conference on Structure in Complexity Theory, 1988, pp. 60-69.
9. M. Kearns and L.G. Valiant, Cryptographic limitation on learning boolean formulae and finite automata, in: Johnson [39], pp. 433-444.
10. R. Parekh and V. Honavar, Learning DFA from simple examples, in: Workshop on Automata Induction, Grammatical Inference, and Language Acquisition, ICML-97, 1997.
11. C de la Higuera, Characteristic sets for polynomial grammatical inference, Machine Learning 27 (1997), 125-138.
12. C. de la Higuera and J. Oncina, Inferring deterministic linear languages, in: Fifteenth Annual Conference on Computational Learning Theory (COLT 2002), J. Kivinen and R.H. Sloan, eds, 2002, pp. 185-200.
13. B. Starkie, Left aligned grammars - identifying a class of context-free grammar in the limit from positive data, in: Proceedings of the Workshop and Tutorial on Learning Context-Free Grammars held at the 14th European Conference on Machine Learning (ECML) and the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), C. de la Higuera, P.W. Adriaans, M. van Zaanen and J. Oncina, eds, Dubrovnik, Croatia, 2003, pp. 89-101.
14. B. Starkie and H. Fernau, The boisdale algorithm - an induction method for a subclass of unification grammar from positive data, in: Grammatical Inference: Algorithms and Applications; Seventh International Colloquium, ICGI 2004, G. Paliouras and Y. Sakakibara, eds, Athens, Greece, Volume 3264, Springer, Berlin, Germany, 2004, pp. 235-247.
15. J.M. Sempere and P. García, Learning locally testable even linear languages from positive data, in: Adriaans et al. [38], pp. 225-237.
16. T. Yokomori, Polynomial-time identification of very simple grammars from positive data, Theoretical Computer Science 298 (2003), 179-206.
17. P.W. Adriaans, Language learning from a categorial perspective, PhD thesis, University of Amsterdam, Amsterdam, The Netherlands, 1992.
18. A. Clark, Unsupervised language acquisition: theory and practice, PhD thesis, University of Sussex, Brighton, UK, 2001.
19. D. Klein and C.D. Manning, Distributional phrase structure induction, in: CoNLL [37], pp. 113-120.
20. 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: Proceedings of the Fourth International Conference on Grammar Inference, volume 1433 of Lecture Notes in AI, V. Honavar and G. Slutzki, eds, Springer, Berlin Heidelberg, Germany, 1998, pp. 1-12.
21. J.J. Horning, A study of grammatical inference, PhD thesis, Stanford University, Stanford, CA, USA, 1969.
22. M. van Zaanen, A. Roberts and E. Atwell, A multilingual parallel parsed corpus as gold standard for grammatical inference evaluation, in: Proceedings of the Workshop: The Amaz ing Utility of Parallel and Comparable Corpora, L. Kranias, N. Calzolari, G. Thurmair, Y. Wilks, E. Hovy, G. Magnusdottir, A. Samiotou and K. Choukri, eds, Lisbon, Portugal, 2004, pp. 58-61.
23. N. Chomsky, Three models for the description of language, IRE Transactions on Information Theory 2 (1956), 113-124.
24. J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, USA, 2001.
25. T.M. Mitchell, Machine Learning, McGraw-Hill, New York, NY, USA, 1997.
26. A. Stolcke, Boogie, ftp://ftp.icsi.berkeley.edu/pub/ai/stolcke/software/ boogie.shar.Z, 2003.
27. K. Nakamura and M. Matsumoto, Incremental learning of context-free grammars, in: Adriaans et al. [38], pp. 174-184.
28. C.M. Cook, A. Rosenfeld and A.R. Aronson, Grammatical inference by hill climbing, Informational Sciences 10 (1976), 59-80.
29. C. Donnelly and R.M. Stallman, Bison Manual: Using the YACC-compatible Parser Generator, for Version 1.875, GNU Press, Boston, MA, USA, 2003.
30. A. Denise, F. Sarron and Y. Ponty, GenRGenS. http://www.lri.fr/~denise/ GenRGenS/, 2001. Laboratoire de Recherche en Informatique.
31. M.J. Nederhof, Practical experiments with regular approximation of context-free languages, Computational Linguistics 26(1) (2000), 17-44.
32. F. Otto, On deciding the confluence of a finite string-rewriting system on a given congruence class, Journal of Computer and System Sciences 35 (1987), 285-310.
33. A. Clark, Learning deterministic context free grammars: The Omphalos competition, Machine Learning, 2005 (submitted).
34. R. Eyraud, C. de La Higuera and J. Janodet, Representing languages by learnable rewrite systems, in: Grammatical Inference: Algorithms and Applications; 7th International Colloquium, ICGI 2004, G. Paliouras and Y. Sakakibara, eds, Athens, Greece, Volume 3264, Springer, Berlin, Germany, 2004, pp. 139-150.
35. A. Clark, Unsupervised induction of stochastic context-free grammars using distributional clustering, in: CoNLL [37], pp. 105-112.
36. M. van Zaanen, ABL: Alignment-Based Learning, in: Proceedings of the 18th International Conference on Computational Linguistics (COLING); Saarbrücken, Germany, Association for Computational Linguistics (ACL), 2000, pp. 961-967.
37. Association for Computational Linguistics (ACL), in: Proceedings of the Workshop on Computational Natural Language Learning held at the 39th Annual Meeting of the Association for Computational Linguistics (ACL) and the 10th Meeting of the European Chapter of the Association for Computational Linguistics (EACL), Toulouse, France, 2001.
38. P.W. Adriaans, H. Fernau and M. van Zaanen, eds, Grammatical Inference: Algorithms and Applications (ICGI); Amsterdam, The Netherlands, Volume 2482 of Lecture Notes in AI, Springer, Berlin Heidelberg, Germany, 2002.
39. D.S. Johnson, ed., STOC '89: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, New York, NY, USA, ACM Press, 1989.