Quiz buy saytu dependence

Sooy def quiz bi, tontu yi ak leeral yi dañuy feeñ.

1. Ci jàngat dependency, naka lañuy wane jumtukaayu frase bi?
   • Ni garabu lëkkalekaay buñ teg, daal di tàmbalee ci baat bu nekk dem ba ci boppam
   • Ni parenthèse phrase yuñ boole
   • Ni limu baat yu bari
   • Spektrogram bu audio bi
2. Ci 'Xaj bi dafa topp muus mi,' lan mooy reenu garabu dependence bi?
   • xaj
   • topp
   • bi
   • muus
3. Lan moo wuutale jàngat dependence ak jàngat circonscription?
   • Dafay boole baat yi ci ay mbind yuñ boole, du boole ay baat benn-benn
   • Ci nimero rek lay dox
   • Dafay lëkkale benn-benn baat ci diggante bu jub, du leen boole ci ay mbind yuñ boole
   • Dafay baña bàyyi xel ci verb yi
4. Lan mooy njariñu parser yu lalu ci tranzisioŋ?
   • Soxla wuñu benn done tàggat
   • Angale rek lañuy liggéey
   • Dañuy génne audio
   • Dañu gaaw lool, di daw ci diir bu ligneer
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