NLP Natural Language Processing MCQ's




Question 451 :
Anaphoric relations hold between _______ phrases that refer to the same person or thing.


  1. Verb
  2. Noun
  3. Preposition
  4. Adjective
  

Question 452 :
The System Recognizes If Emails Belong In One Of Three Categories (Primary, Social, Or Promotions) Based On Their Contents. What This Application Is Called?


  1. Smart Assistant
  2. Email Filters
  3. Predictive Text
  4. Language Translation
  

Question 453 :
Which Of The Following Is Used To Mapping Sentence Plan Into Sentence Structure?


  1. Text Planning
  2. Sentence Planning
  3. Text Realization
  4. Stemming
  

Question 454 :
To evaluate the effectiveness of an IR system the output from a standard query executed against the test IR system is compared with the known output from a:


  1. internet collection
  2. reference book
  3. separate IR system.
  4. standard test collection
  

Question 455 :
Regular expressions are combination of simple units as given in options, select incorrect unit.


  1. Character or string
  2. Concatenation
  3. Kleen star
  4. Conjunction
  

Question 456 :
Rule for removing suffix will be given in form '(Condition) S1 ® S2', where S1 is suffix. If the condition is '(*d)' then which of the following is correct interpretation?


  1. The stem ends with S.
  2. The stem contain vowel.
  3. The stem ends with a double consonant (eg. -TT, -SS)
  4. The stem ends CVC, where second C is not W, X, or Y
  

Question 457 :
Who is the father of NLP?


  1. Enjamin Bandler
  2. Richard Bandler
  3. Elijah Bandler
  4. Marvin Minsky
  

Question 458 :
Solve the equation according to the sentence 'I am planning to visit New Delhi to attend Analytics Vidhya Delhi Hackathon'. A = (# of words with Noun as the part of speech tag) B = (# of words with Verb as the part of speech tag) C = (# of words with frequency count greater than one) What are the correct values of A, B, and C?


  1. 5, 5, 2002
  2. 5, 5, 2000
  3. 7, 5, 2001
  4. 7, 4, 2002
  

Question 459 :
Words automatic, automation, are converted to automat. This the output of which process.


  1. FSA
  2. Lemmatization
  3. Stemming
  4. Parser
  

Question 460 :
Given a sound clip of a person or people speaking, determine the textual representation of the speech.


  1. Text-to-speech
  2. Speech-to-text
  3. Speech recognition
  4. speech generation
  

Question 461 :
For machine learning based tagger, which is required


  1. Knowledge database of rules required
  2. Knowledge database of rules not required
  3. Learns automatically all rules
  4. Knowledge database of rule, learning from database
  

Question 462 :
Which is concerned with retrieval from a document collection where documents in multiple languages co-exist and need to be retrieved to a query in any language.


  1. CLIR
  2. BLIR
  3. MLIR
  4. Monolingual IR
  

Question 463 :
Over-stemming can also be regarded as __________________.


  1. False-Positives
  2. False-Negative
  3. True-Positive
  4. True-Negative
  

Question 464 :
Phrase structure riles are of the form A->BC which states that


  1. A is directed towards BC
  2. A implies B and C
  3. Constituents A can be written as two constitutes B and C
  4. BC holds value of A
  

Question 465 :
Consider the statement The students went to class . Assign POS tags for the statement.


  1. DT NN VB P NN
  2. DT NN NN P NN
  3. NN NN VBG P NN
  4. DT NN VB P DT
  

Question 466 :
What are the most common and the rarest term of the corpus?


  1. t5, t1
  2. t5, t6
  3. t4, t6
  4. t3, t5
  

Question 467 :
CFG consist of


  1. Set of rules
  2. Set of productions
  3. Order of elements
  4. rules ,productions,order of element
  

Question 468 :
Morphological Segmentation?


  1. Does Discourse Analysis
  2. Separate words into individual morphemes and identify the class of the morphemes
  3. Is an extension of propositional logic
  4. Analysis
  

Question 469 :
How many bi-grams can be generated from given sentence:- This is NLP book.?


  1. 3
  2. 2
  3. 4
  4. 1
  

Question 470 :
In a relation between the entities the type and condition of the relation should be specified. That is called as______attribute.


  1. Desciptive
  2. Derived
  3. Recursive
  4. Relative
  

Question 471 :
Mango is hyponym of


  1. Forest
  2. Human
  3. Fruits
  4. Sweet
  

Question 472 :
Given a sentence S=w1 w2 w3 ... wn, to compute the likelihood of S using a bigram model. How would you compute the likelihood of S?


  1. Calculate the conditional probability of each word in the sentence given the preceding word and add the resulting numbers
  2. Calculate the conditional probability of each word in the sentence given the preceding word and multiply the resulting numbers
  3. Calculate the conditional probability of each word given all preceding words in a sentence and add the resulting numbers
  4. Calculate the conditional probability of each word given all preceding words in a sentence and multiply the resulting numbers
  

Question 473 :
Choose from the following areas where NLP can be useful.


  1. Automatic Text Summarization
  2. Automatic Question-Answering Systems
  3. Information Retrieval
  4. All of the above
  

Question 474 :
Which of the following is the example of overstemming?


  1. Univers
  2. Universe
  3. Universal
  4. University
  

Question 475 :
Which of the following techniques is most appropriate to get root of word without considering word syntax


  1. Stemming
  2. Lemmatization
  3. Stop word removal
  4. Rooting
  

Question 476 :
How is the word changing lematized?


  1. chang
  2. changin
  3. chan
  4. change
  

Question 477 :
In the English language inflectional morphemes can be...


  1. Prefixes, Suffixes and Infixes
  2. Suffixes only
  3. Infixes Only
  4. Prefixes, Suffixes and Infixes
  

Question 478 :
The basic operation of a web browser is to pass a request to the web server. This request is an address for a web page and is known as the:


  1. UAL: Universal Address Locator
  2. HTML: Hypertext Markup Language
  3. URL: Universal Resource Locator
  4. HTTP: Hypertext transfer protocol
  

Question 479 :
Famous Stemming algorithm


  1. Porter’s Stemmer algorithm
  2. Lovins Stemmer
  3. Dawson Stemmer
  4. Snowball Stemmer:
  

Question 480 :
Which of the following are Anchors in regular expression?


  1. * and +
  2. ^ and $
  3. ? and {}
  4. /d and /w
  
Pages