Tokenisation is NP-Complete
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916534304112640 |
|---|---|
| author | Whittington, Philip Bachmann, Gregor Pimentel, Tiago |
| author_facet | Whittington, Philip Bachmann, Gregor Pimentel, Tiago |
| contents | In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $δ$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge operations (bottom-up tokenisation). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_15210 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tokenisation is NP-Complete Whittington, Philip Bachmann, Gregor Pimentel, Tiago Data Structures and Algorithms Computation and Language Formal Languages and Automata Theory In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $δ$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge operations (bottom-up tokenisation). |
| title | Tokenisation is NP-Complete |
| topic | Data Structures and Algorithms Computation and Language Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2412.15210 |