Cover Image

Theoretical Analysis of Byte-Pair Encoding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kozma, László, Voderholzer, Johannes
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computation and Language
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)

Compact representations of pattern-avoiding permutations
by: Kozma, László, et al.
Published: (2025)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
by: Hu, Jialu, et al.
Published: (2024)

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
by: Abrahamsen, Mikkel, et al.
Published: (2024)

An Optimal Randomized Algorithm for Finding the Saddlepoint
by: Dallant, Justin, et al.
Published: (2024)

Succinct Planar Encoding with Minor Operations
by: Kammer, Frank, et al.
Published: (2023)

Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing
by: Shi, Freda, et al.
Published: (2024)

Fast Exact Retrieval for Nearest-neighbor Lookup (FERN)
by: Zhu, Richard
Published: (2024)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
by: Shanto, MD Nazmul Alam, et al.
Published: (2026)

On the Complexity of the Matching Problem of Regular Expressions with Backreferences
by: Kumabe, Soh, et al.
Published: (2026)

Towards Optimal Multi-draft Speculative Decoding
by: Hu, Zhengmian, et al.
Published: (2025)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
by: Konstantinovsky, Thomas, et al.
Published: (2026)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
by: Hammer, Nina, et al.
Published: (2022)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)

Sequence graphs realizations and ambiguity in language models
by: Khalife, Sammy, et al.
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Encoding Co-Lex Orders of Finite-State Automata in Linear Space
by: Becker, Ruben, et al.
Published: (2025)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
by: Leutgeb, Lorenz, et al.
Published: (2022)

Servicing Matched Client Pairs with Facilities
by: Abbasi, Fateme, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Coupling without Communication and Drafter-Invariant Speculative Decoding
by: Daliri, Majid, et al.
Published: (2024)

AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
by: Tatsuno, Kento, et al.
Published: (2024)

Tokenisation over Bounded Alphabets is Hard
by: Kastreva, Violeta, et al.
Published: (2025)

Minimum projective linearizations of trees in linear time
by: Alemany-Puig, Lluís, et al.
Published: (2021)

Characterizing the Effect of Noise in Language Generation in the Limit
by: Li, Aaron, et al.
Published: (2026)

Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm
by: Zanzotto, Fabio Massimo, et al.
Published: (2026)

A Partition Cover Approach to Tokenization
by: Lim, Jia Peng, et al.
Published: (2025)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
by: Borchmann, Łukasz, et al.
Published: (2020)

Algorithmically Establishing Trust in Evaluators
by: de Wynter, Adrian
Published: (2025)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
by: Ma, Xinran, et al.
Published: (2025)

Small Space Encoding and Recognition of $k$-Palindromic Prefixes
by: Bathie, Gabriel, et al.
Published: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)

Encodings for Range Minimum Queries over Bounded Alphabets
by: Jo, Seungbum, et al.
Published: (2026)

Longest Unbordered Factors on Run-Length Encoded Strings
by: Sekizaki, Shoma, et al.
Published: (2025)

Faster All-Pairs Optimal Electric Car Routing
by: Dorfman, Dani, et al.
Published: (2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)