1
Parsing is the process of
Correct Answer
analysing a sentence to determine its syntactic structure
☑ MCQ PRACTICE
Natural Language Processing Unit 2
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Natural Language Processing - Unit-2
2
A treebank is
Correct Answer
a corpus annotated with syntactic structure
3
The Penn Treebank is a well-known annotated corpus of
Correct Answer
English text
4
A constituency representation of a sentence is a
Correct Answer
phrase structure tree
5
A dependency representation of a sentence shows
Correct Answer
head–dependent relations between words
6
A context-free grammar consists of
Correct Answer
terminals, non-terminals, production rules and a start symbol
7
Top-down parsing begins with
Correct Answer
the start symbol and expands it using the rules
8
Bottom-up parsing begins with
Correct Answer
the input words and builds up towards the start symbol
9
The CKY algorithm requires the grammar to be in
Correct Answer
Chomsky Normal Form
10
The time complexity of the CKY algorithm for a sentence of length n is
Correct Answer
O(n³)
11
The Earley parser
Correct Answer
handles arbitrary context-free grammars using dynamic programming
12
A chart parser stores
Correct Answer
partial parse results in a chart to avoid recomputation
13
A shift-reduce parser uses
Correct Answer
a stack and an input buffer
14
Left recursion is a problem for
Correct Answer
top-down recursive descent parsers
15
In 'I saw the man with a telescope', the multiple possible parses are an example of
Correct Answer
structural (PP-attachment) ambiguity
16
A probabilistic context-free grammar (PCFG) is
Correct Answer
a context-free grammar whose rules have probabilities
17
In a PCFG, the probabilities of all rules with the same left-hand side
Correct Answer
sum to 1
18
A treebank grammar is obtained by
Correct Answer
reading the grammar rules off the annotated trees
19
In a phrase structure tree, NP stands for
Correct Answer
noun phrase
20
The head of a phrase is
Correct Answer
the word that determines the syntactic category of the phrase
21
A non-projective dependency tree has
Correct Answer
crossing dependency arcs
22
PARSEVAL measures are used to evaluate parsers with
Correct Answer
labelled precision and recall
23
Universal Dependencies is
Correct Answer
a cross-linguistically consistent dependency annotation scheme
24
Part-of-speech tags label words with
Correct Answer
their grammatical categories
25
The Viterbi algorithm applied to a PCFG finds
Correct Answer
the most probable parse
Fill in the Blanks
26
A corpus annotated with syntactic structure is called a __________.
Correct Answer
treebank
27
The Penn __________ is a well-known English annotated corpus.
Correct Answer
Treebank
28
CFG stands for Context-__________ Grammar.
Correct Answer
Free
29
__________-down parsing starts from the start symbol and expands the rules.
Correct Answer
Top
30
__________-up parsing starts from the input words.
Correct Answer
Bottom
31
The CKY algorithm needs the grammar in __________ Normal Form.
Correct Answer
Chomsky
32
The CKY algorithm runs in O(n^__________) time.
Correct Answer
3
33
The __________ parser uses dynamic programming and can parse any context-free grammar.
Correct Answer
Earley
34
A __________ parser stores partial results in a table to avoid recomputation.
Correct Answer
chart
35
PCFG stands for Probabilistic __________ Grammar.
Correct Answer
Context-Free
36
A dependency grammar represents the relation between a __________ and its dependents.
Correct Answer
head
37
In a parse tree, NP stands for __________ phrase.
Correct Answer
noun
38
Left __________ can make a top-down parser loop forever.
Correct Answer
recursion
39
The sentence 'I saw the man with a telescope' shows PP-__________ ambiguity.
Correct Answer
attachment
40
A shift-reduce parser uses a stack and an input __________.
Correct Answer
buffer