Natural Language Processing (NLP) SPPU Insem Question Paper Mar 2024
All 4 questions from this SPPU insem paper, as printed. Read them here or open the PDF.
- Subject code
- 317532B
- Pattern
- 2019 pattern
- Exam
- Insem
- Session
- Mar 2024
- Max. marks
- 30
- Time
- 1 Hour
- Semester
- II
- Paper code
- [6269]-328
Printed for: T.E. (Artificial Intelligence and Data Science) (Insem)
Instructions to the candidates
- Answer Q.1 or Q.2, Q.3 or Q.4.
- Neat diagrams must be drawn whenever necessary.
- Figures to the right indicate full marks.
- Make suitable assumptions wherever necessary.
Questions
Q1
- a)[5]
Explain the different levels of language analysis.
- b)[5]
List any three challenges in NLP. Provide solution to these challenges.
- c)[5]
Compare Rule based, Data Based and knowledge Based approaches of NLP.
Also asked:Mar 2023
OR- a)
Q2
- a)[5]
With a neat diagram describe how a typical NLP system is organised.
- b)[5]
Explain the working of Rule based approach for NLP.
- c)[5]
Explain why ambiguity is one of the core challenges of NLP. Give examples.
- a)
Q3
- a)[5]
Define Morphology. Explain stem and affix classes of Morphemes with examples.
- b)[5]
Explain Minimum Edit Distance Algorithm.
- c)[5]
Explain Morphological Parsing with Finite-State Transducers.
Also asked:Mar 2023
OR- a)
Q4
- a)[5]
Why do we need a 3-tape FST for morphological parsing. Illustrate with an example.
- b)[5]
Explain the spelling Correction approaches in NLP.
- c)[5]
Explain the use of Finite State Automata for Morphological Analysis.
- a)