The omphalos context-free grammar learning competition

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

Volumn 3264, Issue , 2004, Pages 16-27

  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

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; DATA PROCESSING; EVALUATION; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING; SET THEORY; COMPUTATIONAL GRAMMARS; CONTEXT FREE GRAMMARS; INFERENCE ENGINES;

BENCHMARK INFERENCE PROBLEMS; BRUTEFORCELEARNER ALGORITHM; CONTEXT-FREE GRAMMAR; OMPHALOS COMPETITION; CONTEXT-FREE; DESIGN ISSUES; GAIN INSIGHT; GRAMMATICAL INFERENCE ALGORITHM; GRAMMATICAL INFERENCES; STATE OF THE ART;

LEARNING SYSTEMS; CONTEXT FREE LANGUAGES;

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

References (11)

1. Menno van Zaanen, Andrew Roberts, and Eric Atwell. A multilingual parallel parsed corpus as gold standard for grammatical inference evaluation. In Lambros Kranias, Nicoletta Calzolari, Gregor Thurmair, Yorick Wilks, Eduard Hovy, Gudrun Magnusdottir, Anna Samiotou, and Khalid Choukri, editors, Proceedings of the Workshop: The Amazing Utility of Parallel and Comparable Corpora; Lisbon, Portugal, pages 58-61, May 2004.
2. Kevin J. Lang, Barak A. Pearlmutter, and Rodney A. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In V. Honavar and G. Slutzki, editors, Proceedings of the Fourth International Conference on Grammar Inference, volume 1433 of Lecture Notes in AI, pages 1-12, Berlin Heidelberg, Germany, 1994. Springer-Verlag.
3. E. Mark Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
4. B. Starkie. A complexity measure for the grammatical inference of context-free languages. Technical Report RLR8561, Telstra Research Laboratories, Clayton, Australia, 2004.
5. A. Stolcke. Boogie, ftp://ftp.icsi.berkeley.edu/pub/ai/stolcke/software/ boogie.shar.Z, 2003.
6. K. Nakamura and M. Matsumoto. Incremental learning of context-free grammars. In Pieter Adriaans, Henning Fernau, and Menno van Zaanen, editors, Grammatical Inference: Algorithms and Applications (ICGI); Amsterdam, the Netherlands, volume 2482 of Lecture Notes in AI, pages 174-184, Berlin Heidelberg, Germany, September 23-25 2002. Springer-Verlag.
7. Craig M. Cook, Azriel Rosenfeld, and Alan R. Aronson. Grammatical inference by hill climbing. Informational Sciences, 10:59-80, 1976.
8. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Company, Reading:MA, USA, 2001.
9. Alain Denise, Frédéric Sarron, and Yann Ponty. GenRGenS. URL: http://www.1ri.fr/~denise/GenRGenS/, 2001.
10. Mark-Jan Nederhof. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1):17-44, 2000.
11. F. Otto. 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.