270 search results - page 39 / 54 » Effective natural language parsing with probabilistic gramma... |
74
Voted
COLING
2010
14 years 4 months ago
2010
We present a probabilistic generative model for learning semantic parsers from ambiguous supervision. Our approach learns from natural language sentences paired with world states ...
68
Voted
ACL
1990
14 years 10 months ago
1990
Current complex-feature based grammars use a single procedure--unification--for a multitude of purposes, among them, enforcing formal agreement between purely syntactic features. ...
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
Corpus-based stochastic language models have achieved significant success in speech recognition, but construction of a corpus pertaining to a specific application is a difficult ta...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
EMNLP
2009
14 years 7 months ago
2009
This paper describes an empirical study of high-performance dependency parsers based on a semi-supervised learning approach. We describe an extension of semisupervised structured ...