CS626/460 20/2/12

NLP, Speech and the Web

Mid Sem 8.30AM-10.30 AM

(Open Notes Examination. Printouts of PPTs of lectures and seminars allowed. Precision, clarity and readability are absolutely important) Question-1 A Regular Grammar (RG) has production rules of the form Aa | aB, where A and B are non terminals and a a terminal. A Probabilistic RG (PRG) is an RG with probabilities associated with the rules. Compare and contrast HMM and PRG. Justify or contradict with example(s)- which is a must- the statement that HMM favors incomplete, i.e., partial sentences, while PRG favors complete ones. 3+3=6 Question-2 Choose any non-trivial NLP phenomenon/task other than POS tagging and Parsing which have been done in the class. The phenomenon could be small-and-focused (e.g., behaviour of noun-verb combinations in POS tagging) or big-and-diverse (e.g., parsing itself). Do the following: (a) Clearly describe the phenomenon/task. (b) Formulate a computational question to tackle the phenomenon/task. (c) Give a rule based approach for the computation (d) Give a statistical approach for the computation (e) Give evaluation measures You might want to remember critically and minutely everything done in the class towards solving POS tagging and Parsing. Use examples liberally. Do the necessary mathematics rigorously. Think deep and give a well thought out and rich answer. 2 X 5=10 Question-3 Auxiliary verbs of English have the following forms: a: Forms of be (is, am, are, was, were, been) b: Forms of have (have, has, had) c: Forms of do (do, does, did) d: Modal auxiliaries can, could, will, would, shall, should, may, might, must Phrases like will have gone, could be going, might have been found etc. are called verb groups (VG) which have a sequence of auxiliaries followed by a main verb at the end. Give a grammar for VG (S, V, T, P). The grammar should be such that trees with proper depth are found for the strings, i.e., not shallow, flat trees. Assume particles like not and also are present. Be careful to accept ALL and ONLY the valid strings. (8) Discuss with examples whether top down or bottom up or combined top down bottom approach will be the best for parsing of VG. (3) Convert your grammar to Chomsky Normal Form (CNF) and run CYK algorithm on the string: could also not have been going (3) The above problem, though given for English, is universal across languages. The place of auxiliaries can be taken by suffixes (as in Marathi and Dravidian languages and other agglutinative languages like Turkish, Arabic and Hungarian). The order in which such entities combine to form a group or a word form is a matter of parsing. =================paper ends=========================