Paper/ SubjectCode: 42175 /NATURAL LANGUAGE PROCESSING(DLOC- III)
Time:3Hours Max.Marks:80
=====================================================================
N.B.(1) Question No. 1is compulsory
(2) Assume suitable data if necessary
(3) Attempt any three questions from remaining questions
Q.1 Any Four 20[M]
a Differentiate between Syntactic ambiguity and Lexical Ambiguity. [5M]
[Mod-4]
b Define affixes. Explain the types of affixes. [5M]
[Mod-2]
c Describe open class words and closed class words in English with examples. [5M]
[Mod-2]
d What is rule base machine translation? [5M]
[Mod-6]
e Explain with suitable example following relationships between word meanings. [5M]
[Mod-4]
Homonymy,Polysemy,Synonymy, Antonymy
f Explain perplexity of any language model. [5M]
[Mod-1]
Q.2 a) Explain the role of FSA in morphological analysis? [Mod-2]
b) Explain Different stage involved in NLP process with suitable example. [10M]
[Mod-1]
Q.3 a) Consider thefollowing corpus [5M]
<s> Itellyoutosleepandrest </s>
<s> Iwouldliketosleepforan hour</s>
<s>Sleephelps onetorelax</s>
List all possible bigrams. Compute conditional probabilities and predict the next
ord for the word “to”. [Mod-2]
b) Explain Yarowsky bootstrapping approach of semi supervised learning [5M]
[Mod-4]
c) What is POS tagging? Discuss various challenges faced by POS tagging. [10M]
[Mod-3]
Q.4 a) What are the limitations of Hidden Markov Model? [5M]
b)Explain the different steps in text processing for Information Retrieval [5M]
[Mod-6]
c) Compare top-down and bottom-up approach of parsing with example. [10M]
[Mod-3]
Q.5 a) What do you mean by word sense disambiguation(WSD)?Discuss dictionary based [10M]
approach for WSD. [Mod 4]
b) Explain Hobbs algorithm for pronoun resolution. [10M]
[Mod-5]
Q.6 a) Explain Text summarization in detail. [10M]
[Mod-6]
b) Explain Porter Stemming algorithm in detail [Mod 2] [10M]
[Mod-2]
2EDB91068CE737F5A29FB8A844D0A882
*****************
16298
2EDB91068CE737F5A29FB8A844D0A882