Search Header Logo

NLP301c quiz7

Authored by Nguyen Duc Chinh - HE150974

World Languages

University

Used 1+ times

NLP301c quiz7
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The job of a POS tagger is to resolve this _________accurately based on the context of use.

Complexity

Simplicity

Ambiguity

Quality

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

__________may be defined as the linguisticexpression to denote an entity or individual.

Coherence

Reference

Discourse

None of the above

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following best describes grammar induction?

Supervised learning problem

Conditional Random Field problem

Maximum-A-Posteriori (MAP) estimation problem

Unsupervised learning problem

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given a sentence S="w1 w2 w3 ... wn", to compute the likelihood of S using a bigram model. How would you compute the likelihood of S?

Calculate the conditional probability of each word in the sentence given the preceding word and add the resulting numbers

Calculate the conditional probability of each word in the sentence given the preceding word and multiply the resulting numbers

Calculate the conditional probability of each word given all preceding words in a sentence and add the resulting numbers

Calculate the conditional probability of each word given all preceding words in a sentence and multiply the resulting numbers

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which is not a task of reference resolution

Coreference Resolution

Constraint Resolution

Constraint Coreference Resolution

Pronomial Anaphora Resolution

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Essentially,______is about the way conversation works in practice.

Deixis

Implicature

Presupposition (PSP)

Conversational Structure

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If we can eliminate________ from an FA, then our construction of an FA from a regular expression can be completed.

Epsilon transitions

States

DFA

NFA

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for World Languages