Omphalos is a context-free language learning competition that forms part of ICGI-2004 . The task is to infer a model of a context-free language from unstructured examples (both positive and negative) and to use that model to label a set of test sentences as being either in or out of the language.
A context-free grammar (CFG) is a data structure that defines a language, including the phrase structure of sentences in that language. A context-free language is one that can be described using a context-free grammar. Context-free grammars are used in natural language processing, speech recognition, defining computer languages as well modelling natural phenomenon such as DNA. The process of learning grammars or languages from examples is known as grammatical inference .
We have generated some context-free grammars . For each grammar we have labelled a set of sentences indicating whether or not those sentences can be generated from that grammar. The goal of the competition is to infer a model of each language (such as a grammar) using the training data. You then need to tag new sentences, indicating whether the sentences are in the language or not.
To win this competition you need to do the following:
There are currently 10 different problems , ranked in difficulty from 1 to 10. The winner of each individual problem will be the first contestant that submits a correctly labelled test set for that problem to the oracle. The winner of the competition will be the winner of the highest ranking problem if a winner exists for that problem. We reserve the right to add additional problems to the competition if the initial set of problems proves to be too simple or too hard.
Omphalos is sponsored by :
Date |
Event |
February 15th 2004 |
Competition begins |
October 1st 2004 |
Competition closes |
October 11 th 2004 |
Competition winner announced |
October 11 th – 13 th 2004 |
Omphalos session at ICGI-2004 |
You can download the data sets for the problems here . The way in which the target problems, training and testing sets were created is defined here .
You can submit your data on this page .
If you have any further questions on this competition, please take a
look at the
FAQ
.
If your question is not on there, please let the organizers know.
If you are looking for other grammatical inference benchmarks, you may
be interested by this
repository...
Intellectual Property: We make no claims on the intellectual property of competition participants. Money: All donated funds will be used solely for awards and reimbursing the award ceremony travel expenses of award winners. If there is any prize money left over after the competition it will be returned to the sponsors, unless they'd prefer that it be rolled over into subsequent competitions. Void Where Prohibited: Participants must obey all laws and regulations that apply to them. If anyone's government or employer prohibits them from participating in this competition or from claiming an award, then they must not do so. Similarly, winners are responsible for paying any taxes that might be required. General Disclaimer: The organizers and administrators of the Omphalos competition (Brad Starkie, François Coste and Menno Van Zaanen) reserve the right to change the competition in any way at any time at their sole discretion, without notice, including the right to change the rules, problems, and awards, and the right to terminate the competition. The Omphalos administrators are the sole arbiters for this competition, and their judgment is final in all matters. Eligibility: The administrators and their immediate relatives and immediate co-workers are not eligible for any award. |
Omphalos is being organized and administered by:
Brad Starkie , François Coste and Menno van Zaanen
You can contact them for comments and complaints at omphalos@irisa.fr