CODEWITHSUNDEEP
parsingnlpstanford-nlpnlp-question-answering
Pranav Kumar Jha
Pranav Kumar Jha

Reputation: 1

Where can I get the CFG used in Stanford Parser?

I am trying to identify the key phrase(s) in a question along with the type of answer expected. I am using Stanford Parser to generate the parse tree of the question. I need to traverse this parse tree and make choices at each node whether it is a key phrase or not based on some heuristics. If only I had access to the complete CFG used in Stanford Parser, I could expand the heuristics to cover all the children of a node that might appear in the tree.

The Stanford Parser: A statistical parser

Upvotes: 0

Views: 464

Answers (1)

Jon Gauthier
Jon Gauthier

Reputation: 25572

Every trained LexicalizedParser instance has fields bg and ug, which are learned BinaryGrammar and UnaryGrammar instances. Each of these classes have methods which allow you to look up binary / unary rewrite rules from a given parent or child (or sibling, in the binary case). Every rewrite rule (see Rule interface) has an associated log-probability under the field score. You can use LexicalizedParser#stateIndex to get the necessary int IDs for any given tree constituent.

That being said, it's not clear that seeing all possible productions would be a good thing for your purposes. (The grammar is pretty ugly!) You might do better examining the k-best parses for a given sentence.

Upvotes: 0

Related Questions