CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

DOI10.22190/FUMI1801041IzbMath1474.68164arXiv1108.0353OpenAlexW2964102688MaRDI QIDQ5896876

Velimir M. Ilić, Miroslav Ćirić, Miomir S. Stanković

Publication date: 5 May 2021

Published in: Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.0353

zbMATH Keywords

stochastic context-free grammarcross-momentslanguage of grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Computing the relative entropy between regular tree languages
• Computation of distances for regular and context-free probabilistic languages
• Computing abstract decorations of parse forests using dynamic programming and algebraic power series
• Computation of cross-moments using message passing over factor graphs
• Moments of string and derivation lengths of stochastic context-free grammars
• Products of weighted logic programs
• ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
• Matrix Analysis
• The Fourth Moment Method
• Entropy Message Passing
• Applying Probability Measures to Abstract Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS