가이드 연계 퀴즈 · 중간 레벨

의미 검색 퀴즈

대략적인 색인, 크로스 인코더 재순위, 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