NLP Natural Language Processing
1-Reference to an entity that has been previously introduced into the discourse
is called
A. Anaphora
B. Cataphora
C. Homonymy
D. Hyponymy
2-___________ refers to a single lexeme with multiple related meanings.
A. Polysemy
B. Homonymy
C. Hyponymy
D. Homographs
3-Using patterns based on the __________ approach, no linguistic structures are
used, such as some specific translation
systems target word. Then, simple re-ordering rules can apply.
A. direct translation
B. transfer
C. interlingua
D. All of the above
4-is the __________ of another if the first sense is more specific, denoting a sub-
class of the other.
A. Hyponymy
B. Synonymy
C. Homonymy
D. None of the above
5-Consider a translation system based on the transfer approach with 3
languages, so we need ________ different
transfer modules.
A. 3
B. 6
C. 12
D. 9
6-Which of the following is not one of the types of Referring Expression?
A. Pronouns
B. Infinitives
C. Discontinuous Sets
D. None of the above
7-Expression such as Reg(x, y): Register(x, y) (Ahmed) is reduced to which of the
following?
A. x: Register(x, Ahmed)
B. y: Register(Ahmed, y)
C. Reg(x, y): Register(Ahmed, y)
D. y: Register, Ahmed
8-If P is true and Q is false, which of the following formulas is true?
A. ~P∧ Q
B. P⇒ Q
C. P∧ Q
D. P∨ Q
9-The expression (Q ∨ ~Q) is which of the following?
A. Contradiction
B. Tautology
C. Contingency
D. None of the above
10-Consider the following elementary statements:
A: you buy books
B: you do not pay a lot of money
Which of the following propositions is equivalent to the sentence: you buy
books, but you do not pay a lot of money.
A. A ∧ B
B. A ⇒ B
C. A ∨ B
D. A ∧ ~B
11-Using the Modus Ponens inference rule, if the following two statements are
true: The key can open the door. If the key opens the door, then the door is
opened. Then, which of the following statements is true?
A. The door is opened
B. The door is closed
C. The key cannot open the door
D. All of the above
12-Given that (A, B) are terminals and {A} is a non-terminal, which of the
following word is correctly generated from the CFG with the production rule: A
→ BA
A. B
B. A
C. BAA
D. AA
13-Given that {Verb, drive} are terminals and {VP, FP, Verb, Det} are non-
terminals, which of the following productions is NOT a correct CFG rule?
A. VP→ Verb | VP FP
B. FP→ Det VP
C. VP→ Verb drive
D. All of the above are valid
14-Two CFG grammars are ___________ if they generate the same language.
A. Equivalent
B. Non-equivalent
C. Equal
D. Ambiguous
15-Which of the following is not a source of ambiguity for Arabic sentences?
A. Free word order
B. Affixed pronouns
C. Hidden pronouns
D. None of the above
16-For Non-Deterministic recognition, __________ occurs when all of the possible
paths for a given string lead to failure.
A. Failure, failure
B. Failure, success
C. Success, failure
D. Success, success
17-Given the following finite state machine in the figure, answer questions from 17 to
19.
[Image of finite state machine]
Which of the following is an accepted string from this machine?
A. bbba
B. abbab
C. abab
D. zdbbcz
18-Which of the following is a rejected string from this machine?
A. abbab
B. zbabc
C. zdbbc
D. zwwd
19-Which of the following is the regular expression representing the language of this
machine? [2 marks]
A. (a+b+c+d)* (e+f+g+w+d+ww)*
B. (a+b+c+d)*
C. (z+b+c+d+e+f+g+w)*
D. (z+b+c+d+(e+f+g+w+ww))*
20-Choose the context-free language generated by the grammar S → aScT, T → bTc,
S→ λ, T →
λ:
A. {anbnc^2n | n ≥ 0}
B. {anbncn | n ≥ 0}
C. {ambncn | m, n ≥ 0}
D. {ambnc^2m | m, n ≥ 0}
21-Which of the following is the correct regular expression for the set of all strings
with an even number of a's and b's?
A. (aa + bb)*
B. (a + b)*
C. (ab + ba)*
D. (aa + bb + ab + ba)*
22-The expression (a+b)* by Kleene’s (a|b)* is equivalent to which of the following?
A. (a*, b, a)*
B. (a, b)* | (a, b)
C. (a|b)*
D. None of the above
23-If P ∨ Q is true, which of the following formulas is true?
A. P
B. P ∧Q
C. P ∨¬Q
D. ¬P
24-Given the following expression: F = (S ∧ R) ∨ (S ∧ Q) ∨ P. Which of the following
CNF formulas expresses F?
A. S ∧ (R Q∨ ∨P)
B. (S∧ R) ∨
P
C. (S∨ P) ∧ ∨ ∧ ∨
(R P) (Q P)
D. S ∧ (R ∨ ∧ ∨
P) (Q P)
25-Given the following statement: A student likes the school if and only if they like
either the courses or the professors. Which of the following is equivalent to the
statement?
A. A student likes the school if and only if they like the courses and the professors.
B. A student likes the school if and only if they like the courses.
C. A student likes the school if they like the courses and the professors.
D. A student likes the school if and only if they like the courses or the professors.
26-Which of the following parsers supports parse trees that are not inherently
ambiguous?
A. Bottom-Up Parser
B. Top-Down Parser
C. Recursive Parser
D. Predictive Parser
1-The expression R ⇒ S is equivalent to S ⇒ R. [True/False]
2-The regular expression baa* is correctly representing strings in the set {ba, baa,
baaa...}. [True/False]
3-A mechanism for identifying coherence could not support some natural
language applications like information extraction and summarization.
[True/False]
4-Top-Down parsing suggests trees that make no sense globally. [True/False]
5-In forward chaining, facts will be present in the knowledge base when needed,
since all inference is performed in advance. [True/False]
6-Homographs are pairs of lexemes with identical orthographic forms and with
different pronunciations. [True/False]
7-Semantic morphology concerns the combination of stems and affixes where
the resulting word has the same word class as the original. [True/False]
8-Different lexemes with different spelling and with identical or very similar
meaning are called homographs. [True/False]
(2) Given the following parse tree, answer the following questions: [9 marks]
a. Write the context free grammar (CFG) rules that are used to construct this
parse tree such that each non-
terminal is represented in a single rule. [3.5 marks]
b. By using the CFG rules specified in "a", write the semantic attachment for each
of the following rules: S. VP.
Verb, NP (ie. NP in the right of tree for Banana branch), Noun (i.e. in the left of
tree for Student
brunch). [5.5 marks]
