0% found this document useful (0 votes)
15 views2 pages

NLP 2

The document is an examination paper for a course on Natural Language Processing, consisting of 8 questions divided into pairs where candidates must choose one from each pair. It covers topics such as Context Free Grammar, dependency parsing, word senses, machine translation, information retrieval, and information extraction. The exam is structured to allow for detailed explanations and short notes on various concepts, with a total duration of 2.5 hours and a maximum score of 70 marks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
15 views2 pages

NLP 2

The document is an examination paper for a course on Natural Language Processing, consisting of 8 questions divided into pairs where candidates must choose one from each pair. It covers topics such as Context Free Grammar, dependency parsing, word senses, machine translation, information retrieval, and information extraction. The exam is structured to allow for detailed explanations and short notes on various concepts, with a total duration of 2.5 hours and a maximum score of 70 marks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Total No. of Questions : 8] SEAT No.

8
23
PB-3801 [Total No. of Pages : 2

ic-
[6262]-60

tat
1s
T.E. (Artificial Intelligence and Data Science)

1:3
02 91
NATURAL LANGUAGE PROCESSING

9:4
0
(2019 Pattern) (Semester - II) (317532B) (Elective-II)

40
4/0 13
0
5/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:


E

1) Solve questions Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7or Q.8
82

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicates full marks.
16

tat
4) Assume Suitable data if necessary.
8.2

1s
.24

1:3
91
Q1) a) Explain Context Free Grammar and Grammar rules For English in detail.
49

9:4
[8]
30
40

b) Write short note based on constituency parsing. [9]


01
02
5/2

i) Ambiguity
GP
4/0

ii) Partial Parsing


CE
82

8
iii) CCG Parsing

23
.23

ic-
OR
16

tat
Q2) a) Elaborate dependency relations and dependency formalism of dependency
8.2

1s

parsing. [8]
.24

1:3
91

b) Write short note based on constituency parsing. [9]


49

9:4
30

i) Ambiguity
40
01

ii) Span based neural constituency parsing


02
5/2
GP

iii) CKY Parsing


4/0
CE
82

Q3) a) Explain Word senses and relation between various senses. [8]
.23

b) Explain lexicon for sentiment-Emotions, sentiment and affect lexicons,


16

Creating Affect Lexicons by Human Labeling with suitable example.[9]


8.2

OR
.24
49

P.T.O.
Q4) a) Write down about WordNet and wordsense disambituition in detail. [8]

8
23
b) Explain lexicon for sentiment-Semi-supervised Induction of Affect

ic-
Lexicons, Supervised Learning of Word Sentiment, Using Lexicons for

tat
Sentiment. Recognition with suitable example. [9]

1s
1:3
02 91
9:4
Q5) a) Explain need ot Machine Translation (MT) with suitable example. Which

0
40
are the problems of Machine Translation? [9]
4/0 13
b) Write short note on:
0
5/2
.23 GP

i) Knowledge based MT System [5]


E

ii) Encoder-decoder architecture [4]


82

8
C

23
OR

ic-
16

tat
Q6) a) Explain Machine Translation (MT) approaches with suitable example.
8.2

1s
Describe Direct Machine Translation in detail. [9]
.24

1:3
91
b) Write short note on:
49

9:4
30

i) Statistical Machine Translation (SMT) [5]


40
01

ii) Neural Machine Translation [4]


02
5/2
GP
4/0

Q7) a) Elaborate Information retrieval-Vector space Model in detail. [9]


CE
82

8
23
b) Write short note on: [9]
.23

ic-
16

i) Categorization
tat
8.2

1s

ii) Summarization
.24

1:3
91

iii) Sentiment Analysis


49

9:4
30

OR
40
01
02

Q8) a) Discuss Information Extraction using Sequence Labelling in detail. [9]


5/2
GP

b) Write short note on: [9]


4/0

i) Named Entity Recognition.


CE
82

ii) Analyzing text with NLTK


.23
16

iii) Chatbot using Dialogflow


8.2


.24
49

[6262]-60 2

You might also like