@article{Nederhof2008,
    Abstract = {We investigate the problem of computing the partition function of a probabilistic context-free grammar, and consider a number of applicable methods. Particular attention is devoted to PCFGs that result from the intersection of another PCFG and a finite automaton. We report experiments involving the Wall Street Journal corpus.},
    Author = {Nederhof, Mark-Jan and Satta, Giorgio},
    File = {2008d (0) - a - a - k.pdf},
    ISSN = {1572-8706},
    Journal = {Research on Language and Computation},
    Month = {Oct},
    Number = {2},
    Pages = {139--162},
    Title = {Computing Partition Functions of PCFGs},
    URL = {https://doi.org/10.1007/s11168-008-9052-8},
    Volume = {6},
    Year = {2008},
    bdsk-url-1 = {https://doi.org/10.1007/s11168-008-9052-8},
    date-added = {2018-10-02 07:21:02 +0000},
    date-modified = {2018-10-02 07:21:02 +0000},
    day = {01},
    doi = {10.1007/s11168-008-9052-8}
}

@article{Nederhof2008, Abstract = {We investigate the problem of computing the partition function of a probabilistic context-free grammar, and consider a number of applicable methods. Particular attention is devoted to PCFGs that result from the intersection of another PCFG and a finite automaton. We report experiments involving the Wall Street Journal corpus.}, Author = {Nederhof, Mark-Jan and Satta, Giorgio}, File = {2008d (0) - a - a - k.pdf}, ISSN = {1572-8706}, Journal = {Research on Language and Computation}, Month = {Oct}, Number = {2}, Pages = {139--162}, Title = {Computing Partition Functions of PCFGs}, URL = {https://doi.org/10.1007/s11168-008-9052-8}, Volume = {6}, Year = {2008}, bdsk-url-1 = {https://doi.org/10.1007/s11168-008-9052-8}, date-added = {2018-10-02 07:21:02 +0000}, date-modified = {2018-10-02 07:21:02 +0000}, day = {01}, doi = {10.1007/s11168-008-9052-8} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge