Scribd
Upload
8 views1 page

Tutorial I

The document is a tutorial containing multiple-choice questions and open-ended questions related to natural language processing and finite-state automata. It covers topics such as morphology, N-grams, parts-of-speech tagging, and state transition tables. The tutorial aims to assess understanding of these concepts through various questions.

Uploaded by

Myat Pwint Phyu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views1 page

Tutorial I

The document is a tutorial containing multiple-choice questions and open-ended questions related to natural language processing and finite-state automata. It covers topics such as morphology, N-grams, parts-of-speech tagging, and state transition tables. The tutorial aims to assess understanding of these concepts through various questions.

Uploaded by

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

Tutorial I

I. Choose the correct one.


1. What is a meaning of Morphology?
The study of word format B. The study of sentence format
C. The study of syntax of sentence D. The study of semantics of sentence.
2. N-grams are defined as the combination of N keywords together. How many bi-grams can
be generated from the given sentence: “Education is the most powerful weapon which
you can use to change the world”.
A. 14 B. 13 C. 12 D. 11
3. What is the number of Trigrams in a normalized sentence of length of N words?
A. N B. N-1 C. N-2 D. N-3
4. Which python library use to implement natural language processing?
A. NLTK B. Scrapy C. Matplotlib,- D. Pydot
5. Parts-of-Speech tagging determines ___________
A. part-of-speech for each symbol only generated dynamically as per meaning of the
sentence
B. part-of-speech for each word dynamically as per sentence structure
C. all stem for a specific word given as input
D. all lema for a specific word given as input

II. Answer the following.


1. What are the solutions of NFSA?
2. Construct state transition table for the following by describing the type of FSA.

3. Present finite-state automaton from the following state transition table describing the
type of FSA.
State Input 0 Input 1
q0 q0, q1 q0, q2
q1 q3 null
q2 null q3
q3 null null

4. Evaluate the ordering strategies of NFSA to explore the possible paths through a
machine.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy