Guide-yakabatana mibvunzo · Pakati Nhanho

Dependency Parsing Quiz

Tarisa ruzivo rwako rwemiti yekutsamira, hukama-inotsamira mumusoro, nzira dzeparser, Universal Dependencies, uye biaffine scoring.

Nzira dzekutungamira dzinoenderanaDependency Parsing
Mubvunzo 1 ye 8

Mukutsamira kwekutsamira, chimiro chemutsara chinomiririrwa sei?

Tarisa mubvunzo wese8 mibvunzo

Mhinduro uye tsananguro zvinoonekwa paunenge uchitora bvunzo.

  1. Mukutsamira kwekutsamira, chimiro chemutsara chinomiririrwa sei?
    • Semuti wakananga, wakanyorwa zvinongedzo kubva paizwi rimwe nerimwe kuenda kumusoro
    • Semabhuraketi emazwi akatenderedzwa chete
    • Sechinyorwa chakati sandara chemazwi emazwi
    • Se spectrogram yeodhiyo
  2. Muna 'Imbwa yakadzinga katsi,' chii chinowanzova mudzi wemuti wekutsamira?
    • imbwa
    • chased
    • the
    • katsi
  3. Kupatsanurwa kwedendency kunosiyana sei nekuparurwa kwedunhu?
    • Inoisa mazwi mumitsara yakatenderedzwa pane kubatanidza mazwi ega
    • Inoshanda chete panhamba
    • Inobatanidza mazwi ega ega nehukama hwakananga pane kuabatanidza mumitsara yakavakirwa
    • Inofuratira zviito zvachose
  4. Chii chakanakira chekuchinja-based parsers?
    • Ivo havadi data yekudzidziswa
    • Vanoshanda kuChirungu chete
    • Vanoburitsa audio
    • Iwo anowanzo mhanya, achimhanya munguva yemutsara
  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