Papers / AKTU / B.Tech / Natural Language Processing
AKTU · B.Tech · 7th semester

AKTU Natural Language Processing (KCS072) Question Paper 2022-23

UniversityDr. A.P.J. Abdul Kalam Technical University (AKTU), Lucknow
CourseB.Tech, Semester VII
SubjectNatural Language Processing (KCS072)
ExamTheory Examination 2022-23 (odd semester)
Time · Marks3 hours · 100 marks
SourceAKTU question paper, from the ABESIT question paper bank
View original PDF Other years

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

Section A

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

  1. Explain Language Modelling.
  2. What are the different issues and problems in NLP?
  3. Explain Treebank Corpus.
  4. Differentiate between syntax and semantics.
  5. Explain Context Free Grammars.
  6. How spelling corrections work? Explain.
  7. Explain Frequency and Amplitude.
  8. Explain transcription.
  9. What is Log–Spectral Distance?
  10. Explain TF and IDF.

Section B

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

  1. We are given the following corpus: <s> I am Sam </s> <s> Sam I am </s> <s> I do not like green eggs and Sam </s> Using a bigram language model with Laplace smoothing, what is P(Sam |am)? Include <s> and </s> in your counts just like any other token.
  2. Explain Context Free Grammar. Draw tree structure for the following sentence: I need to fly between New Delhi and Mumbai.
  3. Explain nearest neighbour algorithm using contextual word embeddings. Take example to explain.
  4. Write short notes on: (i) Short-Time Fourier Transform (ii) Linear Predictive Coding (LPC).
  5. Explain Viterbi Search Algorithm with an example.

Section C

Q3

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

  1. Write an algorithm for parsing a finite-state transducer using the pseudo code. Explain the algorithm with an example.
  2. Differentiate between Bottom-up and Top-down parsing. What algorithms are used for each of these types of parsing?

Q4

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

  1. Draw a tree structure for the following statement: Rachael Ray finds inspiration in cooking her family and her dog Write the Context Free Grammar (CFG) for the above statement.
  2. Explain Cocke-Kasami-Younger (CKY) algorithm. Explain it with an example.

Q5

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

  1. Explain about Word Sense Disambiguation and Distributional semantics. Also explain about the path length problem in with an example.
  2. Define the issues in Information Content-BasedSimilarity Measures with example. Elaborate on the approachused in similarity measure.

Q6

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

  1. Define Articulatory Phonetics. Also explain production and classification of speech sounds in detail. Give examples.
  2. Write regular expressions for the following languages. (i) the set of all alphabetic strings; (ii) the set of all lower-case alphabetic strings ending in a b; (iii) the set of all strings from the alphabet a,b such that each a is immediately preceded by and immediately followed by a b; Explain how these regular expressions will be used in speech processing.

Q7

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

  1. Explain different feature extraction and pattern comparison techniques used in speech analysis. Also elaborate on likelihood distortions, and spectral distortion, in detail.
  2. Explain hidden Markov model with Baum-Welch parameter re-estimation. Also elaborate on its implementation issues.

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.