Negation Elimination for Finite PCFGs

DOI10.1007/11506676_8MaRDI QIDQ5458798zbMATH OpenOpenAlexFDO

Authors Taisuke Sato, Yoshitaka Kameya

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11506676_8

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Weighted and probabilistic context-free grammars are equally expressive
• A note on the expressive power of probabilistic context free grammars
• Probabilistic parsing
• Probabilistic feature grammars
• The generative power of probabilistic and weighted context-free grammars

Cited in

(1)

• New Advances in Logic-Based Probabilistic Modeling by PRISM

This page was built for publication: Negation Elimination for Finite PCFGs

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