Consistency of stochastic context-free grammars

DOI10.1016/J.MCM.2010.03.046zbMath1201.68063OpenAlexW1998421037MaRDI QIDQ611793

Sumit K. Garg

Publication date: 14 December 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.03.046

zbMATH Keywords

consistencyprobabilistic grammartest data generation

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Grammars and rewriting systems (68Q42) Linguistics (91F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of an Open Problem on Probabilistic Grammars
• Probabilistic and weighted grammars
• Applying Probability Measures to Abstract Languages
• STACS 2005

This page was built for publication: Consistency of stochastic context-free grammars