A new one pass algorithm for estimating stochastic context-free grammars

DOI10.1016/S0020-0190(99)00119-2MaRDI QIDQ294698zbMATH OpenOpenAlexFDO

Authors Dong-Yul Ra, George C. Stockman

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099001192?np=y

zbMATH Keywords

estimationparsingrule probabilitystochastic context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1670723
• Stochastic context-free grammars, regular languages, and newton's method
• Inductive Logic Programming
• Cross-moments computation for stochastic context-free grammars
• CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

Cites work

• An efficient context-free parsing algorithm
• Applying Probability Measures to Abstract Languages
• Optimization of LR(k) parsers

Cited in

(3)

• scientific article; zbMATH DE number 2019604 (Why is no real title available?)
• A new algorithm for regularizing one-letter context-free grammars.
• scientific article; zbMATH DE number 1670723 (Why is no real title available?)

This page was built for publication: A new one pass algorithm for estimating stochastic context-free grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294698)