Sciweavers

ML
2007
ACM

Learning deterministic context free grammars: The Omphalos competition

13 years 3 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 together with more traditional heuristics based on substitutability and frequency. The competition is discussed from the perspective of a competitor. We discuss a class of deterministic grammars, the Non-terminally Separated (NTS) grammars, that have a property relied on by our algorithm, and consider the possibilities of extending the algorithm to larger classes.
Alexander Clark
Added 27 Dec 2010
Updated 27 Dec 2010
Type Journal
Year 2007
Where ML
Authors Alexander Clark
Comments (0)