Oct 2026· Applied and Computational Engineering· 0 citations
Natural Language Processing TechniquesTopic Modeling
Abstract
Chinese text requires substantially more tokens than English in large language models (LLMs), increasing API costs and context-window consumption. Most prior work measures this premium using off-the-shelf tokenizers, but the underlying mechanism—where the additional tokens actually arise—remains poorly understood, particularly under data-constrained training, which is common in domain-specific and small-scale models. We implement BPE, WordPiece, and Unigram from scratch (approximately 1,000 lines of standard-library code), train them on 20,000 Chinese news documents, and quantify per-character tokenization across vocabulary sizes from 8K to 128K. Characters are grouped by frequency, and evaluation uses a held-out test set with clustered-bootstrap confidence intervals. The central result is a low-frequency fragmentation effect: at an 8K vocabulary, byte-level BPE splits characters appearing fewer than 100 times in training into an average of 2.04 tokens per character, compared with 1.00 for high-frequency characters; enlarging the vocabulary 16-fold reduces this value to 1.10 at a fixed training scale. Comparison with production tokenizers reveals a spectrum from 2.24 (OpenAI's cl100k) and 2.04 (our 8K implementation) to 1.02 (DeepSeek's Chinese-optimized 128K vocabulary), indicating that the effect depends on vocabulary allocation and training scale rather than being an inherent property of Chinese. A semantic-equivalence experiment further supports this conclusion: for equivalent Chinese-English sentence pairs, an English-centric tokenizer uses 65% more tokens for Chinese, whereas a balanced byte-level BPE trained on 20,000 documents (10K Chinese + 10K English) uses 27% fewer. The paper concludes with configuration guidance for Chinese-focused tokenizers under data constraints.
Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...
O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al.· Zenodo (CERN European Organi...· 465 citations
The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.
Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al.· IEEE Transactions on Softwar...· 178 citations· ⚡14
Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.
M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al.· e-Informatica Software Engin...· 157 citations· ⚡17
This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.
Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al.· Empirical Software Engineeri...· 127 citations· ⚡15
The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.
Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al.· Journal of Systems and Softw...· 111 citations· ⚡8
The ongoing work building a Raspberry Pi cluster consisting of 300 nodes is presented, with potential use cases being an inexpensive and green test bed for cloud computing research and a robust and mobile data center for operating in adverse environments.
P. Abrahamsson, S. Helmer, Nattakarn Phaphoom et al.· IEEE International Conferenc...· 110 citations· ⚡7
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.