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

Note: Attempt all Sections. If require any missing data; then choose suitably.

Section A

Q1. Attempt all questions in brief · 2 × 10 = 20 marks

1. Explain Language Modelling.
2. Discuss pragmatic analysis.
3. Discuss about the concept of knowledge.
4. Briefly describe knowledge representation.
5. Explain Stochastic Part-of-Speech tagging
6. What is the concept of Parsing?
7. Explain Frequency and Amplitude
8. Discuss Auxiliary verb with suitable example.
9. Define Dependency tags with example
10. Explain TF and IDF

Section B

Q2. Attempt any three of the following · 3 × 10 = 30 marks

1. What is the Concept of Evaluating Language Understanding Systems?
2. How the knowledge is represented using Semantic Networks and Production Rules? State with example.
3. Describe Feature Systems and Augmented Grammar under Grammars and Parsing.
4. Discuss the process of handling questions in context free grammar. Explain with suitable example.
5. Explain Viterbi Search Algorithm with an example.

Section C

Q3

Attempt any one part of the following · 1 × 10 = 10 marks

1. Discuss in brief about the concept of Probabilistic Context-Free Grammars.
2. Explain the different steps in natural language understanding in detail.

Q4

Attempt any one part of the following · 1 × 10 = 10 marks

1. Discuss about the following:
   I. Transition Network Grammars.
II. Top- Down Chart Parsing.
2. Discuss different types of knowledge.

Q5

Attempt any one part of the following · 1 × 10 = 10 marks

1. State Dependency parsing. Explain the working of Shift- 10 3 reduce parsing in Dependency parsing.
2. 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

Q6

Attempt any one part of the following · 1 × 10 = 10 marks

1. 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
2. Discuss about the database interface under the Natural Language Understanding.

Q7

Attempt any one part of the following · 1 × 10 = 10 marks

1. Discuss the concept of probabilistic context free grammar in detail
2. Explain hidden Markov model with Baum-Welch parameter re-estimation. Alsoelaborate on its implementation issues.

Short on time? See the most repeated AKTU Natural Language Processing questions across all years.

Other years

More AKTU Natural Language Processing papers on LearnAIFast.

This paper is reproduced for study purposes only. Copyright belongs to AKTU. Source: the question paper bank of ABES Institute of Technology, an AKTU-affiliated college. If you own the copyright and want it removed, email learnwithskillnest@gmail.com and we will take it down.