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

DOI10.1016/S0020-0190(99)00119-2zbMATH Open1338.68136OpenAlexW2031985681MaRDI QIDQ294698FDOQ294698

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)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• A new algorithm for regularizing one-letter context-free grammars.
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)