Natural Language Processing Rr420503

Set No. 1

Code No: RR420503

IV B.Tech II Semester Regular Examinations, Apr/May 2007 NATURAL LANGUAGE PROCESSING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Map the following CFG into an equivalent recursive transition networks that uses only three networks –S, NP,PP networks S→ NP VP VP→ V VP→ V NP VP→ V PP NP→ ART NP2 NP→ NP2 NP2→ N NP2→ ADJ NP2 NP2 → NP3 PREPS PREPS → PP PREPS → PP PREPS PP→ NP (b) Explain about grammars and logic programming.

[10+6]

2. (a) What is depth first strategy? (b) What is breadth first strategy ? (c) What is first in first out strategy? (d) What is a final chart?

[4×4]

3. (a) Discuss in detail the different kinds of word classes can appear I noun phrases. (b) With an example explain co-ordinate noun phrase?

[8+8]

4. (a) Explain in detail the forward chaining & backward chaining in IF then reasoning (b) Explain i. Abduction ii. Resolution

[10+6]

5. (a) List & Define several important components of intelligent agents? (b) What do you mean by speech act? (c) What is Knowledge base and Belief Base? 6. (a) Describe the steps taken to resolve a pronoun.

1 of 2

[6+4+6]

Set No. 1

Code No: RR420503

(b) Illustrate the operation of the above by example John saw a beautiful Acura Integra at the dealership. He showed it to bob. He brought it .

[8+8]

7. Discuss & Explain the Natural Language Systems (a) Base ball (b) GUS (c) PARRY

[16]

8. Compare & Contrast the SPL input to KMPL and the FD input to FUF? What decisions are required of the disclosure planner for each of them? What are their relative strength and weaknesses? [16] ⋆⋆⋆⋆⋆

2 of 2

Set No. 2

Code No: RR420503

IV B.Tech II Semester Regular Examinations, Apr/May 2007 NATURAL LANGUAGE PROCESSING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) List the different Verb forms with example? (b) Explain with an example the basic & progressive tenses? 2. (a) Explain with an example the elements of the simple noun phrases. (b) What is Morphology? (c) What are Inflectional form & Derivational forms?

[8+8]

[8+4+4]

3. Explain briefly about (a) (b) (c) (d)

Language Knowledge Background Knowledge General World Knowledge Context Knowledge

[4×4=16]

4. (a) What are the two forms of knowledge that are curtail in knowledge Representation? (b) Discuss the types of inferences? (c) What is knowledge base? [8+4+4] 5. (a) What is the need of discourse structure? (b) What are discourse segments? (c) What are cue phrases?

[6+6+4]

6. Write short notes on: (a) (b) (c) (d)

Pro normalization Pronouns Demonstrative pronouns One anaphora

[4×4=16]

7. What is Template Matching? Discuss in detail the Machine proposed by the Alen Turning? [16] 8. (a) List & Explain in detail the three fundamental concerns in generations? (b) Explain the procedure for generation in a fully specified system networks. [6+10] ⋆⋆⋆⋆⋆ 1 of 1

Set No. 3

Code No: RR420503

IV B.Tech II Semester Regular Examinations, Apr/May 2007 NATURAL LANGUAGE PROCESSING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Discuss in detail the different forms of Knowledge relevant for Natural Language Understanding? (b) Explain Syntax, Semantics & Pragmatics.

[10+6]

2. (a) What is GAP Threading? (b) What are extra position grammar? (c) Distinguish between bounded (Local) movement and unbounded (non local) movement? [4+4+8] 3. (a) Explain the two kinds of grammar Equivalence? (b) What do you Mean by Domain specific knowledge? Explain with example. [8+8] 4. (a) What do you mean by Unification of two literals? (b) Discuss the resolution refutation procedure? (c) List the steps involved in answering questions by using resolution? [4+6+6] 5. Explain: (a) Coherence (b) Co reference (c) Discourse segment (d) Sub ordinary relations & coordinating relations

[4×4=16]

6. Briefly Summarize the approaches to pronouns resolution (Tree search Algorithm) [16] 7. Which structure takes more memory F(a,b,c,d,e) or f(abcde,abcde,abcde)? Explain how you can answer this question without knowing the amount of memory needed for a character, a pointer or a cell on any particular compiler? [16] 8. (a) List & Explain the choices made by the generations systems? (b) Explain with diagram the reference Archicture for NLG systems. ⋆⋆⋆⋆⋆

1 of 1

[8+8]

Set No. 4

Code No: RR420503

IV B.Tech II Semester Regular Examinations, Apr/May 2007 NATURAL LANGUAGE PROCESSING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. Explain in detail, why each of the following sentences is ill formed? State what rules have been violated ? (a) He barked the wrong tree up. (b) she turned water in to wine (c) Don’t take many all the cookies (d) I feel floor today (e) They all laughed the boy

[16]

2. Design an ATN for parsing sentences that contain one finite clause such that the finite verb phrase in the clause is uni-transitive. Write a parsing program that transit through the ATN to parse a few sentences of your choice. The vocabulary in the sentences you will be parsing. [16] 3. (a) “The man took the Book” Represent the sentence in CFG Parse tree. (b) Explain the three main new ideas with respect to the complex notations of syntax and grammar. [8+8] 4. Natural Language Understanding requires a capability to represent and reason about knowledge of the world? Justify? [16] 5. (a) Discuss “Pronoun Resolution” Algorithm (b) What are i. ii. iii. iv.

Silience Value Salience factors Initial Silience value final Silence value

[10+6]

6. (a) What are the two fundamental operations to the discourse model? (b) With the help of diagram, Explain the operation & relationships of discourse model. [8+8] 7. (a) What is displayed by the prolog query ‘?-write(“abc”)’ ? Why? (b) in what situation does name/2 produce a zero length atom? (c) Show how to use name/2 to convert “abracadabra” into an atom. 1 of 2

Set No. 4

Code No: RR420503

(d) Show how to use name/2 to find out the ASCII code of the letter Q?[4×4=16] 8. Explain in detail with example the simple FUF (Functional Unification Formalism) Grammar? [16] ⋆⋆⋆⋆⋆

2 of 2