270 search results - page 3 / 54 » Effective natural language parsing with probabilistic gramma... |
126
click to vote
NIPS
2008
15 years 3 months ago
2008
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
108
click to vote
FSMNLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
119
Voted
EMNLP
2009
14 years 11 months ago
2009
We investigate the effectiveness of selftraining PCFG grammars with latent annotations (PCFG-LA) for parsing languages with different amounts of labeled training data. Compared to...
115
Voted
COLING
1992
15 years 3 months ago
1992
In Natural Language Processing (NLP), one key problem is how to design a robust and effective parsing system. In this paper, we will introduce a corpm- based Chinese parsing syste...
174
Voted
CPP
2011
14 years 1 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...