• Attempt any five questions.
• All questions carry equal marks.
List and explain the challenges of natural language processing.
Discuss in detail the basic regular expression patterns with examples.
Write and explain the minimum edit distance algorithm.
Explain how is perplexity calculated in evaluating N-grams.
Discuss in detail the Hidden Markov Model.
What is ambiguity in parse tree? Explain with an example.
Explain in detail about dependency grammar.
Discuss in detail Probabilistic CYK.
Explain in detail about quantifiers with an example.
Explain the following word sense disambiguation methods:
i) Supervised
ii) Dictionary
iii) Thesaurus
Describe transfer model of machine translation. List out its three phases.
What are the commercial uses of NLP? Explain in detail.
Write short notes on any two of the following: a) Finite-State Automata b) Laplace Smoothing c) Probabilistic context-free grammar d) Word sense
