5 search results - page 1 / 1 » Learning Context-Free Grammars with a Simplicity Bias |
ECML
2000
Springer
13 years 9 months ago
2000
Springer
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
FLAIRS
2003
13 years 6 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
JMLR
2010
12 years 11 months ago
2010
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...
ACL
2010
13 years 2 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
RANLP
2003
13 years 6 months ago
2003
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...