1-Introduction to NLP_part1 ‫االسالة على الملف‬

Here are some multiple-choice and true/false questions based on the provided document:

Multiple Choice Questions:

1. Which of the following is NOT a category of knowledge of language?

o a) Syntactic knowledge

o b) Semantic knowledge

o c) Pragmatic knowledge

o d) Computational knowledge

o Answer: d

2. The study of the structure and forms of words is called:

o a) Phonetics

o b) Morphology

o c) Syntax

o d) Semantics

o Answer: b

3. Which level of linguistic analysis concerns the meaning of words and sentences in
specific situations?

o a) Semantics

o b) Pragmatics

o c) Discourse

o d) Syntax

o Answer: b

4. Which of the following is an example of a text-based application of NLP?

o a) Question-answering systems

o b) Automated customer service over the telephone

o c) Machine Translation
 o d) Tutoring systems

o Answer: c

5. Computational Linguistics (CL) can be considered as:

o a) The use of computers in the study of languages.

o b) The formalization of linguistic theories and models or their

implementation in a machine.

o c) Developing new linguistic theories with the aid of a computer.

o d) All of the above

o Answer: d

True/False Questions:

1. Natural language processing is an interdisciplinary subfield of linguistics, computer

science, and artificial intelligence.1

o Answer: True

2. Syntax is the study of the meaning of words and sentences.

o Answer: False

3. Pragmatics is semantics restricted to a specific context.

o Answer: True

4. Morphology concerns how words are related to the sounds that realize them.

o Answer: False

5. Discourse knowledge concerns how the immediately preceding sentences affect

the interpretation of the next sentence.

o Answer: True

Here are some additional multiple-choice and true/false questions based on the
document:

Additional Multiple Choice Questions:

1. Which of the following best describes Natural Language Processing (NLP)?

o a) A subfield of computer science focused on artificial languages.

 o b) The study of the production and perception of acoustic sounds.

o c) An interdisciplinary field concerned with interactions between computers

and human languages.

o d) The design of mathematical models of language structures.

o Answer: c

2. In the context of language, a "lexicon" refers to:

o a) The study of the order of words in a sentence.

o b) The set of rules governing sentence structure.

o c) The word set of a language, usually consisting of root words.

o d) The analysis of the meaning of words in context.

o Answer: c

3. Which of the following is a goal of Computational Linguistics (CL)?

o a) To replace natural language with artificial language.

o b) To study human behavior.

o c) To design mathematical models of language structures for computer

automation of language processing.

o d) To analyze the social aspects of language use.

o Answer: c

4. Which linguistic level is concerned with how words are constructed from basic
meaning units called morphemes?

o a) Phonetics

o b) Morphology

o c) Syntax

o d) Semantics

o Answer: b

5. Which type of knowledge is essential for speech-based systems?

o a) Syntactic knowledge
 o b) Semantic knowledge

o c) Phonetic and phonological knowledge

o d) Pragmatic knowledge

o Answer: c

Additional True/False Questions:

1. Computational Linguistics (CL) is solely focused on developing new linguistic

theories.

o Answer: False

2. Phonetics is the study of the structure and forms of a word.

o Answer: False

3. Syntax defines word categories and functions within a sentence.

o Answer: True

4. Semantic knowledge is the study of context-dependent meaning.

o Answer: False

5. World knowledge includes the general knowledge about the structure of the world
that language users must have in order to1 maintain a conversation.

o Answer: True

2-Introduction to NLP_part2
Here are some multiple-choice and true/false questions based on the provided
document:

Multiple Choice Questions:

1. A lexicon is a:

o a) set of rules for grammar.

o b) repository for words.

o c) collection of sentences.
 o d) list of ambiguous words.

2. Part of Speech (POS) tagging involves:

o a) identifying the meaning of a word.

o b) identifying the part of speech for each word in a string.

o c) resolving word sense ambiguity.

o d) translating words into another language.

3. Ambiguity in NLP refers to:

o a) the clarity of language.

o b) the presence of multiple possible interpretations of a word or

sentence.

o c) the use of simple vocabulary.

o d) the absence of context.

4. An alphabet in the context of formal languages is:

o a) a collection of words.

o b) a set of grammatical rules.

o c) a finite, non-empty set of symbols.

o d) a sequence of characters.

5. A language in formal language theory is:

o a) a set of rules defining grammar.

o b) a collection of strings constructed from an alphabet.

o c) a method for resolving ambiguity.

o d) a type of automaton.

6. The Chomsky Hierarchy is a:

o a) method for POS tagging.

o b) model for word sense disambiguation.

o c) containment hierarchy of classes of formal languages.

 o d) process for speech recognition.

True/False Questions:

1. True or False: A word can belong to only one lexical category.

o False

2. True or False: Local context can help in disambiguating the part of speech of a
word.

o True

3. True or False: Resolving ambiguity is a crucial goal in Natural Language

Processing.

o True

4. True or False: The empty string is denoted by Ø.

o False (Empty string is denoted by epsilon ε)

5. True or False: A language over an alphabet ∑ is a subset of ∑*.

o True

Answers to Multiple Choice Questions:

1. b

2. b

3. b

4. c

5. b

6. c

Answers to True/False Questions:

1. False

2. True

3. True

4. False

5. True
Here are more multiple-choice and true/false questions based on the document, with
answers:

More Multiple Choice Questions:

1. Which of the following is NOT a lexical category?

o a) Noun

o b) Sentence

o c) Adverb

o d) Preposition

2. The task of identifying the part of speech for each word in a given string of
words is called:

o a) Word Sense Disambiguation

o b) Syntactic Analysis

o c) Part of Speech Tagging

o d) Morphological Analysis

3. Which of the following sentences demonstrates ambiguity?

o a) The cat sat on the mat.

o b) Time flies like an arrow.

o c) The sun rises in the east.

o d) Water is essential for life.

4. In the sentence "I made her duck," which of the following types of ambiguity is
present?

o a) Lexical ambiguity

o b) Syntactic ambiguity

o c) Semantic ambiguity

o d) All of the above

5. The length of a string is:

o a) the number of symbols in the alphabet.

 o b) the number of characters in the string (excluding the empty string).

o c) the set of all possible strings.

o d) the number of words in the string.

6. ∑* represents:

o a) the set of all strings of length k.

o b) the empty language.

o c) the set of all strings over the alphabet ∑.

o d) a finite sequence of symbols.

7. Which of the following is accepted by a Push Down Automaton (PDA)?

o a) Regular languages

o b) Context-free languages

o c) Context-sensitive languages

o d) Recursively enumerable languages

More True/False Questions:

1. True or False: A determiner is usually followed by a verb.

o False (Determiners are usually followed by an adjective or noun)

2. True or False: Ambiguity is a fundamental problem in Natural Language

Processing.

o True

3. True or False: A word can have only one meaning.

o False

4. True or False: In spoken language, there can be more ambiguity due to

phonetics.

o True

5. True or False: The concatenation of two strings x and y is denoted by xy.

o True

6. True or False: The empty language is denoted by {ε}.

 o False (The empty language is denoted by Ø)

7. True or False: A Finite Automaton (DFA or NFA) recognizes context-sensitive

languages.

o False (A Finite Automaton recognizes regular languages)

Answers to More Multiple Choice Questions:

1. b

2. c

3. b

4. d

5. b

6. c

7. b

Answers to More True/False Questions:

1. False

2. True

3. False

4. True

5. True

6. False

7. False

3-Regular Expressions
Here are some multiple-choice and true/false questions based on the provided text,
with answers:

Multiple Choice Questions:

1. Which of the following is the correct regular expression to match "woodchuck"

or "Woodchuck"?
 o a) /woodchuck/

o b) /Woodchuck/

o c) /[wW]oodchuck/

o d) /[wW]oodchuck/

o Answer: c

2. What does the regular expression /[^a]/ match?

o a) Any string that starts with "a"

o b) Any string that does not contain "a"

o c) Any single character except "a"

o d) The character "^"

o Answer: c

3. Which regular expression matches "color" or "colour"?

o a) /color/

o b) /colour/

o c) /colou?r/

o d) /color?/

o Answer: c

4. What does the asterisk (*) in a regular expression mean?

o a) Zero or one occurrence of the preceding character

o b) One or more occurrences of the preceding character

o c) Zero or more occurrences of the preceding character

o d) Exactly one occurrence of the preceding character

o Answer: c

5. Which regular expression matches one or more digits?

o a) //

o b) /\d/
 o c) /+/

o d) Both b and c

o Answer: d

6. What is a "false positive" in the context of regular expressions?

o a) A string that is incorrectly matched

o b) A string that is incorrectly missed

o c) A pattern that matches nothing

o d) A pattern that matches everything

o Answer: a

7. Which operator has the highest precedence in regular expressions?

o a) Concatenation

o b) Disjunction

o c) Parentheses

o d) Counters (*, +, ?)

o Answer: d

8. Which of the following regular expressions correctly represents the set {lass,
class, glass}?

o a) /lass|class|glass/

o b) /[c]?lass/

o c) /(c|g)?lass/

o d) All of the above

o Answer: d

9. Select the correct regular expression that describes the set of all lower case
alphabetic strings with letter b as a second letter:

o a) /[a-z]*b[a-z]/

o b) /[a-z]b[a-z]*/

o c) /[a-z]+b[a-z]*/
 o d) /[a-z]*b[a-z]*/

o Answer: b

10. The regular expression /[Cc]ats?/ matches the words … … in texts.

o a) cat, cats

o b) Cat, Cats

o c) Cat, Cats, cat, cats

o d) cat, Cats

o Answer: c

True/False Questions:

1. Regular expressions are case-sensitive.

o Answer: True

2. The caret symbol (^) always indicates negation in regular expressions.

o Answer: False

3. The plus sign (+) in a regular expression means "zero or more occurrences".

o Answer: False

4. A period (.) in a regular expression matches any single character except a

carriage return.

o Answer: True

5. \b matches a word boundary.

o Answer: True

6. False positives are strings that we incorrectly missed.

o Answer: False

7. The pipe symbol (|) is used as a disjunction operator in regular expressions.

o Answer: True

8. Parentheses are used to group parts of a regular expression.

o Answer: True
 9. Anchors are special characters that anchor regular expressions to particular
places in a string.

o Answer: True

10. Regular expressions, finite state automata, and regular grammars are three
formalisms for capturing languages.

o Answer: True

Here are more questions, including multiple choice and true/false, based on the
provided file:

Multiple Choice Questions:

1. Which of the following regular expressions matches a string containing "apple"

or "banana"?

o a) /applebanana/

o b) /(apple|banana)/

o c) /[applebanana]/

o d) /apple&banana/

o Answer: b

2. What does the regular expression /\d{3}-\d{2}-\d{4}/ typically match?

o a) A date in MM/DD/YYYY format

o b) A phone number in XXX-XX-XXXX format

o c) An IP address

o d) A social security number

o Answer: b

3. Which regular expression will match "Chapter 1", "Chapter 20", and "Chapter
100"?

o a) /Chapter/

o b) /Chapter \d*/

o c) /Chapter \d+/
 o d) /Chapter+/

o Answer: d

4. What is the purpose of parentheses in regular expressions?

o a) To define character sets

o b) To group parts of a regular expression

o c) To indicate optional parts of a pattern

o d) To match the end of a line

o Answer: b

5. Which of the following regular expressions matches "file.txt" or "file.pdf" but

not "file.doc"?

o a) /file.(txt|pdf)/

o b) /file.(txt|pdf)/

o c) /file.[txtpdf]/

o d) /file.(txt|pdf|doc)/

o Answer: b

6. What does the \w metacharacter in regular expressions represent?

o a) Any digit

o b) Any whitespace character

o c) Any word character (letters, digits, and underscores)

o d) Any non-word character

o Answer: c

7. Which regular expression can be used to find a word starting with "b" and
ending with "t"?

o a) /b*t/

o b) /b.t/

o c) /b.*t/

o d) /b\wt/
 o Answer: c

8. What is the output of the following regular expression? Input: "The quick brown
fox jumps over the lazy fox." Regular Expression: /fox/

o a) "The quick brown fox jumps over the lazy fox."

o b) "fox"

o c) "fox fox"

o d) ["fox", "fox"]

o Answer: b

9. Which of the following regular expressions matches a valid email address?

o a) /.*@.*/

o b) /@./

o c) /\S+@\S+.\S+/

o d) /\w+@\w+.\w+/

o Answer: c

10. In regular expressions, what does the term "greedy matching" refer to?

o a) Matching the shortest possible string

o b) Matching the longest possible string

o c) Matching only at the beginning of a string

o d) Matching only at the end of a string

o Answer: b

True/False Questions:

1. Regular expressions are case-insensitive by default.

o Answer: False

2. The plus sign (+) in regular expressions requires at least one occurrence of the
preceding character or group.

o Answer: True

3. The caret (^) matches the end of a line.

 o Answer: False

4. A regular expression with only literal characters will match exactly that
sequence of characters.

o Answer: True

5. \D matches any character that is not a digit.

o Answer: True

6. You need to use a backslash to escape special characters in regular

expressions.

o Answer: True

7. Concatenation has higher precedence than disjunction in regular expressions.

o Answer: True

8. Regular expressions can only be used for searching text.

o Answer: False

9. False positives are instances where a pattern incorrectly matches a string.

o Answer: True

10. The empty string is a string with no characters.

o Answer: True

4-Finite State Machines_part1

Here are some multiple-choice and true/false questions based on the document you
provided:

Multiple Choice Questions

1. Which of the following is a type of Finite State Automata (FSA)?

o a) Context-Free Grammar

o b) Deterministic Finite Automata (DFA)

o c) Turing Machine

o d) Pushdown Automata
2. A DFA is defined by a 5-tuple. Which of the following is NOT part of the 5-tuple?

o a) A finite set of states (Q)

o b) A finite set of input symbols (alphabet) (Σ)

o c) A set of accepting states (F)

o d) A transition function (δ)

o e) A set of rejecting states (R)

3. In a DFA, how many transitions are possible for each state and input symbol?

o a) Zero

o b) One

o c) One or more

o d) Zero or one

4. What does a DFA do when it finishes reading an input string?

o a) It always accepts the string.

o b) It rejects the string if it is not in an accepting state.

o c) It accepts the string if it is in an accepting state.

o d) It randomly accepts or rejects the string.

5. Which of the following is an advantage of Non-deterministic Finite Automata

(NFA)?

o a) Faster to execute

o b) Great for modeling regular expressions

o c) Can only take one path through the state graph

o d) Simpler than DFA for any given language

6. What is the difference between DFA and NFA?

o a) DFA can exist in multiple states at the same time, While NFA can exist
in only one state at any given time.

o b) DFA has exactly one transition per input per state, While NFA can have
zero, one, or multiple transitions for one input in a given state.
 o c) DFA can have ε-moves, While NFA cannot have ε-moves.

o d) DFA are slower to execute, While NFA are faster to execute.

True/False Questions

1. Finite State Automata (FSA) are used as a recognizer for "Regular Languages".

2. Regular expressions can be used to specify the structure of finite-state

automata.

3. A DFA can exist in multiple states at the same time.

4. An NFA can have ε-moves.

5. DFA are faster to execute than NFA.

6. For a given language, NFA can be simpler than DFA.

Answer Key

Multiple Choice Answers

1. b)

2. e)

3. b)

4. c)

5. b)

6. b)

True/False Answers

1. True

2. True

3. False

4. True

5. True

6. True

Here are more multiple-choice and true/false questions based on the document, with
answers:
More Multiple Choice Questions

1. Which of the following best describes the transition function (δ) in a DFA?

o a) A mapping between a state and a set of states.

o b) A mapping between a state and an input symbol.

o c) A mapping between a state and the next state, given an input symbol.

o d) A mapping between a set of states and a set of input symbols.

2. In the sheep DFA example, what is the regular expression that represents the
sheep language?

o a) /ba!/

o b) /baa+!/

o c) /ba++/

o d) /baaa/

3. What is the start state in the sheep DFA example?

o a) q1

o b) q2

o c) q0

o d) q4

4. In an NFA, if after processing the input string, there are multiple current states,
the NFA will accept if:

o a) All current states are accepting states.

o b) At least one of the current states is an accepting state.

o c) No current states are accepting states.

o d) The majority of the current states are accepting states.

5. Which of the following statements about ε-moves is correct?

o a) Both DFA and NFA can have ε-moves.

o b) DFA can have ε-moves, but NFA cannot.

o c) NFA can have ε-moves, but DFA cannot.

 o d) Neither DFA nor NFA can have ε-moves.

6. What is the language of a DFA?

o a) The set of all strings that lead to a non-accepting state from the start
state.

o b) The set of all strings that lead to an accepting state from any state.

o c) The set of all strings that lead to an accepting state from the start
state.

o d) The set of all strings that lead to a non-accepting state from any state.

More True/False Questions

1. A DFA can have multiple start states.

2. An NFA can have zero transitions for a given state and input symbol.

3. A DFA is always more complex than an NFA for a given language.

4. The transition function in a DFA maps to a single state.

5. The transition function in an NFA maps to a subset of states.

6. If a string is accepted by a DFA, it will also be accepted by an NFA that

recognizes the same language.

Answer Key

More Multiple Choice Answers

1. c)

2. b)

3. c)

4. b)

5. c)

6. c)

More True/False Answers

1. False

2. True
 3. False

4. True

5. True

6. True

5-Finite State Machines_part2

Here are some multiple-choice and true/false questions based on the provided
document:

Multiple Choice Questions:

1. What is the process of determining if a string should be accepted by a machine

called?

o a) Transition

o b) Recognition

o c) Computation

o d) Translation

o Answer: b

2. In deterministic recognition, what is the machine's next state determined by?

o a) Random choice

o b) Current state and input symbol

o c) Previous state only

o d) Final state

o Answer: b

3. Which of the following is NOT a characteristic of deterministic finite state

automata (FSA)?

o a) Each transition is unique.

o b) There are no choices in processing.

o c) It can have epsilon transitions.

 o d) It is universal for all unambiguous regular languages.

o Answer: c

4. What does the D-Recognize algorithm use to determine the next state?

o a) A random number generator

o b) A transition table

o c) A complex mathematical formula

o d) User input

o Answer: b

5. What is a key feature of non-deterministic FSA?

o a) Only one possible transition per state

o b) No epsilon transitions allowed

o c) Multiple possible transitions from a state for the same input

o d) Simpler execution

o Answer: c

6. What is the result of negation operation on a language?

o a) Accept strings not accepted by the original machine.

o b) Accept only strings accepted by the original machine.

o c) Accept all possible strings.

o d) Reject all possible strings.

o Answer: a

7. What is the approach to non-deterministic recognition?

o a) Convert ND machine to a deterministic machine

o b) Manage recognition as a state-space search

o c) Both of the above

o d) None of the above

o Answer: c
 8. Why use Non-Deterministic FSA?

o a) More natural solutions

o b) Simpler than DFA

o c) Both of the above

o d) None of the above

o Answer: c

True/False Questions:

1. Recognition is the process of determining if a string is in the language defined

by the machine.

o Answer: True

2. The D-Recognize algorithm is specific to only one regular language.

o Answer: False

3. In non-determinism, a machine can have epsilon transitions.

o Answer: True

4. Non-deterministic machines are more powerful than deterministic machines.

o Answer: False

5. In a ND FSA, all paths for an accepted string must lead to an accept state.

o Answer: False

6. Set operations cannot be performed on formal languages.

o Answer: False

7. Negation in non-deterministic machines is done by inverting all the accept and

not accept states.

o Answer: False

8. DFAs are faster to execute than NFAs.

o Answer: True

Here are more multiple-choice and true/false questions based on the document, with
answers:
More Multiple Choice Questions:

1. What is the role of the tape pointer in deterministic recognition?

o a) To randomly select the next state

o b) To indicate the current input symbol being examined

o c) To jump to the final state

o d) To reverse the input string

o Answer: b

2. The D-Recognize algorithm returns "reject" if:

o a) The end of input is reached and the current state is an accept state.

o b) A transition is possible

o c) The current state is not an accept state after consuming the entire
input

o d) The input string is empty

o Answer: c

3. What does "equivalence" mean in the context of deterministic and non-

deterministic machines?

o a) Non-deterministic machines are more powerful.

o b) Deterministic machines can perform more computations.

o c) Non-deterministic machines can be converted to deterministic ones.

o d) They have different computational power.

o Answer: c

4. If a string is in the language defined by a non-deterministic FSA, then:

o a) All paths through the machine must lead to an accept state.

o b) No paths through the machine lead to an accept state.

o c) There exists at least one path through the machine that leads to an
accept state.

o d) All paths lead to rejection.

 o Answer: c

5. In the context of Finite State Machines, the term "concatenation" refers to:

o a) Accepting a string in either of two languages.

o b) Accepting a string that is in both of two specified languages.

o c) Accepting a string consisting of a string from language L1 followed by a

string from language L2.

o d) Accepting only empty strings.

o Answer: c

6. The intersection of two languages A and B can be constructed by:

o a) A ∩ B = ~(~A or ~B)

o b) A ∩ B = A or B

o c) A ∩ B = A and B

o d) A ∩ B = ~(A or B)

o Answer: a

7. Why might NFAs be used if DFAs are faster to execute?

o a) NFAs are always simpler.

o b) For a given language, an NFA can be simpler than a DFA.

o c) NFAs have more computational power.

o d) NFAs are easier to implement.

o Answer: b

More True/False Questions:

1. Traditionally, recognition is viewed as processing an input written on a tape.

o Answer: True

2. Changing the input machine in D-Recognize algorithm requires changing the

transition table.

o Answer: True

3. A non-deterministic FSA can have only one choice at each state.

 o Answer: False

4. Epsilon transitions in non-deterministic machines examine and advance the

tape during recognition.

o Answer: False

5. Success in non-deterministic recognition occurs when all possible paths lead

to an accept state.

o Answer: False

6. Formal languages are sets of symbols.

o Answer: False

7. The negation operation works for non-deterministic machines.

o Answer: False

8. FSAs can represent all natural language phenomena.

o Answer: False

6-Morphology_part1
Here are some multiple-choice and true/false questions based on the document, with
answers:

Multiple Choice Questions:

1. Morphology is the study of:

a) Sentence structure

b) Word meaning

c) The ways words are built from smaller units

d) Speech sounds

Answer: c)

2. The smallest meaning-bearing units in a language are called:

a) Stems

b) Affixes
c) Morphemes

d) Words

Answer: c)

3. Affixes that precede the stem are called:

a) Suffixes

b) Infixes

c) Prefixes

d) Circumfixes

Answer: c)

4. Which of the following is an example of a suffix?

a) un- in "undo"

b) -s in "eats"

c) do in "undo"

d) None of the above

Answer: b)

5. Inflectional morphology involves combining stems and affixes to create a word

that:

a) Has a different word class than the original

b) Has the same word class as the original

c) Changes the core meaning of the word

d) Creates a new word with no relation to the original

Answer: b)

6. Which of the following is an example of inflectional morphology?

a) compute / computer

b) do / undo

c) eat / eats
d) friend / friendly

Answer: c)

7. Derivational morphology often results in:

a) A word of the same class

b) A word with the same meaning

c) A word of a different class

d) Only verbs

Answer: c)

8. Which of the following is an example of derivational morphology?

a) cat / cats

b) walk / walked

c) transport / transportation

d) John / John's

Answer: c)

True/False Questions:

1. Morphemes are the minimal meaning-bearing units in a language.

Answer: True

2. Prefixes follow the stem.

Answer: False

3. English affixes include prefixes, suffixes, and circumfixes.

Answer: True

4. Inflectional morphology changes the class of the actual stem.

Answer: False

5. Derivational morphology usually changes the meaning and class of the actual
stem.

Answer: True
 6. All words follow regular rules in morphology.

Answer: False

7. The possessive suffix is realized by apostrophe + -s for regular plural nouns.

Answer: False

8. Verbs have simpler inflectional morphology than nouns.

Answer: False

Here are more multiple-choice and true/false questions based on the document, with
answers:

More Multiple Choice Questions:

1. Which of the following is NOT a type of affix?

a) Prefixes

b) Stems

c) Suffixes

d) Circumfixes

Answer: b)

2. The word "undo" is an example of a word with a:

a) Suffix

b) Infix

c) Prefix

d) Circumfix

Answer: c)

3. The word "eats" consists of:

a) The stem "s" and the suffix "eat"

b) The stem "eat" and the prefix "-s"

c) The stem "eat" and the suffix "-s"

d) The prefix "eat" and the suffix "-s"

Answer: c)

4. Which type of morphology does NOT change the word class?

a) Derivational morphology

b) Inflectional morphology

c) Both derivational and inflectional morphology

d) None of the above

Answer: b)

5. Which of the following is an example of a plural inflection in English nouns?

a) John / John's

b) cat / cats

c) go / went

d) do / undo

Answer: b)

6. The possessive suffix in English is realized by:

a) Apostrophe + -s for all nouns

b) Only apostrophe for all nouns

c) Apostrophe + -s for regular singular nouns and plural nouns not ending in -s

d) Apostrophe + -s for regular plural nouns

Answer: c)

7. Which of the following is NOT a primary verb in English?

a) be

b) have

c) do

d) walk

Answer: d)

8. Which of the following is an example of an irregular verb?

a) walk / walked

b) try / tried

c) go / went

d) map / mapped

Answer: c)

9. Which suffix produces nouns from verbs ending in the suffix -ize?

a) -er

b) -ness

c) -ation

d) -al

Answer: c)

More True/False Questions:

1. Infixes are inserted inside the stem.

Answer: True

2. Circumfixes precede the stem only.

Answer: False

3. "Unstable" consists of the stem "stable" and the prefix "un-".

Answer: True

4. Inflectional morphology can change the word class.

Answer: False

5. "Pencil / pencils" is an example of derivational morphology.

Answer: False

6. Regular verbs follow specific rules for inflection.

Answer: True

7. "Mouse / mice" is an example of regular nouns.

Answer: False
 8. Derivational morphology does not change the meaning of the stem.

Answer: False

7-Morphology_part2
Here are multiple-choice and true/false questions based on the document, with
answers:

Multiple Choice Questions:

1. Morphological parsing is the process of:

a) Finding the meaning of a word

b) Finding the constituent morphemes in a word

c) Generating new words

d) Analyzing sentence structure

Answer: b

2. Which of the following is an example of morphological parsing?

a) Translating a sentence

b) Checking spelling

c) Labeling morphemes with category labels

d) Information retrieval

Answer: c

3. To build a morphological parser, we need:

a) A lexicon

b) Morphotactics

c) Orthographic rules

d) All of the above

Answer: d

4. Morphotactics is the model of:

a) Morpheme meaning

b) Morpheme ordering

c) Word pronunciation

d) Sentence structure

Answer: b

5. Orthographic rules are used to model:

a) Morpheme meanings

b) Changes that occur in a word when morphemes combine

c) Sentence structure

d) Word pronunciation

Answer: b

6. A lexicon is a repository for:

a) Morpheme ordering rules

b) Spelling rules

c) Words

d) Sentence structures

Answer: c

7. Finite-state automata (FSAs) are used to model:

a) Orthographic rules

b) Morphotactics

c) Lexicons

d) All of the above

Answer: b

8. A finite-state transducer (FST) maps between:

a) Word meanings

b) Morpheme orderings
c) One set of symbols and another

d) Sentence structures

Answer: c

9. An FST can be seen as a:

a) One-tape automaton

b) Two-tape automaton

c) Three-tape automaton

d) None of the above

Answer: b

10. The two levels represented in two-level morphology are:

a) Phonetic and phonological levels

b) Lexical and surface levels

c) Syntactic and semantic levels

d) Input and output levels

Answer: b

True/False Questions:

1. Morphological parsing is only necessary for machine translation.

Answer: False

2. A word can have only one lexical level representation.

Answer: False

3. FSAs can be used to capture facts about morphology.

Answer: True

4. FSAs can recognize strings that are NOT in the language.

Answer: False

5. A simple FSA can give lexical representation.

Answer: False
 6. Finite-state transducers (FSTs) are used for morphological parsing.

Answer: True

7. An FST defines a relation between sets of strings.

Answer: True

8. A regular language is a set of pairs of strings.

Answer: False

9. Orthographic rules are also called spelling rules.

Answer: True

10. Multi-tape machines are used to deal with complications in spelling changes.

Answer: True

Based on the content of the two files, "6-Morphology_part1.pdf" and "7-

Morphology_part2.pdf", here are additional multiple-choice and true/false questions
with answers:

Additional Multiple Choice Questions:

1. Which of the following is an example of an irregular plural noun?

a) cats

b) boxes

c) oxen

d) girls'

Answer: c)

2. Which of the following is an example of a regular verb?

a) go / went

b) fly / flew

c) walk / walked

d) catch / caught

Answer: c)

3. Derivational morphology can change the:

a) Meaning of the stem

b) Class of the stem

c) Both meaning and class of the stem

d) Neither meaning nor class of the stem

Answer: c)

4. Which suffix can produce nouns from verbs ending in the suffix -ize?

a) -al

b) -able

c) -less

d) -ation

Answer: d)

5. The process of finding the constituent morphemes in a word is called:

a) Morphological generation

b) Morphological parsing

c) Morphological recognition

d) Morphological analysis

Answer: b)

6. The model of morpheme ordering that explains which classes of morphemes

can follow other classes of morphemes inside a word is called:

a) Lexicon

b) Morphotactics

c) Orthographic rules

d) Finite-state automaton

Answer: b)

7. The automaton used for performing the mapping between two levels (lexical
and surface) is the:

a) Finite-state automaton (FSA)

b) Finite-state transducer (FST)

c) Multi-tape machine

d) Lexicon

Answer: b)

8. An FST defines a ________ between sets of strings.

a) Language

b) Relation

c) Function

d) Structure

Answer: b)

9. To handle irregular spelling changes, we use:

a) FSAs

b) FSTs

c) Intermediate tapes with intermediate symbols

d) Lexicons

Answer: c)

Additional True/False Questions:

1. The word "foxes" breaks down into the two morphemes "fox" and "-es".

Answer: True

2. Morphological parsing is necessary for spelling checking.

Answer: True

3. A lexicon contains a list of stems and affixes.

Answer: True

4. FSAs are used to capture facts about morphology.

Answer: True

5. FSAs can recognize all forms of all the words in a language efficiently.
Answer: False

6. A finite-state transducer (FST) recognizes only one string.

Answer: False

7. An FST reads one string and generates another.

Answer: True

8. A regular relation is a set of strings.

Answer: False

These additional questions cover more details from the provided documents, giving a
more comprehensive review of the material.

8-Morphology_part3
Here are some multiple-choice and true/false questions based on the document
provided:

Multiple Choice Questions:

1. Which of the following is NOT a topic covered in the document?

o a) Multi-Level Tape Machines

o b) Ambiguity

o c) The Porter Stemmer

o d) Syntax Analysis

o Answer: d) Syntax Analysis

2. In the context of morphological parsing, what does FST stand for?

o a) Finite State Transducer

o b) First Stage Translator

o c) Finite Structure Tree

o d) Forward Searching Technique

o Answer: a) Finite State Transducer

3. What is the purpose of a lexicon transducer?

 o a) To map between surface forms and intermediate forms

o b) To map between the lexical level and intermediate level

o c) To capture orthographic spelling rules

o d) To disambiguate word senses

o Answer: b) To map between the lexical level and intermediate level

4. What is stemming?

o a) The process of identifying all possible word forms

o b) The process of reducing a word to its stem or root form

o c) The process of analyzing the structure of a sentence

o d) The process of resolving ambiguity in word senses

o Answer: b) The process of reducing a word to its stem or root form

5. Which of the following is a characteristic of the Porter Stemmer?

o a) It requires a lexicon.

o b) It guarantees that the resulting stem is a valid word.

o c) It is based on a series of cascaded rewrite rules.

o d) It only handles inflectional affixes.

o Answer: c) It is based on a series of cascaded rewrite rules.

6. Which of the following statements about ambiguity in morphological parsing is

correct?

o a) Transducers are capable of deciding in ambiguous cases.

o b) Disambiguation requires external evidence such as surrounding

words.

o c) Ambiguity is not a problem in morphological parsing.

o d) The first output found is always the correct one.

Answer: b) Disambiguation requires external evidence such as surrounding words.

7. In Arabic morphology, letters often change form depending on:

o a) The speaker's dialect

 o b) Their position within the word

o c) The surrounding sentence structure

o d) The color of the ink used to write them

Answer: b) Their position within the word

True/False Questions:

1. True/False: Parsing is generally more complicated than generation in

morphology due to the problem of ambiguity.

o Answer: True

2. True/False: Stemming is primarily used in syntax analysis.

o Answer: False (Stemming is primarily used in Information Retrieval)

3. True/False: The Porter Stemmer is lexicon-free.

o Answer: True

4. True/False: Arabic morphology is characterized by a rich system of verbal

inflection, nominal cases, and affixes.

o Answer: True

5. True/False: In FSTs, the path to an accept state does not matter.

o Answer: False

6. True/False: The intermediate tapes in cascaded processing are always useful in

their own right.

o Answer: False

7. True/False: The best a transducer can do in ambiguous cases is enumerate the

possible choices.

o Answer: True

Here are more multiple-choice and true/false questions based on the provided
document, with answers:

More Multiple Choice Questions:

1. What is the role of intermediate forms in morphological parsing?

 o a) They represent the final output of the parsing process.

o b) They are a simple concatenation of morphemes.

o c) They contain explicit information about the lexicon.

o d) They are used for disambiguating word senses.

o Answer: b) They are a simple concatenation of morphemes.

2. Which of the following best describes a "cascade" in the context of the

document?

o a) A single step in a morphological process

o b) An architecture where overall processing is divided into distinct

rewrite steps.

o c) A method for resolving ambiguity in parsing

o d) A type of finite state transducer

o Answer: b) An architecture where overall processing is divided into

distinct rewrite steps.

3. What is a key difference between stemming and morphology?

o a) Stemming cares about the structure

o b) Morphology is used in Information Retrieval

o c) Stemming doesn't care about the structure

o d) Morphology doesn't use rewrite rules

o Answer: c) Stemming doesn't care about the structure

4. In the examples given, what is a complication in English morphology?

o a) Lack of affixes

o b) Words always have a one-to-one correspondence

o c) Spelling/pronunciation changes with inflection

o d) No difference between singular and plural forms

o Answer: c) Spelling/pronunciation changes with inflection

 5. Which of the following is an example of a rule used in the Porter Stemmer
algorithm?

o a) ATE → ATIONAL

o b) ING → ε

o c) SS → SSES

o d) ize  ation

o Answer: b) ING → ε

6. What is a characteristic of Arabic morphology?

o a) Simple word structures

o b) Limited use of prefixes and suffixes

o c) Letters often change form depending on their position

o d) No distinction between singular and plural

o Answer: c) Letters often change form depending on their position

7. What is the best course of action to take in the case of ambiguity?

o a) Take the first output

o b) Disregard all outputs

o c) Return all possible outputs

o d) Bias the search to only one unlikely path

o Answer: c) Return all possible outputs

More True/False Questions:

1. True/False: The output of one layer in a cascade serves as the input to the next
layer.

o Answer: True

2. True/False: A full FST morphological parser is always used in Information

Retrieval systems.

o Answer: False
 3. True/False: The Porter Stemmer guarantees that the resulting stem is a real
word.

o Answer: False

4. True/False: Arabic, like most Semitic languages, has a rich morphology.

o Answer: True

5. True/False: In non-deterministic recognition, only one path through a machine

may lead to an accept state.

o Answer: False

6. True/False: The lexicon transducer maps between intermediate forms and

surface level.

o Answer: False

7. True/False: Disambiguating ambiguous cases always requires looking at the

surrounding words.

o Answer: True

‫ محاضرات اللي داخلين معانا في المدد‬8‫دول كده ال‬

‫ أما بعد‬،‫ وعلى آله وصحبه‬،‫ والصالة والسالم على رسول هللا‬،‫الحمد هلل‬:
‫ففي صحيح مسلم‬, ‫صلى هللا‬- ‫ قال رسول هللا‬:‫ قال‬،‫وغيره عن أبي الدرداء‬
"‫ ولك بمثل‬:‫ إال قال الملك‬،‫"ما من عبد مسلم يدعو ألخيه بظهر الغيب‬.