33 search results - page 5 / 7 » A Probabilistic Context-free Grammar for Disambiguation in M... |
ACL
1993
13 years 8 months ago
1993
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
JMLR
2010
13 years 2 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...
NAACL
2007
13 years 9 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...
NLPRS
2001
Springer
13 years 12 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper describes a method of adapting a domain-independent HPSG parser to a biomedical domain. Without modifying the grammar and the probabilistic model of the origin...