☑ MCQ PRACTICE

Natural Language Processing Unit 3

Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.

📚 Natural Language Processing
📖 Unit 3
🎯 MCQs

Natural Language Processing - Unit-3

1
Ambiguity resolution in parsing means
Agenerating all parses
Bchoosing the most likely parse among many possible parses
Cremoving the grammar
Dtranslating the sentence
Correct Answer choosing the most likely parse among many possible parses
2
A PCFG resolves ambiguity by
Aselecting the shortest parse
Bselecting a random parse
Crejecting every parse
Dselecting the parse with the highest probability
Correct Answer selecting the parse with the highest probability
3
A lexicalized PCFG
Aremoves all probabilities
Buses no grammar rules
Cannotates non-terminals with their head words
Dworks only for speech
Correct Answer annotates non-terminals with their head words
4
Parse reranking means that
Aa second model reorders the n-best parses produced by a first parser
Bthe sentence is reversed
Cthe grammar is deleted
Dthe parser is trained twice on the same sentence
Correct Answer a second model reorders the n-best parses produced by a first parser
5
Discriminative parsing models
Ause no training data
Bcan only parse speech
Clearn from features to separate correct parses from incorrect ones
Dignore the sentence
Correct Answer learn from features to separate correct parses from incorrect ones
6
A major challenge of parsing morphologically rich languages is
Atoo few word forms
Bdata sparsity because of the large number of word forms
Cno sentences
Dno syntax at all
Correct Answer data sparsity because of the large number of word forms
7
Which of the following is a treebank for Czech?
APenn Treebank
BPrague Dependency Treebank
CBrown Corpus
DReuters Corpus
Correct Answer Prague Dependency Treebank
8
Languages with free word order are hard for parsers based mainly on
Afixed constituent order
Bdependency relations
Cmorphology
Dtokenization
Correct Answer fixed constituent order
9
Semantic parsing is the task of
Asplitting words into letters
Bmapping natural language text to a formal meaning representation
Ccounting syllables
Dcorrecting spelling
Correct Answer mapping natural language text to a formal meaning representation
10
Semantic interpretation includes tasks such as
Aimage compression
Bdatabase backup
Cword sense disambiguation, entity resolution and predicate-argument analysis
Dfont selection
Correct Answer word sense disambiguation, entity resolution and predicate-argument analysis
11
Word sense disambiguation (WSD) is
Adetermining which sense of a word is used in a given context
Bsplitting a word into morphemes
Ctranslating a word
Dcounting word frequencies
Correct Answer determining which sense of a word is used in a given context
12
WordNet is
Aa speech corpus
Ba parsing algorithm
Ca lexical database in which words are grouped into synsets
Da neural network
Correct Answer a lexical database in which words are grouped into synsets
13
A synset is
Aa set of antonyms
Ba set of sentences
Ca set of grammar rules
Da set of synonyms that share a meaning
Correct Answer a set of synonyms that share a meaning
14
The Lesk algorithm disambiguates a word by
Ameasuring the overlap between dictionary definitions and the context
Bcounting its letters
Cparsing the sentence
Dusing a stemmer
Correct Answer measuring the overlap between dictionary definitions and the context
15
Supervised WSD requires
Asense-annotated training data
Bno data at all
Conly unlabelled speech
Donly a stop-word list
Correct Answer sense-annotated training data
16
Polysemy means that a word
Ahas no meaning
Bhas several related senses
Chas only one meaning
Dis always a noun
Correct Answer has several related senses
17
Homonyms are words that
Ahave identical meanings
Bhave the same form but unrelated meanings
Chave opposite meanings
Dhave no form
Correct Answer have the same form but unrelated meanings
18
A hypernym is
Aa more general term, such as 'animal' for 'dog'
Ba more specific term
Can opposite term
Da spelling variant
Correct Answer a more general term, such as 'animal' for 'dog'
19
A hyponym is
Aa more general term
Ban opposite term
Ca misspelled word
Da more specific term, such as 'dog' for 'animal'
Correct Answer a more specific term, such as 'dog' for 'animal'
20
Rule-based semantic parsing systems depend on
Aonly unlabelled data
Bonly neural embeddings
Chand-written rules
Dno knowledge
Correct Answer hand-written rules
21
Unsupervised WSD typically works by
Ausing sense-labelled corpora only
Btranslating the word
Cclustering the contexts in which a word occurs
Ddeleting ambiguous words
Correct Answer clustering the contexts in which a word occurs
22
SemCor is
Aa speech recognizer
Ba parser
Ca stemmer
Da corpus in which words are tagged with WordNet senses
Correct Answer a corpus in which words are tagged with WordNet senses
23
Recognising that 'Obama' and 'he' refer to the same person is called
Aword sense disambiguation
Btokenization
Cstemming
Dcoreference resolution
Correct Answer coreference resolution
24
Semi-supervised systems use
Aa small amount of labelled data together with a large amount of unlabelled data
Bno data at all
Conly labelled data
Donly rules
Correct Answer a small amount of labelled data together with a large amount of unlabelled data
25
Multilingual parsing is difficult because languages differ in
Athe colour of the text
Bthe number of pages
Cthe font size
Dword order and morphology
Correct Answer word order and morphology

Fill in the Blanks

26 WSD stands for Word __________ Disambiguation.
Correct Answer Sense
27 __________ is a lexical database of English organised into synsets.
Correct Answer WordNet
28 A set of synonyms that share a meaning is called a __________.
Correct Answer synset
29 The __________ algorithm disambiguates a word using the overlap between definitions and context.
Correct Answer Lesk
30 A word that has several related senses shows __________.
Correct Answer polysemy
31 A hypernym is a more __________ term than its hyponym.
Correct Answer general
32 A hyponym is a more __________ term than its hypernym.
Correct Answer specific
33 A PCFG resolves ambiguity by choosing the parse with the highest __________.
Correct Answer probability
34 A lexicalized PCFG annotates non-terminals with __________ words.
Correct Answer head
35 Parse __________ reorders the n-best parses produced by a first parser.
Correct Answer reranking
36 The Prague Dependency Treebank is a treebank for the __________ language.
Correct Answer Czech
37 Semantic __________ maps natural language text to a formal meaning representation.
Correct Answer parsing
38 __________ resolution links expressions that refer to the same entity.
Correct Answer Coreference
39 Languages with many word forms suffer from data __________.
Correct Answer sparsity
40 WSD that uses no sense-labelled data is called __________ WSD.
Correct Answer unsupervised
← Back to All MCQs