Idanwo ti o sopọ mọ itọsọna · Rọrun Ipele
Awoye-ọrọ Tokenization adanwo
Test vocabulary tradeoffs, BERT WordPiece, continuation markers, SentencePiece whitespace, numerical IDs, shared pieces, Unigram pruning, and libraries.
Ibeere 1 ti 8
Awọn aropin fokabulari wo ni o ṣeduro aṣoju awọn fọọmu ọrọ toje nipasẹ awọn ege atunlo kekere?
Awotẹlẹ gbogbo ibeere8 ibeere
Awọn idahun ati awọn alaye han bi o ṣe n mu ibeere naa.
- Awọn aropin fokabulari wo ni o ṣeduro aṣoju awọn fọọmu ọrọ toje nipasẹ awọn ege atunlo kekere?
- Every smaller piece necessarily has one unique dictionary meaning
- A finite word-only vocabulary cannot allocate an entry to every possible word form
- A subword model requires no numerical input representation
- Whole-word vocabularies cannot contain any common word
- Eyi ti subword tokenizer wo ni atilẹba BERT lilo?
- A word-only alphabetical index
- A mandatory one-byte-per-word lookup
- WordPiece
- An image-pixel segmentation network
- Iru ìpele wo ni o ṣe samisi awọn ege itesiwaju ti inu ni apejọ WordPiece ti a tẹjade BERT?
- ##
- A required trailing full stop
- A leading plus sign on every whole word
- Capitalization of every suffix
- Ohun-ini mimu-imudaniloju SentencePiece wo ni o ṣe atilẹyin ọrọ laisi awọn aala ọrọ alafo funfun?
- It requires every word to have spaces on both sides
- It translates every sentence into English before segmentation
- It deletes all non-Latin characters before training
- It can train from raw sentences without language-specific word pre-tokenization
- Kini ajeku ọrọ-ọrọ kọọkan ni ipari ṣe maapu si ṣaaju ki o to de awoṣe naa?
- Awọ kan
- Nẹtiwọọki nkankikan lọtọ
- ID odidi kan
- Agekuru ohun
- If related word forms share an available vocabulary piece, what can that sharing support?
- A guarantee that every token is a correct linguistic morpheme
- Reuse of the representation associated with that piece
- Deletion of every differing suffix from the original input
- A requirement that all related words receive the same complete ID sequence
- How does Unigram vocabulary training differ from BPE's bottom-up pair merging?
- It requires a human dictionary definition for every piece
- It only merges the most frequent pair until the corpus is one token
- It permanently removes all character-level coverage regardless of configuration
- It starts with candidate pieces and prunes them according to an objective
- Why should SentencePiece not be treated as another name for the Unigram algorithm?
- It is a library that supports both Unigram and BPE models
- It is the name of BERT's ## continuation marker
- It is a universal ID-to-word table shared by every model
- It only implements whole-word splitting on English spaces