Idanwo ti o sopọ mọ itọsọna · Alabọde Ipele

Gbolohun-BERT Awọn ifibọ adanwo

Test how sentence embeddings support scalable semantic search, including Matryoshka representations and cross-encoder reranking.

Jẹmọ itọsọna awọn ọnaGbolohun Bert Awọn ifibọ
Ibeere 1 ti 8

Iṣoro pataki wo pẹlu BERT itele ti Sentence-BERT yanju?

Awotẹlẹ gbogbo ibeere8 ibeere

Awọn idahun ati awọn alaye han bi o ṣe n mu ibeere naa.

  1. Iṣoro pataki wo pẹlu BERT itele ti Sentence-BERT yanju?
    • Ifiwera awọn gbolohun ọrọ lọpọlọpọ pẹlu BERT jẹ o lọra pupọ
    • BERT ko le ka ju gbolohun kan lọ
    • BERT n ṣiṣẹ ni Gẹẹsi nikan
    • BERT ko le ṣe atunṣe daradara
  2. Kini faaji nẹtiwọọki ti Sentence-BERT lo?
    • A nikan autoregressive decoder
    • Nẹtiwọọki siamese kan pẹlu awọn ile-iṣọ BERT pinpin iwuwo meji
    • A convolutional image nẹtiwọki
    • Aṣoju imuduro-ẹkọ
  3. Which pooling strategy did the original Sentence-BERT paper evaluate for creating sentence embeddings?
    • Ijọpọ ti o pọju lori awọn ori akiyesi
    • Lilo ohun kikọ akọkọ nikan
    • Itumo pipọ lori awọn ifibọ àmi
    • Aṣayan ID ti aami kan
  4. Ni kete ti awọn gbolohun ọrọ ti wa ni ifibọ, bawo ni a ṣe n ṣe iwọn ibajọra wọn deede?
    • Ṣiṣe BERT lẹẹkansi lori mejeji
    • Kika awọn ohun kikọ ti o pin
    • Ifiwera awọn iwọn faili
    • Cosine ibajọra (ọja aami kan) laarin awọn fekito
  5. What training data did the original Sentence-BERT paper use for NLI fine-tuning?
    • Natural Language Inference examples labeled for entailment, contradiction and neutral relations
    • Only satellite images with land-cover labels
    • Only audio recordings with speaker labels
    • Only source code and bug reports
  6. In a possible semantic-retrieval workflow, what can a Sentence-BERT bi-encoder do?
    • Cross-attend to every query-candidate pair before any encoding
    • Encode a query and candidate texts separately so vector similarity can rank candidates
    • Guarantee retrieval quality for every corpus
    • Replace the need to evaluate relevance
  7. What does Matryoshka Representation Learning enable for an embedding?
    • It guarantees identical quality at every vector size
    • It converts embeddings into labeled text tokens
    • A single representation can be truncated to different dimensions to trade storage or compute for task performance
    • It removes the need for similarity comparisons
  8. In a common hybrid retrieval pipeline, what happens after a bi-encoder retrieves candidate passages?
    • The candidate text is converted into audio
    • The bi-encoder is discarded and no ranking occurs
    • The system averages all documents into one sentence
    • A cross-encoder can score query-passage pairs to rerank the candidates