Download AKTU B-Tech 8th Sem 2016-17 NIT080 Natural Language Processing Question Paper

Roll FirstRanker.com

B.TECH.

THEORY EXAMINATION (SEM–VIII) 2016-17

--- Content provided by FirstRanker.com ---

NATURAL LANGUAGE PROCESSING

Time: 3 Hours

Max. Marks : 100

Note: Be precise in your answer. In case of numerical problem assume data wherever not provided.

SECTION-A

--- Content provided by​ FirstRanker.com ---

1. Explain the following:

   1. Issues and problems in NLP
   2. Lexicon
   3. Advantages of speech understanding system
   4. Left associative grammars

   --- Content provided by​ FirstRanker.com ---

   5. Best first parsing
   6. Scope of ambiguity in natural languages
   7. Differentiate syntax and semantics
   8. Probabilistic context-free grammars
   9. Stochastic Part-of-Speech tagging

   --- Content provided by‍ FirstRanker.com ---

   10. Elements of a language

   (10×2=20)

SECTION-B

(10×5=50)

--- Content provided by​ FirstRanker.com ---

2. Attempt any five of the following:

   1. How the natural language processing systems are evaluated? Explain.
   2. What is the need of NLP system? Why is it difficult to process the natural languages?
   3. What are the issues in parsing? Describe various techniques used for parsing with a suitable example.
   4. What are the differences between natural language processing and natural language understanding?

   --- Content provided by‍ FirstRanker.com ---

   5. Explain in detail about the organization of NLP systems.
   6. What are the different ways in which a speech dialogue system can reduce the number of errors made because of incorrect speech recognition?
   7. How the man-machine interface is designed using NLP techniques? Explain with example.
   8. What are the different levels in language analysis? Explain with examples.

--- Content provided by​ FirstRanker.com ---

SECTION-C

Attempt any two of the following: (15×2=30)

3. How the knowledge is represented using semantic networks? Also explain how information is deduced from semantic networks.
4. Give an example of an NLP system or approach that only knows about individual words (not about their context). Explain what knowledge of words it needs and given an overview of how it works. Give examples to illustrate your explanation.
5. Write an algorithm for converting an arbitrary context-free grammar into Chomsky normal form. Explain it with suitable examples.

--- Content provided by‍ FirstRanker.com ---

FirstRanker.com