I'm running NLP on large texts, and part of the questions I'm trying to answer have to deal with syntax. I'm using Stanford NLP, including the Stanford Parser. I started out using the probabilistic CFG (PCFG) models, but that can take a very long time to process a large text with a sizable amount of "long" sentences.

I recently read up on the Shift-Reduce Parser on the Stanford NLP website, and according to them it's a lot faster than the PCFG-based parser while sacrificing little accuracy. The published benchmark doesn't explain in much detail what kind of text was used, however, so I don't have a good idea whether the promise of increased performance holds up in practice.

Has anyone experimented with the shift-reduce parser, and specifically compared its running time with that of the PCFG variety? It looks to me based on some early testing that the SR models cause the parser to consume a lot more memory, so I'm a little apprehensive about running it on my text corpus.

Thanks a lot!

  • 1
    I am not aware of any published performance figures. You could ask on their mailinglist for this information.
    – prash
    Commented Aug 22, 2015 at 20:15

1 Answer 1


The website for the SR parser explicitly states that the measures were for parsing on the Penn Treebank WSJ (Wall Street Journal) corpus, section 23:

Screenshot of performance table from Stanford CoreNLP SR parser website

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.