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

Al3501 - NLP Iat Set 2

This document is a Continuous Assessment Test for the B.E (CSE) AI&ML program at Shanmuganathan Engineering College, focusing on Natural Language Processing. It includes various questions divided into three parts, covering definitions, applications, models, and techniques related to NLP. The test is scheduled for September 9, 2025, with a total of 60 marks available.

Uploaded by

Priyanga Devi
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)
279 views2 pages

Al3501 - NLP Iat Set 2

This document is a Continuous Assessment Test for the B.E (CSE) AI&ML program at Shanmuganathan Engineering College, focusing on Natural Language Processing. It includes various questions divided into three parts, covering definitions, applications, models, and techniques related to NLP. The test is scheduled for September 9, 2025, with a total of 60 marks available.

Uploaded by

Priyanga Devi
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

Reg. No.

SHANMUGANAHAN ENGINEERING COLLEGE


(Accredited by NAAC & ISO 9001:2015 Certified Institution)
ARASAMPATTI – 622 507
CONTINUOUS ASSESSMENT TEST-I
(SET2)
BRANCH : B.E (CSE)AI&ML SUB CODE : AL3501
YEAR/SEM : III/V SUB TITLE : Natural Language Processing
DATE : 09-09-2025 Q.P SETTER : Mrs. S.Priyanga Devi AP/CSE

TIME : 9.30 am-11.10 am MAX. MARKS: 60

Answer All Questions


PART – A (10 X 2 = 20)
1. Define Natural Language Processing.?
2. Mention two applications of NLP.
3. What is Grammar Based Model?
4. Define Transducer for Lexicon Rule
5. What is Minimum Edit Distance?
6. What is Tokenization?
7. Give one example of pragmatic analysis in NLP
8. Define perplexity in NLP
9. Define unigram and bigram with examples
10. Define n-gram Smoothing
PART – B (2X 13 = 26)

11. (a) Explain the architecture of an NLP system with neat diagram. (13)
OR
(b) What are Language Model in NLP and Explain about its work (13)

12. (a) Describe different smoothing techniques (eg., Laplace/add-one smoothing,


Backoff, interpolation ) (13)
OR
(b) Compare Rule-based, Stochastic and Transformation- Based POS Tagging (13)
Techniques.
PART – C (1X 14 = 14)

13. (a) Explain in detail the Minimum Edit Distance


Convert the String “KITTEN” into “SITTING ” (14)
OR
(b) Explain Details about Hidden Markov and Write the program for Hidden (14)
Markov Input is "I like natural language processing"

STAFF IN CHARGE HoD(I/C)-CSE

You might also like