Results 11 to 20 of about 10,677,937 (263)

On a property of probabilistic context-free grammars [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1983
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   +6 more sources

Probabilistic context-free grammars for phonology [PDF]

open access: yesProceedings of the ACL-02 workshop on Morphological and phonological learning -, 2002
We present a phonological probabilistic context-free grammar, which describes the word and syllable structure of German words. The grammar is trained on a large corpus by a simple supervised method, and evaluated on a syllabification task achieving 96.88% word accuracy on word tokens, and 90.33% on word types. We added rules for English phonemes to the
Karin Müller
openaire   +2 more sources

Computation of Infix Probabilities for Probabilistic Context-Free Grammars. [PDF]

open access: yes, 2011
The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction. For the case where a probabilistic context-free grammar is used as language model, methods for the computation of infix ...
NEDERHOF M. J, SATTA, GIORGIO
core   +8 more sources

Estimation of consistent probabilistic context-free grammars [PDF]

open access: yesProceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics -, 2006
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

Robust German noun chunking with a probabilistic context-free grammar [PDF]

open access: yesProceedings of the 18th conference on Computational linguistics -, 2000
We present a noun chunker for German which is based on a head-lexicalised probabilistic context-free grammar. A manually developed grammar was semi-automatically extended with robustness rules in order to allow parsing of unrestricted text. The model parameters were learned from unlabelled training data by a probabilistic context-free parser.
Helmut Schmid, Sabine Schulte im Walde
openaire   +3 more sources

Cross-entropy and estimation of probabilistic context-free grammars [PDF]

open access: yesProceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics -, 2006
We investigate the problem of training probabilistic context-free grammars on the basis of a distribution defined over an infinite set of trees, by minimizing the cross-entropy. This problem can be seen as a generalization of the well-known maximum likelihood estimator on (finite) tree banks. We prove an unexpected theoretical property of grammars that
CORAZZA, ANNA, G. SATTA
openaire   +5 more sources

Consistency of Probabilistic Context-Free Grammars [PDF]

open access: yes, 2012
We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation.
Stüber, Torsten
core   +5 more sources

Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata [PDF]

open access: yesProceedings of the 20th international conference on Computational Linguistics - COLING '04, 2004
We consider the problem of computing the Kullback-Leibler distance, also called the relative entropy, between a probabilistic context-free grammar and a probabilistic finite automaton. We show that there is a closed-form (analytical) solution for one part of the Kullback-Leibler distance, viz. the cross-entropy.
M. J. NEDERHOF, SATTA, GIORGIO
core   +4 more sources

Non-autoregressive Machine Translation with Probabilistic Context-free Grammar [PDF]

open access: yesAdvances in Neural Information Processing Systems 36, 2023
Non-autoregressive Transformer(NAT) significantly accelerates the inference of neural machine translation. However, conventional NAT models suffer from limited expression power and performance degradation compared to autoregressive (AT) models due to the assumption of conditional independence among target tokens.
Shangtong Gui   +5 more
openaire   +4 more sources

Comparing the Ambiguity Reduction Abilities of Probabilistic Context-Free Grammars

open access: yesProceedings of the Language Resources and Evaluation Conference, 2004
We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambiguity resolution capabilities.Probabilities in a PCFG can be seen as a filtering mechanism: For an ambiguous sentence, the trees bearing maximum probability aresingle out, while all others are discarded. The level of ambiguity is related to the size of the
Infante-Lopez, G.G., de Rijke, M.
core   +7 more sources

Home - About - Disclaimer - Privacy