Tokenization and Morphological Analysis — past-year questions
Natural Language Processing (CSDO7011) · Semester 7 · Module 2 · AIML & Data Science
11 past-year questions on Tokenization and Morphological Analysis have appeared in Mumbai University CSDO7011 papers between 2024–2026, 13 times in total. Every question is shown in full below with its marks and repeat count. Model answers require a free account.
Questions asked on Tokenization and Morphological Analysis
- 1.
Explain porter stemmer algorithm with rules.
10M2× seenlast asked 2026 - 2.
Explain Porter's Stemming algorithm with example.
10M2× seenlast asked 2024 - 3.
Explain finite state transducer with suitable diagram and example.
10M1× seenlast asked 2026 - 4.
Differentiate between inflectional and derivational morphology
5M1× seenlast asked 2026 - 5.
Discuss pre-processing steps used in "toxic word identification" in semantic analysis application.
10M1× seenlast asked 2026 - 6.
Illustrate inflectional and derivational morphology with an example
10M1× seenlast asked 2025 - 7.
Define Affixes. Explain types of Affixes
5M1× seenlast asked 2025 - 8.
Differentiate between inflectional morphology and derivational morphology.
5M1× seenlast asked 2025 - 9.
Explain Porter Stemmer algorithm in detail.
10M1× seenlast asked 2025 - 10.
Explain preprocessing steps of NLP with example in detail
10M1× seenlast asked 2025 - 11.
Compare derivational and inflectional morphology with suitable example
5M1× seenlast asked 2024
Want the answers to these questions?
The questions above are free to read. Create a free account to get AI model answers for Natural Language Processing, a curated set of the questions that matter most, flashcard revision, and a study plan built around your exam date.