nansi ingcaphuno mayelana nokubethela kwe-byte pair for encryption, yiziphi izinzuzo lo mqondo onazo ngaphandle kokucindezela?
Context:I-Byte pair encoding (BPE) noma i-digram coding iyindlela elula futhi eqinile yokucindezela idatha lapho umbhangqwana ojwayelekile kakhulu wama-byte ahlangene wedatha kulandelana ushintshwa nge-byte engekho kulandelana. Ithebula lokubheka lezindawo ezibuyiselwe liyadingeka ukuze kwakhiwe kabusha idatha yokuqala. I-algorithm yaqala ukuchazwa esidlangalaleni nguPhilip Gage ngoFebhuwari 1994 esihlokweni esithi "A New Algorithm for Data Compression" kuC Users Journal.  Okunye okuguquguqukayo kwalobu buchwepheshe kuboniswe ukuthi kuyasebenza emikhakheni eminingana yokucubungula ulimi lwemvelo (i-NLP), ngezicelo ezifana nokwenziwa kwamathokheni, njengoba kubonakala ku-Google's SentencePiece naku-OpenAI's GPT-3. Lapha, umgomo awukona ukucindezelwa kwedatha, kodwa ukufaka umbhalo ngolimi olunikeziwe ukuze kukhiqizwe ukulandelana okuguqukayo kwamagama kusuka kusisho sezinhlamvu ezinobukhulu obuhleliwe. Ngokuvamile, iningi lamagama lizobhalwa njengethokheni elilodwa, kuyilapho amagama angavamile ezofakwa njengokulandelana kwamathokheni ambalwa, lapho la mathokheni emelela izingxenye zamagama anencazelo. Lokhu kuhunyushwa kombhalo ube amathokheni kungatholakala ngezindlela ezihlukahlukene zokufaka amakhodi ama-byte pair, njengama-subword units.  I-Byte pair encoding iyafaneleka emisebenzini ye-NLP ngenxa yobulula nesivinini sayo; I-BPE isebenza kahle ekufakweni kwamathokheni, ayidingi izindleko ezinkulu zokubala, futhi ihlala ihambisana, iyenza ithembeke.
Ukusetshenziswa okunye kokufaka amakhodi ngama-byte pair ngaphandle kokucindezela kungaba yi-tokenization. Ukwenza uphawu kungasetshenziswa ku-Natural Language Processing ukufaka amakhodi wamagama ukuze kube lula futhi kusheshe emisebenzini ye-NLP.