0% found this document useful (1 vote)
271 views2 pages

Be Computer Engineering Semester 7 2023 May Dloc III Natural Language Processing Rev 2019 C Scheme

This document appears to be an exam paper for a natural language processing course. It includes the course code, paper number, and subject heading. The main body is blank, suggesting this is an exam where the student would provide their answers or work. The main information conveyed is that this document serves as an exam paper for a natural language processing course.

Uploaded by

19OM DHEMBRE
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 (1 vote)
271 views2 pages

Be Computer Engineering Semester 7 2023 May Dloc III Natural Language Processing Rev 2019 C Scheme

This document appears to be an exam paper for a natural language processing course. It includes the course code, paper number, and subject heading. The main body is blank, suggesting this is an exam where the student would provide their answers or work. The main information conveyed is that this document serves as an exam paper for a natural language processing course.

Uploaded by

19OM DHEMBRE
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
You are on page 1/ 2

8

66

78
47
E2
Paper / Subject Code: 42175 / NATURAL LANGUAGE PROCESSING (DLOC - III)

F3

A7

E
25
E8

83
28

66

47

77
24

8E

F3

3E
25

7A
73

4E

28

66

78
A6

54
8E

A7
2

F
3

62
23

4E

28

7
Time: 3 hours Max. Marks: 80

36
1D

54
A

8E
2

8F
3

62
3
C5
N.B. (1) Question No. 1 is compulsory

4E
2

36
D

4
EE

E
32

25
51

8F
8
(2) Assume suitable data if necessary

23
83

67

4E

66
C

E2
D
EE
77

3A

F3
2
1
(3) Attempt any three questions from the remaining questions

E8
C5
7A

83

67

8
D2

E2
24
E
77

3A
54

51
E

73

E8
A
62

2
C
8

6
7

24
Q.1 Solve any Four out of Five 5 marks each

EE
36

77

8E
4

1
5

73
3
C5
8F

7A
2

83

4E
D2
6
Explain the challenges of Natural Language processing.

A6
a

EE
E2

77
54

32
1
3

23
C5
F

A
E8

62

83

7
b
8
Explain how N-gram model is used in spelling correction

A6
7

D
EE
E2

77
24

1
F3

23
5
7A
73

E8

83
c Explain three types of referents that complicate the reference resolution problem.

EC
28

D
A6

36

77
4

3A
54

51
E

3E
2

F
d Explain Machine Translation Approaches used in NLP.

7A
3

62
3

D2
EC
7

8
D2

78
6

E2

36
4

54

51
A

A7

3E
2

e Explain the various stages of Natural Language processing.


51

8F
3

E8

62
3

EC
7
D2

78
EC

47
A6

36
4

A7

3E
32

25
51
3E

F
8
23

67

66

78
EC

47
78

E2
D

Q.2 10 marks each 24


A

A7
25
1
A7

3E

8F
3

E8
3
C5

66
2

47
a What is Word Sense Disambiguation (WSD)? Explain the dictionary based approach to
78

A6

E2
47

1D

24
E

F3

25
A7

E
25

73

E8
23
5
3

28

66
Word Sense Disambiguation.
C
66

6
47

1D

24
EE
7

8E

F3
F3

A7
25

3
3
C5

b Represent output of morphological analysis for Regular verb, Irregular verb, singular noun,
83

4E

28
2
28

66

A6
47

1D
E
77

8E
2
8E

F3

E
25

plural noun Also Explain Role of FST in Morphological Parsing with an example
73
23
5
A

4E
EC
4E

28

66

A6
7

D
7
4

32
1
8E

F3

3E
32

23
5
A
2

67
EC
7

4E

28

8
7

1D
A6

77

3A
Q.3 10 marks each
54
8E

F3

3E
32

5
A
62
23

D2
EC
7

4E

78
7

a Explain the ambiguities associated at each level with example for Natural Language
A6

E2

36
1D

51
A7

3E
32

5
8F
E8

2
3
C5

EC
67

processing.
6
D2

78
47
2

6
24
EE

3A

A7

3E
25
51

F
3

b Explain Discourse reference resolution in detail.


67

6
D2

78
EC

47
E2

36
24
3A

A7
25
51
3E

8F
3

E8
67

66
D2
EC

47
78

E2
24
3A

F3

25

Q.4 10 marks each


51
7

3E

73

8
7A

28

66
D2
EC
78

a
A

8E
54

F3
2
51
7

3E

3
3
7A

28
D2
EC
78

A6

24

8E
4

51
7

3E
25

73
23
7A

4E
EC
6

78

6
D
36

A
4

32
1
7

3E
25

3
5
8F

7A

67
2
EC
6

78

D
E2

36

3A
4

1
7

3E
25

5
F

7A

D2
EC
28

78
36

51
8E

3E
25
F

7A

EC
4E

28

78
36

4
8E

A7

3E
2

25
F
73

4E

28

78
47
A6

36
8E

A7
2

25
F
73

4E

28

47
A6

36
8E
2

25
F
73
23

4E

28

66
A6
D

8E

F3
2

30651 Page 1 of 2
51

73
23

4E

28
EC

A6
D

8E
2
51

73
23

4E
EC

6
D

3A

EC51D23A67324E8E28F3662547A7783E
32
51
EC A6 E2 54 EE
51 73 8F 7A C5
D 24E 36 7 78 1D
23 8E 6 25 3E 23
EC A6 28 4 7A EC A6
51 73
2 F 7 51 7
D 23 4E 36
6 78 D2 32
4E
A6 8E
28
25
4
3E
EC 3 A6 8E
51 73 F 7A 7 28
D 24E 36 7 78 51 32 F3
6

a
b

b
23 D2 4E 66

Q.5

Q.6
8E 25 3E

30651
A6 28 4 EC 3A 8E 25
73 F 7A 67 28 47
2 4E 36 7 78 51 32 F3 A7
3A 8E 6 25 3E D2
3A
4E 66
25
78
3E
6 28 4 EC 8E
7A 47

Rules:
73 F 67 28 EC
24E 36 778 51 324 F3 A7 51
8E 6 25 3E D2 E8 66 78 D2
28 4 7A EC A6 3A E2 25
47
3E 3
32 F 7 51 73 67
3 8F3 A7
EC

10 marks each

10 marks each
36 24 7 51
4E 6 78 E 6 6 D2 8 24 D2
8E 25 3E 3 A 8 E 2 5 3 E E8 3
28 47 EC 6 2 4 7 E A 6 E2
F3 A7 5 1 73 8F A C5 7 3 8F
66 78 D 24 36 77 1 D 2 4 36
For given above corpus,

25 3E 23 E8 62 83 23 E8 62
M: Modal verb [can , will]

V:Verb [ watch, spot, pat]

47 EC A6 E2 54 EE 54
8 7 C A6 E2

“The man read this book”


A7 5 1 7 3 F A 5 7 3 8 F 7A
78 D 24 3 6 7 7 1D 2 4 3 77
3E 2 3 E 8 6 2 8 3 2 E 6 6 83
EC A 6 E2 5 4 E E 3 A 8 E 2 5
7 4 EE
Statement is “Justin will spot Will”

51 73
24
8F A 77
C5 67
32
28
F3 7 A C5
36 1D 4 6 77
D2
3A E 8E 6 25 8 3E 23 E8 62 83 1D
23
N: Noun [Martin, Justin, Will, Spot, Pat]

67 28 47 EC A6 E2 54 EE A6
32 F3 A7 5 1D 7 3 8 F 7A C 51 73

Explain Porter Stemmer algorithm with rules


24 36 77

Page 2 of 2
4E 66 78 E D 24
8E 25 3E 2 3 8 6 2 8 3 2
28 47 EC A 6 E 2 54 EE 3A
E8
F3 A7 5 73 8F 7 A C5 67
E2
8
1 D 24 1 3 2

Explain Maximum Entropy Model for POS Tagging


66 78 36 77 D 4E
25 3E 23 E8 62 83 23

EC51D23A67324E8E28F3662547A7783E
47 A6 E2 54 EE A 8E
Create Transition Matrix & Emission Probability Matrix

EC 6
A7 5 7 3 8 F 7A C 7 28
78 1D 24 36 77 51 3 2 F3
3E 23 E8 62 83 D2 4E 66
EC A6 E2 54 EE 3A 8E
Describe in detail Centering Algorithm for reference resolution.

51 73 8F 7A C5 67 28
D2 2 4E 3 66 77 1 D 32 F3

Explain information retrieval versus Information extraction systems


3A 8E 25 83 2 4E 66
47 EE 3A 8E 25
Apply Hidden Markov Model and do POS tagging for given statements

67 28 47
For a given grammar using CYK or CKY algorithm parse the statement

C5 67 28
32
4E
F3
66
A7
78 1 3 2 F 3
D2 4E 66
8E 25
47
3E 3 A 8 E 25
28
F3 A7
EC
5 6 73 2 8F 47
66 78 1 D 24 36 A7
Paper / Subject Code: 42175 / NATURAL LANGUAGE PROCESSING (DLOC - III)

25 3E 23 E8 62 78
47 EC A6 E2 54
A7 51 73 8F 7A
78
3E D 23
24
E8
36
62
77
83
EC A6 E2 54 E
51 7 32 8F3 7 A7
D2 4E 66 78
3A 8E 25 3E
4

You might also like