paper-with-me

홈 › Papers

CompoundPiece: Evaluating and Improving Decompounding Performance of Language Models

2023-05-23 · Benjamin Minixhofer, Jonas Pfeiffer, Ivan Vulić

While many languages possess processes of joining two or more words to create compound words, previous studies have been typically limited only to languages with excessively productive compound formation (e.g., German, Dutch) and there is no public dataset containing compound and non-compound words across a large number of languages. In this work, we systematically study decompounding, the task of splitting compound words into their constituents, at a wide scale. We first address the data gap by introducing a dataset of 255k compound and non-compound words across 56 diverse languages obtained from Wiktionary. We then use this dataset to evaluate an array of Large Language Models (LLMs) on the decompounding task. We find that LLMs perform poorly, especially on words which are tokenized unfavorably by subword tokenization. We thus introduce a novel methodology to train dedicated models for decompounding. The proposed two-stage procedure relies on a fully self-supervised objective in the first stage, while the second, supervised learning stage optionally fine-tunes the model on the annotated Wiktionary data. Our self-supervised models outperform the prior best unsupervised decompounding models by 13.9% accuracy on average. Our fine-tuned models outperform all prior (language-specific) decompounding tools. Furthermore, we use our models to leverage decompounding during the creation of a subword tokenizer, which we refer to as CompoundPiece. CompoundPiece tokenizes compound words more favorably on average, leading to improved performance on decompounding over an otherwise equivalent model using SentencePiece tokenization.

📄 PDF Abstract BibTeX arXiv:2305.14214

Code (1)

bminixhofer/compoundpiece 공식 구현 tf

Methods 이 논문이 사용한 방법론

BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
SentencePiece 설명 없음

Similar Papers 제목 키워드 기반

Using Semantics for Granularities of Tokenization

2018-09-01 · CL 2018 9 · Martin Riedl, Chris Biemann

Depending on downstream applications, it is advisable to extend the notion of tokenization from low-level character-based token boundary detection to identification of meaningful and useful language units. This entails b…

Boundary DetectionInformation RetrievalPOSPOS Tagging+1

Counting What Counts: Decompounding for Keyphrase Extraction

2015-07-01 · WS 2015 7 · Nicolai Erbs, Pedro Bispo Santos, Torsten Zesch, Iryna Gurevych
ChunkingInformation RetrievalKeyphrase ExtractionLemmatization+2

Wordsyoudontknow: Evaluation of lexicon-based decompounding with unknown handling

2014-08-01 · WS 2014 8 · Karolina Owczarzak, Ferdin de Haan, , George Krupka 외
Information RetrievalMachine TranslationMorphological Analysis

Evaluating Persian Tokenizers

2022-02-22 · Danial Kamali, Behrooz Janfada, Mohammad Ebrahim Shenasa, Behrouz Minaei-Bidgoli

Tokenization plays a significant role in the process of lexical analysis. Tokens become the input for other natural language processing tasks, like semantic parsing and language modeling. Natural Language Processing in P…

Language ModelingLanguage ModellingLexical AnalysisSemantic Parsing

Consolidating and Developing Benchmarking Datasets for the Nepali Natural Language Understanding Tasks

2024-11-28 · Jinu Nyachhyon, Mridul Sharma, Prajwal Thapa, Bal Krishna Bal

The Nepali language has distinct linguistic features, especially its complex script (Devanagari script), morphology, and various dialects, which pose a unique challenge for natural language processing (NLP) evaluation. W…

BenchmarkingNatural Language InferenceNatural Language UnderstandingSentence+1