ガイド連動クイズ · 中 レベル

意味検索クイズ

近似インデックス、クロスエンコーダ再ランキング、DPR トレーニング、およびオフライン パッセージ エンコーディングを使用した、密なセマンティック検索とハイブリッド ランキングを研究します。

関連するガイドパスセマンティック検索
質問 1 の 8

What distinction describes a dense semantic retriever compared with a purely term-scored lexical baseline?

すべての質問をプレビューする8 質問

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

  1. What distinction describes a dense semantic retriever compared with a purely term-scored lexical baseline?
    • Every lexical system can match only identical raw bytes
    • Dense retrieval guarantees a correct answer for every paraphrase
    • It ranks using learned vector relationships rather than only term-based evidence
    • Semantic retrieval must ignore the query
  2. How can a dense search setup score a query against a passage?
    • By comparing compatible query and passage vectors using its trained metric
    • Only by sorting passage filenames
    • Only by taking the latest publication date
    • By requiring identical raw text in every result
  3. Why might a dense search experiment use an HNSW index?
    • To guarantee exact top results for every setting
    • To prove every neighbor is factually correct
    • To eliminate the need to encode searchable items
    • To reduce search work while accepting a possible nearest-neighbor recall tradeoff
  4. What computation distinguishes a cross-encoder reranking stage?
    • Only offline encoding of the passage without its query
    • Joint evaluation of the query with each selected candidate
    • Retraining the whole corpus encoder for every result
    • Removing all candidates before evaluating relevance
  5. 「ハイブリッド」検索システムとは何ですか?
    • セマンティック ベクトル スコアと従来のキーワード スコアを組み合わせたシステム
    • 電話とサーバーの両方で実行されるシステム
    • 画像と音声だけを検索するシステム
    • エンベディングを一切使用しないシステム
  6. In a RAG system using semantic retrieval, what does the retriever provide to the generator?
    • A guarantee that every final answer is true
    • Newly trained generator weights for each question
    • Selected source passages as context
    • A replacement for all response generation
  7. In the original DPR inference procedure, which representations are computed and indexed offline?
    • Vectors for every possible future question
    • Passage vectors for the searchable corpus
    • Final generated answers for every future user
    • Only scores from jointly processing unknown query-passage pairs
  8. What relationship does DPR’s training objective encourage for a question and its positive passage relative to negative passages?
    • An identical score for all positives and negatives
    • A lower positive score than every negative
    • Alphabetical ranking independent of encoder outputs
    • A higher dot-product score for the positive passage