Ikibazo gihuza ibibazo · Hagati Urwego

Ikibazo cyo Kwishingikiriza Ikibazo

Reba ubumenyi bwawe bwibiti biterwa, umubano ushingiye kumutwe, ingamba za parser, Kwishingira kwisi yose, hamwe n amanota ya biaffine.

Inzira zijyanye no kuyoboraKwishingikiriza
Ikibazo 1 Bya 8

Mu gusesengura gushingiye, imiterere yinteruro igaragazwa ite?

Reba buri kibazo8 ibibazo

Ibisubizo nibisobanuro bigaragara mugihe ufata ikibazo.

  1. Mu gusesengura gushingiye, imiterere yinteruro igaragazwa ite?
    • Nkigiti cyerekanwe, cyanditseho amahuza kuva buri jambo kugeza kumutwe wacyo
    • Nka interuro yatondekanye gusa
    • Nkurutonde ruringaniye rwijambo ryinshyi
    • Nka ecran ya majwi
  2. Muri 'Imbwa yirukanye injangwe,' ni ubuhe muzi w'igiti gishingiye?
    • imbwa
    • birukanwe
    • i
    • injangwe
  3. Nigute gutandukanya kwishingira gutandukana no gutandukanya intore?
    • Itondekanya amagambo mumagambo yashizwemo aho guhuza amagambo kugiti cye
    • Ikora ku mibare gusa
    • Ihuza amagambo kugiti cye muburyo butaziguye aho kuyashyira mumagambo ateganijwe
    • Irengagiza inshinga rwose
  4. Ni izihe nyungu zo gushingira ku nzibacyuho?
    • Ntibasaba amakuru yamahugurwa
    • Bakorera icyongereza gusa
    • Basohora amajwi
    • Mubisanzwe birihuta, biruka mugihe cyumurongo
  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