Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I am interested in parsing of general SCFGs.

I am aware of the Earley parser for the general CFGs. The only general algorithm for parsing SCFGs that I am aware of is the Earley-Stolcke parser : http://arxiv.org/abs/cmp-lg/9411029

1) Is there more recent work on the subject?

2) Is there publicly available software for deriving the Viterbi parse, compute prefix probabilities, and estimating rule probabilities of SCFGs?

Thank you very much!

share|improve this question
add comment

1 Answer

Both Earley parser and CYK parser can be used for parsing SCFG. See http://en.wikipedia.org/wiki/CYK_algorithm#Parsing_weighted_context-free_grammars

There are many software that include a SCFG parser, for example, Berkeley parser. Estimating rule probabilities from training corpus with parse trees annotated is straightforward, i.e., counting and normalization. Estimating rule probabilities from unannotated training corpus can be done using EM (the inside-outside algorithm) or MCMC.

share|improve this answer
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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