Stochastic Context-Free Grammars, Regular Languages, and Newton's Method

@article{Etessami2013StochasticCG,
  title={Stochastic Context-Free Grammars, Regular Languages, and Newton's Method},
  author={Kousha Etessami and Alistair Stewart and Mihalis Yannakakis},
  journal={ArXiv},
  year={2013},
  volume={abs/1302.6411}
}
  • Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
  • Published in ICALP 2013
  • Computer Science, Mathematics
  • ArXiv
  • We study the problem of computing the probability that a given stochastic context-free grammar (SCFG), G, generates a string in a given regular language L(D) (given by a DFA, D). This basic problem has a number of applications in statistical natural language processing, and it is also a key necessary step towards quantitative ω-regular model checking of stochastic context-free processes (equivalently, 1-exit recursive Markov chains, or stateless probabilistic pushdown processes). We show… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES

    Pfold: RNA secondary structure prediction using stochastic context-free grammars

    VIEW 19 EXCERPTS
    HIGHLY INFLUENTIAL

    Polynomial-time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations See full version at arXiv

    • K Etessami, A Stewart, M Yannakakis
    • ICALP
    • 2012