Maswali yanayounganishwa na mwongozo · Kati Kiwango

Maswali ya Kuchanganua Utegemezi

Angalia ujuzi wako wa miti tegemezi, mahusiano yanayotegemea vichwa, mikakati ya wachanganuzi, Mategemeo ya Jumla, na bao la biaffine.

Njia za mwongozo zinazohusianaUchanganuzi wa Kutegemea
Swali 1 ya 8

Katika uchanganuzi tegemezi, muundo wa sentensi unawakilishwa vipi?

Hakiki kila swali8 maswali

Majibu na maelezo huonekana unapojibu maswali.

  1. Katika uchanganuzi tegemezi, muundo wa sentensi unawakilishwa vipi?
    • Kama mti wa viungo vilivyoelekezwa, vilivyo na lebo kutoka kwa kila neno hadi kichwa chake
    • Kama mabano ya vifungu vya maneno pekee
    • Kama orodha bapa ya masafa ya maneno
    • Kama spectrogram ya sauti
  2. Katika 'Mbwa alimfukuza paka,' ni nini kwa kawaida mzizi wa mti tegemezi?
    • mbwa
    • kufukuzwa
    • ya
    • paka
  3. Je, uchanganuzi wa utegemezi unatofautiana vipi na uchanganuzi wa eneo bunge?
    • Inaweka maneno katika vifungu vya maneno badala ya kuunganisha maneno binafsi
    • Inafanya kazi kwa nambari tu
    • Inaunganisha maneno ya kibinafsi kwa mahusiano ya moja kwa moja badala ya kuyaweka katika vifungu vya maneno
    • Inapuuza vitenzi kabisa
  4. Je, ni faida gani ya vichanganuzi vinavyotegemea mpito?
    • Hazihitaji data ya mafunzo
    • Wanafanya kazi kwa Kiingereza tu
    • Wanatoa sauti
    • Kwa kawaida ni haraka, hukimbia kwa wakati wa mstari
  5. What does Universal Dependencies offer researchers and parser developers?
    • Shared annotation guidelines and dependency relations used across many language treebanks
    • A dataset containing only English audio
    • A fixed list of named entities for every document
    • A guarantee that every parser reaches the same accuracy
  6. What does a biaffine scorer do in a neural dependency parser?
    • It converts sentences directly into audio
    • It scores candidate head-dependent arcs and their dependency labels
    • It assigns image masks to pixels
    • It guarantees a fixed accuracy on every benchmark
  7. In a basic dependency tree, what is true of a non-root word?
    • It must be the sentence’s main verb
    • It has no relation label
    • It has one syntactic head
    • It belongs to exactly one nested phrase only
  8. How does a graph-based parser commonly form a dependency tree?
    • By translating each token independently
    • By grouping words only into phrase brackets
    • By removing all function words before parsing
    • By scoring candidate arcs and selecting a well-formed tree