Cross-moments computation for stochastic context-free grammars
From MaRDI portal
Publication:5896879
Recommendations
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS
- On a matrix of first moments for decomposable stochastic CF-grammar
- Stochastic context-free grammars, regular languages, and newton's method
- scientific article; zbMATH DE number 1759522
- Computation of moments for probabilistic finite-state automata
Cites work
- scientific article; zbMATH DE number 3731374 (Why is no real title available?)
- scientific article; zbMATH DE number 1232914 (Why is no real title available?)
- scientific article; zbMATH DE number 907008 (Why is no real title available?)
- Applying Probability Measures to Abstract Languages
- Computation of cross-moments using message passing over factor graphs
- Computation of distances for regular and context-free probabilistic languages
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series
- Computing the relative entropy between regular tree languages
- Entropy Message Passing
- Matrix Analysis
- Moments of string and derivation lengths of stochastic context-free grammars
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
- Probabilistic parsing
- Products of weighted logic programs
- Rational kernels: theory and algorithms
- The Fourth Moment Method
Cited in
(5)- A new one pass algorithm for estimating stochastic context-free grammars
- Computation of cross-moments using message passing over factor graphs
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS
- On a matrix of first moments for decomposable stochastic CF-grammar
- Computation of higher-order cross moments based on matrix multiplication
This page was built for publication: Cross-moments computation for stochastic context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896879)