Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 31 published solutions
Question 121 MCQ · 2.0 marks
Once the model is sufficiently trained, which of the following tokens will have the highest
probability to be the next token, if the input is “Sachin has”:
6406533822558.
broken
6406533822559.
acted
6406533822560.
highest
6406533822561.
None of these
**i-NLP**
**Section Id :** 64065379955
**Section Number :** 8
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 31
**Number of Questions to be attempted :** 31
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
Consider the following conversation:
User: “It’s quite cold in here.”
Bot: “Yes, the temperature is 20\(^{o}\)C.”
User: “Could you help?”
Bot: “What would you like help with?”
Which level of language processing is the chatbot failing to implement effectively?
6406533822564.
Lexical
6406533822565.
Discourse
6406533822566.
Pragmatic
6406533822567.
Syntactic
A published solution is not available for this question yet.
Which of the following statements correctly describes the relationship between Finite State
Automata (FSA) and Finite State Transducers (FST)?
6406533822588.
FSAs are designed solely for recognizing patterns in input strings, while FSTs
can recognize patterns and produce corresponding outputs.
6406533822589.
Both FSAs and FSTs utilize a single tape for processing input, but FSAs have a
fixed number of states while FSTs can dynamically change the number of states during execution.
6406533822590.
FSTs can be used to perform computations involving multiple input tapes,
whereas FSAs are limited to a single input tape.
6406533822591.
FSA can produce outputs based on their input states, while FSTs are only
capable of recognizing inputs without generating outputs.
A published solution is not available for this question yet.
In evaluating a dependency parser, the following results were obtained on a test set of 500 words:
• 450 words have the correct head
• 425 words have both the correct head and correct label
• 475 words have the correct label
What are the Unlabeled Attachment Score (UAS) and Label Accuracy Score (LS)?
6406533822630.
UAS: 90%, LS: 95%
6406533822631.
UAS: 90%, LS: 85%
6406533822632.
UAS: 85%, LS: 95%
6406533822633.
UAS: 85%, LS: 90%
A published solution is not available for this question yet.
Which evaluation metric would you use to measure the proportion of correct dependency
relations retrieved by a parser from the total number of correct relations?
6406533822636.
Precision
6406533822637.
Recall
6406533822638.
F1 Score
6406533822639.
Accuracy
A published solution is not available for this question yet.
In a semantic role labeling evaluation, a model has identified 100 correct semantic roles out of 120
total semantic roles it predicted. What is the precision of the model as a decimal (rounded to two
decimal places)?
A published solution is not available for this question yet.