Scribd
Upload
9 views

NLP QB

Uploaded by

B06SHRUTI JAGTAP
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
9 views

NLP QB

Uploaded by

B06SHRUTI JAGTAP
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
You are on page 1/ 2

MUMBAI UNIVERSITY STUDENTS ASSOCIATION (MUSA)

QUESTION BANK OF NATURAL LANGAUGE PROCESSING


B.E SEM-VII BRANCH: COMPS FOR WINTER SESSION – NOVEMBER 2024

Q.1) Demonstrate lexical semantic analysis.

Q.2) Explain Discourse reference resolution in detail.

Q.3) Explain the various challenges and maximum entropy model for POS tagging.

Q.4) Explain porter steaming algorithm in detail.

Q.5) Explain Information Retrieval system and different steps in text processing for Information
Retrieval.

Q.5) Explain with suitable example all the relationship between words meaning.

Q.6) Explain the various challenges and stages of natural language processing.

Q.7) Explain Discover reference resolution in detail.

Q.8) Explain how conditional Random Field in NLP.

Q.9) Explain the types of referring expression and explain with the help of example.

Q.10) Explain the Lesk algorithm for Word sense Disambiguation with suitable example. (Note:
Dictionary based approach is (Lesk algorithm)

Q.11) Explain hidden Markov model and their limitation in detail.

Q.12) Explain Hobbs algorithm for pronoun resolution.

Q.13) Explain text summarization in detail.

Q.14) Explain the concept of Tokenization and Stemming in NLP.

Q.15) Explain in detail lexical semantic analysis using an example.

Q.16) Explain the ambiguities associated at each level with example for NLP.

Q.17) Explain the working and approaches used in NLP for machine translation systems.

Q.18) Explain FSA for noun and verbs and also explain the role of FSA in morphological analysis.

Q.19) Explain Yarowsky bootstrapping approach of semi supervised learning.

Q.20) Explain inflectional and derivational morphology with an example.

Q.21) Differentiate between the following:


i) Top-down and bottom-up approach of parsing.
ii) Syntactic and lexical ambiguity.
iii) Information retrieval Vs Information extraction system.

Q.22) Write a short note on:

i) Application of NLP.
ii) Semantic analysis in NLP
iii) N-gram model used in spelling correction.
iv) Explain all the parts of speech taggers.
v) Centering algorithm for reference resolution.

Numerical

Q.1) Apply Hidden Markov and do POS tagging for given statement.

Q.2) Viterbi Algorithm for the corpus statement an transition and conditional probability for a
bigram.

Q.3) CYK or CKY algorithm for parsing the statement

You might also like