Natural Language Processing - Unit-1
Athe smallest sound unit of a language
Ba complete sentence
Cthe smallest meaningful unit of a language
Da group of paragraphs
Correct Answer
the smallest meaningful unit of a language
Acan stand alone as a word
Bmust always be attached to another morpheme
Chas no meaning
Dis always a suffix
Correct Answer
can stand alone as a word
Correct Answer
-ing
Achanges the grammatical form of a word, such as number or tense
Balways creates a word of a new category
Cremoves all affixes
Dsplits text into sentences
Correct Answer
changes the grammatical form of a word, such as number or tense
Aonly marks the plural
Bonly marks the tense
Cnever changes the meaning
Dcreates new words, often changing the word category
Correct Answer
creates new words, often changing the word category
Atoken
Bcorpus
Cstem
Dsuffix
Correct Answer
stem
Athe canonical dictionary form of a word
Bthe last letter of a word
Ca punctuation mark
Da random token
Correct Answer
the canonical dictionary form of a word
Atranslating text into another language
Btagging parts of speech
Csplitting text into tokens such as words and punctuation
Dbuilding a parse tree
Correct Answer
splitting text into tokens such as words and punctuation
Aa single letter
Ba sentence boundary
Ca type of suffix
Dan abstract unit of meaning that groups together related word forms
Correct Answer
an abstract unit of meaning that groups together related word forms
AMandarin Chinese
BEnglish
CTurkish
DFrench
Correct Answer
Turkish
Ajoining many morphemes, each usually carrying one meaning
Busing only single-morpheme words
Cdropping all vowels
Dusing only prefixes
Correct Answer
joining many morphemes, each usually carrying one meaning
Aa regular form
Ba derivational suffix
Can irregular form
Da stop word
Correct Answer
an irregular form
Aspeech synthesis only
Bimage compression
Cmorphological analysis and generation
Ddatabase indexing
Correct Answer
morphological analysis and generation
AChomsky
BPorter
CKoskenniemi
DZipf
Correct Answer
Koskenniemi
Alearns rules without any data
Buses no stored words
Cstores all the word forms of the language in a lexicon
Dworks only for speech
Correct Answer
stores all the word forms of the language in a lexicon
Alearning the morphological structure of a language from unannotated text
Bwriting the dictionary by hand
Ctranslating words
Ddetecting sentence boundaries
Correct Answer
learning the morphological structure of a language from unannotated text
Aalways returns the dictionary form
Bneeds a full parse tree
Cworks only on sentences
Dusually strips affixes crudely and may not give a real word
Correct Answer
usually strips affixes crudely and may not give a real word
Aa neural language model
Ba rule-based suffix-stripping algorithm
Ca parsing algorithm
Da sentence boundary detector
Correct Answer
a rule-based suffix-stripping algorithm
Asentences never end
Btext has no punctuation at all
Cthe period can also mark abbreviations and decimal numbers
Dwords have no meaning
Correct Answer
the period can also mark abbreviations and decimal numbers
Asingle characters
Brandom sentences
Cidentical paragraphs
Dtopically coherent segments
Correct Answer
topically coherent segments
Adiscriminative local classification
Bunsupervised clustering
Cgenerative sequence classification
Drule-based matching
Correct Answer
generative sequence classification
Aclassified independently using features of its context
Bignored completely
Cgenerated from a grammar
Dchosen randomly
Correct Answer
classified independently using features of its context
Agenerative language models
Bdiscriminative sequence models
Crule-based stemmers
Ddictionary lookup tables
Correct Answer
discriminative sequence models
AThe word before and after the punctuation mark
BThe colour of the page
CThe size of the file
DThe font of the text
Correct Answer
The word before and after the punctuation mark
Aprecision, recall and F-measure
Bperplexity only
Ccompression ratio
Dframe rate
Correct Answer
precision, recall and F-measure
Fill in the Blanks
26
The smallest meaningful unit of a language is called a __________.
Correct Answer
morpheme
27
A morpheme that cannot stand alone as a word is called a __________ morpheme.
Correct Answer
bound
28
__________ morphology creates new words, for example happy to happiness.
Correct Answer
Derivational
29
__________ morphology expresses grammatical features such as plural and tense.
Correct Answer
Inflectional
30
Splitting text into words and punctuation is called __________.
Correct Answer
tokenization
31
The dictionary form of a word is called its __________.
Correct Answer
lemma
32
Turkish is an __________ language in which many morphemes are joined together.
Correct Answer
agglutinative
33
Two-level morphology was proposed by __________.
Correct Answer
Koskenniemi
34
__________ is a crude process of removing suffixes from words.
Correct Answer
Stemming
35
The __________ stemmer is a well-known suffix-stripping algorithm.
Correct Answer
Porter
36
Detecting where sentences end is called sentence __________ detection.
Correct Answer
boundary
37
Dividing a document into topically coherent parts is called __________ segmentation.
Correct Answer
topic
38
Hidden Markov Models are __________ models of sequences.
Correct Answer
generative
39
CRF stands for Conditional __________ Field.
Correct Answer
Random
40
Finite-state __________ are used for morphological analysis and generation.
Correct Answer
transducers