Results 11 to 20 of about 445,078 (279)
On a property of probabilistic context-free grammars [PDF]
It is proved that for a probabilistic context-free language L(G), the population density of a character (terminal symbol) is equal to its relative density in the words of a sample S from L(G) whenever the production probabilities of the grammar G are ...
R. Chaudhuri, A. N. V. Rao
doaj +4 more sources
Relating probabilistic grammars and automata [PDF]
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilistic languages, they appear to impose different ...
Steven P. Abney +2 more
openaire +3 more sources
Entropies of probabilistic grammars
The usual concepts from information theory are defined and related to probabilistic grammars. The entropies of a derivation, a sentence and the average terminal symbol in a stream of sentences are calculated. How to maximize the information rate is shown, and the maximum is related to the classical notion of the capacity of a language.
Soule, Stephen
openaire +4 more sources
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning [PDF]
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics.
Shay B. Cohen, Noah A. Smith
doaj +2 more sources
Estimation of consistent probabilistic context-free grammars [PDF]
We consider several empirical estimators for probabilistic context-free grammars, and show that the estimated grammars have the so-called consistency property, under the most general conditions. Our estimators include the widely applied expectation maximization method, used to estimate probabilistic context-free grammars on the basis of unannotated ...
NEDERHOF M. J, SATTA, GIORGIO
openaire +4 more sources
Inducing probabilistic grammars by Bayesian model merging [PDF]
To appear in Grammatical Inference and Applications, Second International Colloquium on Grammatical Inference; Springer Verlag, 1994.
Andreas Stolcke, Stephen M. Omohundro
openaire +5 more sources
Grammar Compression with Probabilistic Context-Free Grammar [PDF]
We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Hiroaki Naganuma +4 more
openaire +3 more sources
A Probabilistic Grammar of Graphics
Visualizations depicting probabilities and uncertainty are used everywhere from medical risk communication to machine learning, yet these probabilistic visualizations are difficult to specify, prone to error, and their designs are cumbersome to explore.
Xiaoying Pu, Matthew Kay 0001
openaire +3 more sources
Count-based state merging for probabilistic regular tree grammars [PDF]
We present an approach to obtain language models from a tree corpus using probabilistic regular tree grammars (prtg). Starting with a prtg only generating trees from the corpus, the prtg is generalized step by step by merging nonterminals.
Dietze, Toni +2 more
core +2 more sources
Probabilistic Grammars and Languages [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

