Documentdetail
ID kaart

oai:arXiv.org:2404.00397

Onderwerp
Computer Science - Computation and...
Auteur
Cognetta, Marco Hiraoka, Tatsuya Okazaki, Naoaki Sennrich, Rico Pinter, Yuval
Categorie

Computer Science

Jaar

2024

vermelding datum

03-04-2024

Trefwoorden
vocabulary trimming subwords
Metriek

Beschrijving

We explore threshold vocabulary trimming in Byte-Pair Encoding subword tokenization, a postprocessing step that replaces rare subwords with their component subwords.

The technique is available in popular tokenization libraries but has not been subjected to rigorous scientific scrutiny.

While the removal of rare subwords is suggested as best practice in machine translation implementations, both as a means to reduce model size and for improving model performance through robustness, our experiments indicate that, across a large space of hyperparameter settings, vocabulary trimming fails to improve performance, and is even prone to incurring heavy degradation.

;Comment: 15 pages

Cognetta, Marco,Hiraoka, Tatsuya,Okazaki, Naoaki,Sennrich, Rico,Pinter, Yuval, 2024, An Analysis of BPE Vocabulary Trimming in Neural Machine Translation

Document

Openen

Delen

Bron

Artikelen aanbevolen door ES/IODE AI

Systematic druggable genome-wide Mendelian randomization identifies therapeutic targets for lung cancer
agphd1 subtypes replication hykk squamous cell gene carcinoma causal targets mendelian randomization cancer analysis