Scribd
Upload
7 views3 pages

NLP Sample Exam PDF

The document is a sample exam for Natural Language Processing (NLP) consisting of multiple-choice questions and tasks related to Finite State Transducers (FST) and parse trees. It covers topics such as language analysis, morphological analysis, text preprocessing, and parsing algorithms. The exam includes specific tasks like drawing FSTs for given words and applying the CKY parsing algorithm to sentences using specified grammar rules.

Uploaded by

Raso big
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

NLP Sample Exam PDF

The document is a sample exam for Natural Language Processing (NLP) consisting of multiple-choice questions and tasks related to Finite State Transducers (FST) and parse trees. It covers topics such as language analysis, morphological analysis, text preprocessing, and parsing algorithms. The exam includes specific tasks like drawing FSTs for given words and applying the CKY parsing algorithm to sentences using specified grammar rules.

Uploaded by

Raso big
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Sample Exam

Part1: MCQ
1. Language analysis can be decomposable into:
a. Syntax, Syntactic and Pragmatic,
b. Syntax, Semantic and Pragmatic,
c. Morphotactic, Semantic and Pragmatic,
d. Syntactic, Symbolic and Pragmatic.
2. Parsers for natural languages differ from parsers for computer languages in:
a. the sufficiency of coverage of the grammar,
b. ambiguity and complexity
c. ambiguity and dependencies,
d. ambiguity and independencies,
3. Language identification is a challenge for NLP Lexical Analysis Phase:
a. True,
b. False,
4. Morphemes are:
a. Stem and Affixes,
b. Stem and Prefixes,
c. Stem and Suffixes,
d. None of the Above.
5. Which one is part from the NLP Text processing Phase:
a. Word Segmentation,
b. Identifying Sentences boundaries,
c. Normalization
d. All of the above

Part2: FST & Parse Tree


1. Draw the Finite State Transducer (FST) (one graph) for the following set of words
[fox, foxes, light, drank, lighting]
2. Draw all Syntax Parse Tree derivations for this sentence “this nice girl light a candle”,
using these GFC rules:
S -> NP VP
NP -> Det NBar
NBar -> Adj Noun
NBar -> Noun
NBar -> Adj
VP -> Verb NP
VP -> Verb

This study source was downloaded by 100000862862967 from CourseHero.com on 01-30-2025 14:48:38 GMT -06:00

https://www.coursehero.com/file/221590586/NLP-Sample-exampdf/
Part1: MCQ
1. Text preprocessing can be divided into two stages:
a. Document triage and language identification
b. Text segmentation & Sentence segmentation
c. Document triage and tokenization
d. Document Triage and sentence segmentation
2. Morphological Analysis:
a. Does discourse analysis
b. Separate words into individual morphemes and identify the class of the morphemes
c. Is an extension of propositional logic
d. None of the above
3. Programing languages contain inherent ambiguities:
a. True,
b. False,
4. Which is the correct order for preprocessing in Natural Language Processing?
a. tokenization->stemming->lemmatization
b. lemmatization->tokenization->stemming
c. stemming->tokenization->lemmatization
d. None of the above
5. Tokenizing is:
a. splitting up text by word or by sentence,
b. allows you to identify words that come up particularly often.
c. your first step in turning unstructured data into structured data,
d. All of the above

Part2: FST
6. Draw the Finite State Transducer (FST) (one graph) for the following set of words
[glass, glasses, plays, played]
7. Apply the parsing algorithm CKY on this sentence “the little boy plays football”, using
these GFC rules:
S -> NP VP
NP -> Det NBar
NBar -> Adj Noun
NBar -> Noun
VP -> Verb NP
VP -> Verb

This study source was downloaded by 100000862862967 from CourseHero.com on 01-30-2025 14:48:38 GMT -06:00

https://www.coursehero.com/file/221590586/NLP-Sample-exampdf/
Apply the parsing algorithm CKY on this sentence “the brave wins the war”, using
these GFC rules:
S -> NP VP
S ->Aux NP VP
S -> VP
NP -> Det NBar
NBar -> Adj Noun
NBar -> Noun
VP -> Verb NP
VP -> Verb

Apply the parsing algorithm CKY on this sentence “the student watches a video”, using
these GFC rules:
S -> NP VP
S ->Aux NP VP
S -> VP
NP -> Det NBar
NBar -> Adj Noun
NBar -> Noun
VP -> Verb NP
VP -> Verb

This study source was downloaded by 100000862862967 from CourseHero.com on 01-30-2025 14:48:38 GMT -06:00

https://www.coursehero.com/file/221590586/NLP-Sample-exampdf/
Powered by TCPDF (www.tcpdf.org)

You might also like