Probabilistic parsing strategies

@inproceedings{Nederhof2006ProbabilisticPS,
  title={Probabilistic parsing strategies},
  author={Mark-Jan Nederhof and Giorgio Satta},
  booktitle={JACM},
  year={2006}
}
  • Mark-Jan Nederhof, Giorgio Satta
  • Published in JACM 2006
  • Computer Science
  • We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counterparts. Such parsing strategies are seen as constructions of push-down devices from grammars. We show that preservation of probability distribution is possible under two conditions, viz. the correct-prefix property and the property of strong predictiveness. These results generalize existing results in the literature that were obtained by considering parsing strategies in… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 15 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    A method for transforming grammars into LL(k) form

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Introduction to formal language theory

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Statistical properties of probabilistic context-free grammars

    • Z. Chi
    • Computational Linguistics, 25(1):131–160,
    • 1999
    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Stochastic parse - tree recognition by a pushdown automaton

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    How to Cover a Grammar

    VIEW 24 EXCERPTS
    HIGHLY INFLUENTIAL

    Parsing extended LR(k) grammars

    VIEW 23 EXCERPTS
    HIGHLY INFLUENTIAL

    Applying Probability Measures to Abstract Languages

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL