10 search results - page 2 / 2 » Inferring context-free grammars for domain-specific language... |
JMLR
2010
13 years 4 days ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
VL
2002
IEEE
13 years 10 months ago
2002
IEEE
Domain specific programming languages tend to be rigid in capability and dependent on either a graphical interface or a scripting language. We present a question-oriented approach...
NAACL
2007
13 years 6 months ago
2007
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an altern...
JMLR
2010
13 years 4 days 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
2006
13 years 6 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...