Understanding PCFG in NLP

What is Statistical Parsing?

• A way for computers to analyze the structure of a sentence based on probabilities.

• A method to diagram sentences.

• A technique that uses only grammar rules.

• A way to predict the meaning of sentences.

What is Context-Free Grammar (CFG)?

• A set of rules used to define all possible sentences in a language.

• A method for statistical analysis.

• A type of parsing technique.

• A way to resolve ambiguities.

What is Probabilistic Context-Free Grammar (PCFG)?

• An extension of CFG with probabilities assigned to grammar rules.

• A method for creating complex sentences.

• A technique for understanding context.

• A way to analyze sentence structure.

How does PCFG help in parsing?

• By checking all possible structures and using probabilities.

• By simplifying sentence structures.

• By eliminating ambiguities.

• By using fixed grammar rules.

Why is PCFG important?

• It helps in resolving ambiguities and learning from data.

• It is a traditional grammar method.

• It does not use probabilities.

• It is only useful for simple sentences.

What are the components of PCFG?

• Non-terminal symbols, terminal symbols, production rules.

• Only terminal symbols.

• Only production rules.

• Non-terminal symbols and context.

What is the probability of a rule in PCFG based on?

• How often that rule appears in the training data.

• The complexity of the sentence.

• The number of words in the sentence.

• The context of the sentence.

What is a limitation of PCFG?

• It is not fully context-sensitive.

• It is too complex to use.

• It cannot handle ambiguity.

• It relies solely on fixed rules.

What does PCFG resolve?

• Ambiguities in sentence structure.

• All grammatical errors.

• Only simple sentences.

• Contextual meanings.

How are PCFGs trained?

• On a treebank of sentences paired with their correct parse trees.

• Using random sentences.

• By analyzing only simple sentences.

• Through fixed grammar rules.