テキスト分類クイズ

クイズに答えると、答えと解説が表示されます。

1. How does a text classifier structure the output for an input document?
   • By necessarily translating it into another language
   • By assigning one or more predefined category labels
   • By generating only a new unrelated paragraph
   • By changing its compressed file format
2. マルチラベル分類の例はどのシナリオですか?
   • 電子メールをスパムまたはスパムではないものとしてマークする
   • チケットを 1 つの部門だけにルーティングする
   • 単一星評価の選択
   • 記事に「政治」と「経済」を同時にタグ付けする
3. On a text dataset dominated by one class, what can a high overall accuracy conceal?
   • An inability to calculate any metric
   • Proof that recall equals one for every category
   • Failure to identify cases of a rare class
   • A guarantee that every minority example is correct
4. 分類タスクでリコールは何を測定しますか?
   • システムが捕捉できた実際のケースの数
   • 実際に正しいフラグが設定された項目の数
   • モデルの実行速度
   • モデルの大きさはどれくらいですか
5. In task-specific zero-shot text classification, what is absent for the new classification task?
   • All model pretraining of any kind
   • Every description of the candidate categories
   • The ability to use any learned representation
   • Labeled training examples for that task
6. How can learned text embeddings contribute to a classification pipeline?
   • They guarantee perfect predictions on every new domain
   • They provide numerical features used to compute label scores
   • They delete every grammatical distinction by definition
   • They replace all label definitions with filenames
7. A stated text-classification evaluation has six true positives and two false positives. What is precision for the designated positive class?
   • 75 percent
   • 25 percent
   • 100 percent
   • Six percent
8. Which output-score design permits several text labels to score highly at once rather than requiring scores to sum to one?
   • A single softmax over mutually exclusive classes
   • A rule requiring exactly one positive label
   • A separate sigmoid output for each label
   • A filename-only representation without label scores