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) — extracted question text · 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
- aExplain Language Modelling. 02 2
- bDiscuss pragmatic analysis. 02 1
- cDiscuss about the concept of knowledge. 02 2
- dBriefly describe knowledge representation. 02 1
- eExplain Stochastic Part-of-Speech tagging 02 3
- fWhat is the concept of Parsing? 02 3
- gExplain Frequency and Amplitude 02 4
- hDiscuss 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
- aWhat is the Concept of Evaluatin g Language Understanding Systems? 10 1
- bHow the knowledge is represented using Semantic Networks and Production Rules? State with example
- cDescribe Feature Systems and Augmented Grammar under Grammars and Parsing
- dDiscuss the process of hand ling questions in context free grammar. Explain with suitable example
- eExplain 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
- aDiscuss in brief about the c oncept of Probabilistic Context- Free Grammars
- bExplain the different steps i n natural language understandin g in detail. 10 1
- aDiscuss about the following: I. Transition Network Grammars. II. Top- Down Chart Parsing
- bDiscuss different types of knowledge. 10 2
- aState Dependency parsing. Explain the working of Shift- reduce parsing in Dependency parsing
- bDiscuss 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
- aState 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
- bDiscuss about the database interface under the Natural Language Understanding
- aDiscuss the concept of probabilistic context free grammar in detail 10 5
- bExplain 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. Check the original PDF for equations, diagrams and complete wording. Extracted: 2026-08-23.
Natural Language Processing — Other Year Papers
AKTU Natural Language Processing PYQs from other sessions
More B.Tech Semester 8 (2023-24) Papers
Other subjects from same semester and session
Bio Medical Signal Processing2023-24Introduction To Smart Grid2023-24Fundamentals Of Drone Technology2023-24Computerized Process Control2023-24Modeling Of Field Effect Nano Devices2023-24Electric Vehicles2023-24Rural Development Administration And Planning2023-24Human Values In Buddha And Jain Darshan2023-24
View all B.Tech Semester 8 2023-24 papers →Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo