NLP Natural Language Processing MCQ's




Question 61 :
Stochastic tagger also known as….........

  1. HM tagger
  2. RMM tagger
  3. HMM tagger
  4. Super tagger
  

Question 62 :
Semantic model is not used for

  1. The meaning of words
  2. Knowledge about structure of discourse
  3. Common sense knowledge about the topic
  4. POS tag of word
  

Question 63 :
How many uni-grams phrases can be generated from the following sentence, after performing following text cleaning steps: Stop word Removal and Replacing punctuations by a single space i. 'Delhi is the capital of but Mumbai is the financial capital of India.'

  1. 8
  2. 7
  3. 6
  4. 5
  

Question 64 :
Which Application Of Nlp Is Concerned With Intendifing Documents Relevant To A User'S Query?

  1. Speech Recognition
  2. Natural Language Interfaces To Db
  3. Information Extraction
  4. Information Retrieval
  

Question 65 :
Following are examples of Artificial Languages except

  1. C
  2. English
  3. Python
  4. Scilab
  

Question 66 :
Excuse Me. You Are Standing On My Foot. This Sentence Is Not Just Plain Assertion; It Is A Request To Someone To Get Off Your Foot. Is An Example Of?

  1. Discourse Analysis
  2. Word Level Analysis
  3. Semantic Analysis
  4. Syntax Analysis
  

Question 67 :
Morphotactics is a model of

  1. Spelling modifications that may occur during affixation
  2. All affixes in the English language
  3. How and which morphemes can be affixed to a stem
  4. Ngrams of affixes and stems
  

Question 68 :
In information retrieval, extremely common words which would appear to be of little value in helping select documents that are excluded from the index vocabulary are called:

  1. Stop Words
  2. Tokens
  3. Lemmatized Words
  4. Stemmed Terms
  

Question 69 :
History of Natural Language Processing does not include

  1. Automata Theory
  2. Compression Algorithms
  3. CFG by Chomsky
  4. Predicate and First Order Logic
  

Question 70 :
What is morphology?

  1. The study of the rules governing the sounds that form words
  2. The study of the rules governing sentence formation
  3. The study of the rules governing word formation
  4. The study of the rules governing sounds
  

Question 71 :
Push down automata accepts which language?

  1. Context sensitive language
  2. Context free language
  3. Recursive language
  4. Context Recursive language
  

Question 72 :
Ambiguity cannot occurs in

  1. Lexical
  2. Discourse
  3. Semantic
  4. Pragmatic
  

Question 73 :
What is 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. generate language
  

Question 74 :
Headlines in newspaper: Stolen gems found by Caves

  1. Anaphoric Ambiguity
  2. Lexical Ambiguity
  3. Syntax Ambiguity
  4. Unknown Ambiguity
  

Question 75 :
Linear sequnces of words are transformed into structure that show how the words are related to each other is the part of _____ Analysis.

  1. Semantic
  2. Syntactic
  3. Lexical
  4. Pragmatic
  

Question 76 :
The ratio of observed frequency of a particular sequence to the observed frequency of a prefix is:

  1. Normalized Frequency
  2. Relative Frequency
  3. Maximum Likelihood Estimation
  4. Markov Frequency
  

Question 77 :
Parts-of-Speech tagging determines ___________

  1. part-of-speech for each word dynamically as per meaning of the sentence
  2. part-of-speech for each word dynamically as per sentence structure
  3. all part-of-speech for a specific word given as input
  4. every thing mentioned above
  

Question 78 :
____ concerns how sentences are used in different situations and how use affects the interpretation of the sentence.

  1. Syntax
  2. Phonology
  3. Pragmatics
  4. Discourse
  

Question 79 :
It is a process of generating a concise and meaningful summary of text from multiple text resources such as books, news articles,blog posts, research papers, emails, and tweets.

  1. Automatic Summerization
  2. Insertion
  3. Updation
  4. Extraction
  

Question 80 :
Google Translate is one of the ________________ application.

  1. Machine translation
  2. Information Retrieval
  3. Information Extraction
  4. Summarisation
  

Question 81 :
In POS, using discriminative approach, direction of flow is from class to words

  1. Yes
  2. No
  3. Depends on sentence
  4. Randomly
  

Question 82 :
The statement ' eat a pizza' can be represented as

  1. NP → Verb VP
  2. VP → Verb PP
  3. VP → Verb NP
  4. VP → Verb NP PP
  

Question 83 :
________is the problem of selecting a sense for a word from a set of predefined possibilities.

  1. Shallow Semantic Analysis
  2. Discourse
  3. Word Sense Disambiguation
  4. Pragmatic
  

Question 84 :
Assume a corpus with 350 tokens in it. We have 20 word types in that corpus (V = 20). The frequency (unigram count) of word types 'short' and 'fork' are 25 and 15 respectively. Which of the following is the probability of 'short' (PMLE('short'))?

  1. 25/350
  2. 26/370
  3. 26/350
  4. 25/370
  

Question 85 :
Beverage = coffee - tea - shake, is example of ______

  1. Meronymy
  2. Hyponymy
  3. Polysemy
  4. Clines
  

Question 86 :
What is a meaning of Morphology?

  1. The study of word format
  2. The study of sentence format
  3. The study of syntax of sentence
  4. The study of semantics of sentence.
  

Question 87 :
Which of the following is the example of surface segmentation?

  1. Achievability = achievabil + ity
  2. Achievability = achiev + ability
  3. Achievability = Achieve + able + ity
  4. Achievability = achiev + abil + ity
  

Question 88 :
Which is most common algorithm used in English language for Stemming?

  1. Partial stemmer
  2. Porter stemmer
  3. faster stemmer
  4. Regular stemmer
  

Question 89 :
What is the main challenge of NLP?

  1. Handling Tokenization
  2. Handling Ambiguity of Sentences
  3. Cleaning Text
  4. Filtering Text
  

Question 90 :
Which Data Structure Is Used To Give Better Heuristic Estimates?

  1. Forwards State-Space
  2. Backward State-Space
  3. Planning Graph
  4. Planning Graph Algorithm
  
Pages