Abstract
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created in an effort to promote the development of new and better grammatical inference algorithms for context-free languages, to provide a forum for the comparison of different grammatical inference algorithms and to gain insight into the current state-of-the-art of context-free grammatical inference algorithms. This paper discusses design issues and decisions made when creating the competition. It also includes a new measure of the complexity of inferring context-free grammars, used to rank the competition problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
van Zaanen, M., Roberts, A., Atwell, E.: A multilingual parallel parsed corpus as gold standard for grammatical inference evaluation. In: Kranias, L., Calzolari, N., Thurmair, G., Wilks, Y., Hovy, E., Magnusdottir, G., Samiotou, A., Choukri, K. (eds.) Proceedings of the Workshop: The Amazing Utility of Parallel and Comparable Corpora, Lisbon, Portugal, May 2004, pp. 58–61 (2004)
Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1–12. Springer, Heidelberg (1998)
Mark Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Starkie, B.: A complexity measure for the grammatical inference of context-free languages. Technical Report RLR8561, Telstra Research Laboratories, Clayton, Australia (2004)
Stolcke. Boogie. boogie.shar.Z (2003), ftp://ftp.icsi.berkeley.edu/pub/ai/stolcke/software/
Nakamura, K., Matsumoto, M.: Incremental learning of context-free grammars. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 23–25. Springer, Heidelberg (2006)
Cook, C.M., Rosenfeld, A., Aronson, A.R.: Grammatical inference by hill climbing. Informational Sciences 10, 59–80 (1976)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Company, Reading (2001)
Denise, A., Sarron, F., Ponty, Y.: GenRGenS (2001), http://www.lri.fr/~denise/GenRGenS/
Nederhof, M.-J.: Practical experiments with regular approximation of contextfree languages. Computational Linguistics 26(1), 17–44 (2000)
Otto, F.: On deciding the confluence of a finite string-rewriting system on a given congruence class. Journal of Computer and System Sciences 35, 285–310 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Starkie, B., Coste, F., van Zaanen, M. (2004). The Omphalos Context-Free Grammar Learning Competition. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30195-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23410-4
Online ISBN: 978-3-540-30195-0
eBook Packages: Springer Book Archive