Sciweavers

4 search results - page 1 / 1
» Learning deterministic context free grammars: The Omphalos c...
Sort
View
ML
2007
ACM
13 years 4 months ago
Learning deterministic context free grammars: The Omphalos competition
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
Alexander Clark
ICGI
2004
Springer
13 years 10 months ago
The Omphalos Context-Free Grammar Learning Competition
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 ...
Bradford Starkie, François Coste, Menno van...
JMLR
2010
192views more  JMLR 2010»
12 years 11 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater
LATA
2010
Springer
13 years 11 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark