B.TechSemester 82023-24Natural Language ProcessingKOE088

Natural Language Processing (KOE088) - AKTU Question Paper 2023-24

B.Tech · Semester 8 · Free PDF Download

This is the official AKTU Natural Language Processing Previous Year Question Paper for B.Tech Semester 8, academic session 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech

Semester:Semester 8

Session:2023-24

University:AKTU / UPTU

Rate this paper

Questions Asked in 2023-24

Natural Language Processing (KOE088) — complete question paper · 100 marks · 3 Hours

Section AAttempt all q u e s t i o n s i n b r i e f . 2 x 10 = 20

a
Explain Language Modelling. 02 2
b
Discuss pragmatic analysis. 02 1
c
Discuss about the concept of knowledge. 02 2
d
Briefly describe knowledge representation. 02 1
e
Explain Stochastic Part-of-Speech tagging 02 3
f
What is the concept of Parsing? 02 3
g
Explain Frequency and Amplitude 02 4
h
Discuss Auxiliary verb with suitable example. 02 4 i. Define Dependency tags with example 02 5 j. Explain TF and IDF 02 5

Section BAttempt any three o f t h e f o l l o w i n g : 3 x 10 = 30

a
What is the Concept of Evaluatin g Language Understanding Systems? 10 1
b
How the knowledge is represented using Semantic Networks and Production Rules? State with example
c
Describe Feature Systems and Augmented Grammar under Grammars and Parsing
d
Discuss the process of hand ling questions in context free grammar. Explain with suitable example
e
Explain Viterbi Search Algorithm with an example. 10 5

Section CAttempt any one p a r t o f t h e f o l l o w i n g : 1 x 10 = 10

a
Discuss in brief about the c oncept of Probabilistic Context- Free Grammars
b
Explain the different steps i n natural language understandin g in detail. 10 1
a
Discuss about the following: I. Transition Network Grammars. II. Top- Down Chart Parsing
b
Discuss different types of knowledge. 10 2
a
State Dependency parsing. Explain the working of Shift- reduce parsing in Dependency parsing
b
Discuss Transition Network Grammars and Recursive Transition Networks. Also draw the Transition Network for the following grammar: NP→ART NP1, NP→DET NP1, NP1→ADJ NP1, NP1→N
a
State Encoding Uncertainty. For the given grammar draw the State Transition diagram using Shift Reduce Parsing. S→NP VP, NP→ART N, VP→AUX V NP , VP→V NP
b
Discuss about the database interface under the Natural Language Understanding
a
Discuss the concept of probabilistic context free grammar in detail 10 5
b
Explain hidden Markov model with Baum-Welch parameter re-estimation. Also elaborate on its implementation issues

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Repeated Questions — KOE088

Questions that appeared in more than one session, found by comparing 4 years of Natural Language Processing papers (2021-22, 2022-23, 2023-24, 2024-25)

Discuss in brief about the c oncept of Probabilistic Context- Free Grammars

Appeared in: 2021-22 · 2022-23 · 2023-24

Discuss the concept of probabilistic context free grammar in detail 10 5

Appeared in: 2021-22 · 2022-23 · 2023-24

Discuss pragmatic analysis. 02 1

Appeared in: 2022-23 · 2023-24

Discuss about the concept of knowledge. 02 2