FirstRanker's choice
Paper ID: 110856
Roll No.
--- Content provided by FirstRanker.com ---
B. TECH.
Theory Examination (Semester-VIII) 2015-16
NATURAL LANGUAGE PROCESSING
Time: 3 Hours
Max. Marks: 100
--- Content provided by FirstRanker.com ---
Section - A
- Attempt all questions from this section. (2×10=20)
- Explain terms baseline and ceiling in evaluation of NLP systems.
- Explain part-of-speech tagging with example.
- Differentiate between Left associative grammar and Ambiguous grammars.
- Define pragmatics? Give example.
- Explain deterministic parsing for human preferences in NLP.
- Explain the graph models and optimization techniques used in semantics with example.
- "Kathy Jumped the horse" Parse the above sentence using top-down & bottom-up Methods.
- Represent a noun phrase segment of a transition net- work.
- Define the word senses and ambiguity with suitable ex- ample. ral language understanding.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
Section-B
Attempt any five questions from this section. (5×10 = 20)
-
- Give an algorithm for pronoun resolution and explain it with an example.
- Investigate two of the more popular search engines and determine with kind of morphological analysis.
--- Content provided by FirstRanker.com ---
Section-C
Note: Attempt any two questions from this section. (15×2=30)
- Discuss in detail the syntactic & semantic constraints on Conference.
- Write short notes on :
- Human preferences in parsing
- Natural language processing grammars
--- Content provided by FirstRanker.com ---
- Write short notes on :
- Probabilistic language processing
- Probabilistic context-free grammars
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University