Assessing Dutch Syllabification Algorithms and Improving Accuracy by Combining Phonetic and Orthographic Information through Deep Learning

# Assessing Dutch Syllabification Algorithms and Improving Accuracy by Combining Phonetic and Orthographic Information through Deep Learning
Source: [https://arxiv.org/html/2605.28834](https://arxiv.org/html/2605.28834)
Gus Lathouwers∗\\emailguslathouwers@gmail\.com Wieke Harmsen∗\\emailwieke\.harmsen@ru\.nl Catia Cucchiarini∗\\emailcatia\.cucchiarini@ru\.nl Helmer Strik∗\\emailhelmer\.strik@ru\.nl

###### Abstract

Syllabification describes the task of dividing words into syllables\. Due to many rules and exceptions, training an algorithm to perform syllabification with high accuracy remains a challenge\. Throughout the last decades, different algorithms have been put forth for Dutch syllabification, yet a comprehensive comparative assessment has not been done\. Additionally, deep learning has gained significant popularity within NLP in recent years, yet no modern deep\-learning based framework has been developed for Dutch orthographic syllabification\. Finally, phonetic and orthographic syllabification algorithms have been examined separately, but not in combination\. The aim of the current research was twofold: \(a\) to examine the performance of existing Dutch syllabification algorithms, and \(b\) to investigate whether combining phonetic and orthographic information into a single model can increase syllabification performance\. To compare the performance of algorithms, four algorithms \(Brandt Corstius, Liang, Trogkanis\-Elkan \(CRF\), and a newly conceived deep\-learning model\) were applied to three different datasets \(dictionary words, loanwords, pseudowords\)\. The algorithms show varying performance across datasets, with the data\-driven algorithms outperforming a knowledge\-based algorithm in all but one condition\. The new deep\-learning methods developed led to increased performance compared to the best found in the literature \(99\.65% word accuracy, a 0\.14% improvement\)\. An analysis of the words for which adding phonetic information improved syllabification performance indicates that these were words in which the orthographic ambiguity could be resolved by information on pronunciation\. Future research could examine other areas where phonetic information can benefit orthographic processing\. In addition, the newly developed deep learning frameworks can be applied to other languages than Dutch\.

## 1Introduction

Syllabification describes the task of dividing words into syllables\. Automated syllabification by algorithms remains a complex challenge due to the many rules and exceptions that govern syllable division\. For instance, Webster’s Dictionary lists more than twenty rules for dividing words into syllables in English, each with many idiosyncrasies and exceptions for individual words \(?\)\. For Dutch, syllable boundaries may be determined by different, sometimes competing, principles, such as the sonority principle, the maximum onset principle, and priority rules for prefixes and suffixes \(?,?\)\.

Beyond being of interest because of its theoretical complexity, syllabification plays an important role in underlying several Natural Language Processing \(NLP\) technologies, such as text\-to\-speech \(?,?\) and grammar processing applications \(?,?\)\. Syllable division can also be used to select texts with syllable properties, such as syllable length or specific syllable structures \(?\)\. Syllable analysis has also been used in document analysis to provide a benchmark for text complexity \(?,?\) or as a tool for rhyme analysis through identifying the last syllable of words \(?\)\.

In spite of its relevance, research on Dutch syllabification algorithms is outdated, with the last contribution stemming from?\. Existing research has generally been focused on developing new methods, instead of benchmarking existing ones\. Novel deep\-learning methods which have enjoyed widespread popularity within NLP in the last decade111See?for an overview\.have been used to create new deep learning solutions for syllabification in some languages \(?\), yet not the Dutch language\. One advantage of deep\-learning approaches is that they allow the incorporation of different sources of information, such as phonetic and orthographic data \(?\), which could ostensibly help improve syllabification accuracy\.

In this paper we present research that assesses existing Dutch syllabification algorithms by applying them to different datasets\. In addition, we investigate whether combining both phonetic and orthographic information through the use of novel deep\-learning techniques leads to better syllabification performance\.

### 1\.1Dutch syllabification algorithms

In this section, we present a brief overview of algorithms developed for syllabification over the years\. Initial work by?employed a knowledge\-based method to syllabify words, meaning it syllabified according to explicitly outlined grammar rules manually coded by Brandt Corstius\. Two decades later,?expanded on Brandt Corstius’ work by incorporating a lexical library among other improvements, allowing for more consistent syllabification results\. Simultaneously, challenges related to ambiguities from sentence context and semantic variation spurred a shift towards probabilistic and machine learning approaches\. Specifically,?introduced a different pattern\-based approach to hyphenating words, which gained popularity because it was language\-agnostic, meaning it was not tied to language\-specific spelling rules and could thus be applied to any language\. Work by?further explored pattern\-based processing and its application to Dutch\.

One issue that is important to clarify is the use of the terms ”hyphenation” versus ”syllabification\.” Although these terms are sometimes used interchangeably in the literature, they refer to inherently different ways of processing, with hyphenation describing word breaking according to spelling and grammar principles \(for Dutch, theGroene Boekjerules\)\(?\), whereas syllabification follows pronunciation conventions\. For the purposes of text analysis in language processing, syllabification is often preferred, as it matches syllable division in spoken language, which in turn can be used for applications that rely on the phonetic structure of words\. See Table[1](https://arxiv.org/html/2605.28834#S1.T1)for examples of words where hyphenation and syllabification produce different division patterns\.

While authors such as Brandt Corstius, Liang, and Boot focused their efforts on more traditional pattern\- or knowledge\-based systems initially, developments afterward saw interest in novel lines of machine learning technologies\. The first instance of a neural network applied to Dutch was formulated by?, who used a backpropagation setup to syllabify texts\. Afterwards,?employed a different finite\-state method for syllable boundary prediction that relies on automatic rule abstraction\. Approaching the problem from yet another machine learning perspective,?combined sequence prediction with support vector machines, showing good results across multiple languages, including Dutch and English\. The most recent method applied to Dutch syllabification was developed by?, who used a Conditional Random Field \(CRF\)\-based approach for syllabifying Dutch and English, achieving comparable results to?\.

### 1\.2Comparison of syllabification algorithms

Due to the large number of new machine learning methods being developed within NLP in the last decades, the importance of comparing existing algorithms has been noted, rather than just introducing new ones \(?\)\. Pitfalls of introducing new models without testing against existing ones include over\-optimization on customized datasets, as well as selective use of metrics that may present an algorithm in a more favorable way \(?\)\. For these reasons, establishing a performance baseline across algorithms \(?,?\) and creating a database of multiple datasets for future testing \(?\) could greatly improve understanding of algorithm performance tendencies\. Such systems may help reduce reporting bias and ensure consistent testing practices on carefully vetted datasets \(?\)\.

Full Dutch WordHyphenated222Retrieved from[https://github\.com/jitsi/jiwer](https://github.com/jitsi/jiwer)SyllabifiedTranslationelandelande\-landmooseatoomenergieatoom\-ener\-giea\-toom\-e\-ner\-gieatomic energygloriaglo\-riaglo\-ri\-agloriaaliënatieali\-ena\-tiea\-li\-e\-na\-tiealienationbakovenbak\-ovenbak\-o\-venbaking ovenbioscoopbio\-scoopbi\-o\-scoopcinemaruïneru\-ineru\-i\-neruinTable 1:Examples of Dutch words with different syllabification and hyphenation word divisions\.In the context of Dutch syllabification, no standardized review of existing algorithms exists, yet there are reasons to believe such a comparison could be of value\. Previous research on Dutch syllabification reports varying accuracy levels \(?,?,?\), but use different, sometimes incompatible metrics\. For example, hyphen accuracy \(the number of hyphens in words correctly predicted\) is difficult to reconcile with character accuracy \(the number of correctly predicted characters followed by a hyphen\) or word accuracy \(the number of words with all syllables predicted correctly\) \(?,?,?\)\. Differences in dataset filtering across studies also result in datasets with varying word makeup and size \(?,?\)\. A comparison using a single standardized dataset could help provide a coherent view of algorithm performance\.

### 1\.3Deep learning methods

Another area that has seen increased interest in the last decade concerns deep learning methods\. Beyond providing improved performance on many NLP tasks, deep learning may especially excel in complex pattern analysis by utilizing neural\-based pattern recognition techniques \(?\)\. For syllabification, neural based methods have been developed as well \(for Dutch, starting with Daelemans and van den Bosch, 1992\), showing potential for increased performance\. Recent lines of deep learning models typically employ techniques such as convolutional neural networks \(CNNs\) and Bidirectional Long Short\-Term Memory \(BiLSTM\), which have proven effective in tasks such as sequence modeling and feature extraction, due to their capacity for high\-level pattern analysis \(?,?\)\.

One key advantage of deep learning approaches is the degree of customizability in model design \(?\)\. In many cases, deep learning can be applied in an unsupervised manner, where models may autonomously learn to recognize patterns from raw data without the need for manually specified features \(?\)\. This allows for multi\-model layering setups, such as those used in data augmentation \(?\), or integrating multiple sources of information into a single model \(?\)\.

In addition to orthographic syllabification, a secondary area of interest has been applying syllabification algorithms to phonetic representations of words\. Syllabification algorithms have traditionally been applied to orthographic \(?\) and phonetic word representations \(?\) in isolation, but the two have not been combined yet\. Recent syllabification research has moved toward integrating orthographic with phonetic input by analyzing linguistic similarities between orthographic and phonetic words \(?\)\. To this effect, deep learning mechanisms such as attention may provide a means of creating overarching models that combine the two\.

### 1\.4Current study

The current study addresses the following two research questions:

1. 1\.RQ1: What is the comparative performance of different algorithms tested under identical conditions? To answer this question, we first provide a comparative overview of existing syllabification algorithms\. Previous research is fragmented with regard to methodology and datasets used, making it difficult to compare performance and generalizability across datasets\. Following this, several existing Dutch syllabification algorithms will be tested under identical conditions\. Additionally, a newly developed deep learning framework will be applied to Dutch orthography\. All algorithms will be tested on multiple datasets that have been curateda priorito allow for generalization benchmarking\.
2. 2\.RQ2: How does the addition of phonetic information affect Dutch orthographic syllabification performance? Existing research has investigated the performance of orthographic \(?\) and phonetic \(?\) syllabification separately, but not in combination\. Following an analysis of the synergy between these two information sources \(?\), this study explores the potential of combining phonetic and orthographic information into a single model\.

## 2Methodology

To answer the two research questions, two experiments were designed\. Experiment 1 focuses on a comparative assessment of Dutch syllabification algorithms\. Experiment 2 examines the relationship between orthographic and phonetic information and their combined effect on syllabification performance through a combined deep learning model\.

### 2\.1Datasets

To evaluate the performance of the algorithms, three different datasets were compiled or retrieved from various sources333All datasets and algorithms used in this study can be accessed at[https://github\.com/guslatho/syllabify\-torch](https://github.com/guslatho/syllabify-torch)\. Previous research \(?,?,?\) exclusively relied on Dutch standard dictionary words to assess algorithm performance\. In addition to testing performance on dictionary words, the current study also includes two other datasets: a set of loanwords and a set of Dutch pseudowords\. Table[2](https://arxiv.org/html/2605.28834#S2.T2)provides an overview of the datasets used and their characteristics\.

CELEX\.The CELEX \(Dutch Centre for Lexical Information\) database was used to measure algorithm performance on standard Dutch dictionary words\. To allow for direct comparison with earlier research, the final list used was the same as that employed in the study by?, who distributed the list online444[https://cseweb\.ucsd\.edu/~elkan/hyphenation/](https://cseweb.ucsd.edu/~elkan/hyphenation/)\. The total number of words included is n=293,747, comprising words typically found within the Dutch language, such as verbs, nouns, adverbs, and various other parts of speech \(see Appendix[A](https://arxiv.org/html/2605.28834#S1a)for a sample\)\. In their paper, Trogkanis and Elkan describes filtering out words that had multiple syllabification solutions \(for instance,zoevencan be syllabicated to eitherzoe\-venorzo\-e\-vendepending on its meaning\)\. Manual inspection of the list showed that these were still present in the dataset they distributed online, thus these were removed \(n=33\), resulting in a list of n=293,714\.

Loanwords\.A set of loanwords was included to test the performance of algorithms on words common in the Dutch language, but originating from other languages, such as English and French\. This allowed testing the adaptability of different algorithms to more challenging word conditions\. A list of 10,372 words was retrieved from?\. Of these ten thousand words, n=8,015 were found to be already present in the original CELEX word list used in the first dataset and were thus removed\. To exclude dated or archaic words from the list, the remaining words were cross\-checked with Gigant\-Molex, a library containing contemporary Dutch words\. The final resulting dataset consisted of n=1,135 words\. Appendix[A](https://arxiv.org/html/2605.28834#S1a)lists a sample of the words included\.

Pseudowords\.Pseudowords refer to non\-existent words in the Dutch language that are artificially created to resemble Dutch word forms\. A list of Dutch pseudowords found in the CHOREC \(Children’s Oral Reading Corpus555[https://taalmaterialen\.ivdnt\.org/download/tstc\-chorec\-spraakcorpus](https://taalmaterialen.ivdnt.org/download/tstc-chorec-spraakcorpus)\) was used as a reference point\. The aim of the pseudoword set was to measure the performance of algorithms on words that conform to Dutch word construction rules, but do not appear in the CELEX database\. The CHOREC list contains 120 words, of which n=21 were found to have multiple syllabification solutions \(e\.g\., formenuur, bothmen\-uurandme\-nuurare grammatically correct syllable solutions in Dutch\) and were removed\. This resulted in a set of n=99 words\. Appendix[A](https://arxiv.org/html/2605.28834#S1a)lists a subsection of the words included\.

DatasetSize \(n\)OriginDescriptionTrainingTestingDictionary264,34329,371CELEXCommon words found in the Dutch dictionary\. The CELEX dataset was used as a training and testing set with a 90%/10% split\.Loanwords\-1,135De Sijs \(2009\)Words found in the Dutch language originating from other languages, e\.g\., French or English\. Used as a testing set only\.Pseudowords\-99CHORECWords artificially created to imitate Dutch word conventions\. Used as a testing set only\.Table 2:Datasets used for algorithm training and testing\.
### 2\.2Algorithms

To compare the effectiveness of existing syllabification algorithms, the performance of three Dutch syllabification algorithms was analyzed\. Two of these algorithms \(Brandt Corstius, CRF\) were replicated from the literature, while new weight patterns were generated for a third algorithm \(Liang\) adapted to Dutch syllabification\. Additionally, a novel deep\-learning method was developed\.

#### 2\.2\.1Brandt Corstius

The knowledge\-based algorithm proposed by?is notable for being a linguistic algorithm built specifically on Dutch spelling and grammar rules\. It operates by first compressing words into different vowel and consonant clusters, for example marking common Dutch vowel combinations such aseu,au,ieuas distinct entities\. Words are subsequently processed by a combination of maximum onset principle and consonant\-priority patterns\. For example,loonbrief\(pay slip\) is first compressed into \[l\]\[oo\]\[n\]\[b\]\[r\]\[ie\]\[f\], for which maximum onset processing for valid consonant combinations producesloon\-brief\.

Brandt Corstius originally developed his algorithm in Algol\-70 and tested it on a sample of 43,712 word tokens compiled from Dutch newspapers, poems, and books\. He reported a word error rate of only 0\.5%\. Brandt Corstius notes that his linguistic knowledge\-based algorithm is effective for most Dutch words, but struggles with compound words where the maximum onset principle may falter\. In the current study, a recreation was made in Python, following the logic of his system as outlined in his paper\.

#### 2\.2\.2Liang

Originally introduced for hyphenation purposes in LaTeX, the algorithm by?has since seen widespread usage in various software applications\. Liang’s algorithm functions by storing hyphenation and exception patterns, resulting in a list with weights\. Unlike the Brandt Corstius algorithm, Liang’s algorithm is data\-driven and non\-language specific, and thus can be applied to any dataset with hyphenation or syllabification solutions agnostically\.

Various studies have assessed the performance of Liang’s algorithm\. A comparison study by?found it to be effective at word hyphenation and syllabification, reaching a mean word accuracy of roughly 96% tested across nine languages \(Adsett and Merchand did not report accuracy for individual languages\)\. For Dutch, a word accuracy rate of 93\.08% is reported \(?\)\. However, the Trogkanis and Elkan study describes applying hyphenation rules in training the Liang algorithm on their dataset, which may result in a skewed representation of performance\. For the current study, custom patterns were generated for Dutch that conform to syllabification conventions, using the original TeX software toolPATGEN\.EXE, found at[https://www\.tug\.org/texlive/doc/texlive\-en/texlive\-en\.html](https://www.tug.org/texlive/doc/texlive-en/texlive-en.html)\.

#### 2\.2\.3Conditional random field algorithm

This approach employs Markov chain principles through a conditional random field implementation\. Developed by?, the CRF model processes input words by capturing windows around each character for syllable prediction\. For each input character a’0’or’1’is assigned, with’0’signifying no syllable break following the character, and’1’signifying a syllable break following\. Trogkanis and Elkan report excellent word accuracy rates, with 99\.51% of the words in their dictionary words set syllabified correctly\.

Trogkanis and Elkan’s model was originally implemented in CRF\+\+, a software package for conditional random field modeling\. The current implementation was developed in Python, using Chaine, an open\-source package for creating CRF models\. A few optimizations were found to benefit performance of the model\. A 6\-window size for each character was applied instead of a 5\-character window, as described by Trogkanis and Elkan\. Start\-of\-word and end\-of\-word tokens were also added to better capture word boundaries, and the coding scheme was slightly modified\.

#### 2\.2\.4Deep learning model \(new model\)

A new deep\-learning model was developed in TensorFlow and subsequently ported to Torch666Template for the Torch training model and weights for Dutch can be found at[https://github\.com/guslatho/syllabify\-torch](https://github.com/guslatho/syllabify-torch)\. Previously, CNN, BiLSTM, and CRF components were shown to be effective for syllabification of phonemes \(?\) and Romanian syllabification \(?\), and were thus chosen as the starting components for the architecture of the current model\. However, the design of the current model differs by using a sequential setup, where individual letter\-windows of a word are first locally processed through convolution layers before being combined at a higher\-order BiLSTM/CRF layer\.

The architecture of the deep learning model consists of three parts\. First, a 5\-character window is formed around each letter of the input word\. This window\-based approach allows the model to focus on local information around each character and detect nearby patterns\. The 5\-character window is first passed into an embedding layer, followed by a convolution layer, dropout, and global pooling layer\. The entire first block—embedding, convolution, dropout, and pooling—can be conceptualized as a ‘micro\-level’ local analysis for extracting information around each character\.

For each 5\-character window for each letter analyzed this way during the convolution stage, the output is flattened and forwarded to a stack of two BiLSTM layers\. The BiLSTM layers integrate the local ’micro\-level’ analyses information into larger patterns\. Finally, the second BiLSTM outputs to a CRF, which makes predictions for each character of the input word\. Here, ’0’ represents no syllable boundary following the letter, and ’1’ represents a syllable boundary\. As in Trogkanis and Elkan’s \(2010\) coding scheme, the binary string forms the prediction for the final output\. For example, the Dutch word inputberekening\(calculation\), after being processed by the model, would result in the string ’0101010000’\. This binary string would denote hyphens after the 2nd, 4th, and 6th letters, resulting in the output syllabificationbe\-re\-ke\-ning\.

Token length was set at 34, in line with the maximum word length found in the training wordset; words were post\-padded\. The addition of L2 normalization \(batch norm\) was found to increase model consistency in early testing and was therefore applied\. The training batch size was set at 64\. The initial embedding layer was set at 128 units, producing an input shape of\[64 x 34 x 5 x 128\]for\[batch x token x window x embedding\]\. The convolution layer was set at 40 filters with a kernel size of 3 and a sliding window of 1\. Following a dropout rate of 0\.3, a global max pooling layer with a kernel of 3 was applied\. The output was then flattened, resulting in a\[64 x 34 x 200\]shape, which was forwarded to the first BiLSTM layer\. The unit size for both BiLSTM layers was set at 128, producing a shape of\[64 x 34 x 256\], which was forwarded to the final CRF layer\.

### 2\.3Training and testing procedure

Of the four algorithms used in the benchmark analysis, three required a training library: Liang, CRF, and the deep learning model\. The fourth algorithm, Brandt Corstius, syllabified according to predefined Dutch language rules, and thus required no training data\. For these three data\-driven algorithms, 90 percent of the CELEX dataset was used for training and the remaining 10 percent for testing\. Similar to the ten\-fold cross validation approach used by Trogkanis and Elkan \(2012\), the deep learning network was trained on ten 90/10 splits generated by ten consecutive random seeds\. The Liang and CRF libraries produced consistent results; as such, only five random 90/10 splits were sampled for each algorithm\.

Whereas Chaine for CRF andPATGEN\.EXEfor Liang contained automatic stopping procedures, the deep learning model could be trained indefinitely\. As such, a limit of 180 training epochs was set\. Practice trials revealed small increments in training after 180 epochs, but due to time considerations, the limit was set at 180 epochs\. Training time for the CRF algorithm was approximately 40 minutes per model\. For the deep learning model, GPU acceleration resulted in a mean training time of roughly 2\.5 hours using a modern GPU \(RTX 4080\)\.

#### 2\.3\.1Evaluation metrics

In total, six metrics were used to assess algorithm performance\.

Word/Character Accuracy Metrics\.Given syllabification is a sequential prediction task at the word level, algorithm performance is commonly measured using Overall Word\-Level Error Rate \(OWER%\) \(?,?,?\)\. However, other metrics such as Overall Letter\-Level Error Rate \(OLER%\) \(?\) and Hyphen Error Rate \(HER%\) have also been used \(?,?\)\. Given the widespread use of these different metrics, all three have been included here\.

Overall Word\-Level Error Rate expresses the proportion of words incorrectly syllabified by an algorithm \(Equation[1](https://arxiv.org/html/2605.28834#S2.E1)\)\. It is usually expressed as a percentage, with an OWER% of 10 indicating that one out of ten words in the test set were predicted incorrectly in its entirety\. Overall Letter\-Level Error Rate describes the total number of individual characters across the full word set for which a prediction \(’0’ for no syllable follows, ’1’ for a syllable follows\) was made incorrectly \(Equation[2](https://arxiv.org/html/2605.28834#S2.E2)\)\. Since most letters in a word are not followed by a syllable, OLER% is susceptible to be inflated by a high number of true negatives\. Lastly, Hyphen Error Rate \(HER%\) represents the number of hyphens not predicted out of all hyphens \(Equation[3](https://arxiv.org/html/2605.28834#S2.E3)\)\. Like OLER%, HER is liable to distort algorithm performance since it does not penalize false hyphen predictions\.777It should be noted that, in the current study, HER% refers to the error rate in relation to syllabification, not hyphenation\. Given its widespread use in syllabification research, the same term will be used here out of convention, even though it is technically incorrect since hyphenation refers to word breaking according to spelling and grammar principles, not pronunciation\.

O​W​E​R%=W​o​r​d​s​c​o​n​t​a​i​n​i​n​g​a​t​l​e​a​s​t​o​n​e​F​P​o​r​F​NT​o​t​a​l​w​o​r​d​sOWER\\ \\%=\\frac\{Words\\ containing\\ at\\ least\\ one\\ FP\\ or\\ FN\}\{Total\\ words\}\(1\)
O​L​E​R%=F​N\+F​PF​N\+T​P\+T​N\+F​POLER\\ \\%=\\frac\{FN\+FP\}\{FN\+TP\+TN\+FP\}\(2\)
H​E​R%=F​NT​P\+F​NHER\\ \\%=\\frac\{FN\}\{TP\+FN\}\(3\)
As an example for application of these metrics, for the Dutch word ’we\-reld\-be\-ker’ \(world cup\), an incorrect solution of ’wereld\-beker’ would result in an Overall Letter\-Level Error Rate of 18\.18%, since 2 out of 11 characters were predicted incorrectly\. Hyphen Error Rate would be 66\.67%, with only 1 of 3 syllable boundaries predicted correctly\. Overall Word\-Level Error Rate would classify the whole word as incorrectly syllabified due to the presence of two false negatives\.

Precision, recall, F1\.In addition to the three metrics above, Precision \(Equation[4](https://arxiv.org/html/2605.28834#S2.E4)\), Recall \(Equation[5](https://arxiv.org/html/2605.28834#S2.E5)\), and F1 \(Equation[6](https://arxiv.org/html/2605.28834#S2.E6)\) were also included to assess algorithm performance\. Note that Recall is the complement of HER, expressed asR=100%−HERR=100\\%\-\\text\{HER\}\.

Precision=T​PT​P\+F​P\\text\{Precision\}=\\frac\{TP\}\{TP\+FP\}\(4\)
Recall=T​PT​P\+F​N=100−H​E​R\\text\{Recall\}=\\frac\{TP\}\{TP\+FN\}=100\-HER\(5\)
F1=2⋅Precision⋅RecallPrecision\+RecallF\_\{1\}=\\frac\{2\\cdot\\text\{Precision\}\\cdot\\text\{Recall\}\}\{\\text\{Precision\}\+\\text\{Recall\}\}\(6\)

## 3Results

### 3\.1Experiment 1: comparison of algorithms on Dutch datasets

Four algorithms, Brandt Corstius, Liang, CRF, and Deep Learning \(DL\), were tested against three dataset\. See Figure[1](https://arxiv.org/html/2605.28834#S3.F1)for a bar plot containing the word accuracy rates per datasets\. A complete overview of metrics including standard deviations is listed in Table[3](https://arxiv.org/html/2605.28834#S3.T3)\.

#### 3\.1\.1Results

For the first dataset, dictionary words \(n=29,375\), the deep learning model showed the best overall performance \(OWER%, 0\.446; OLER%, 0\.068; HER%, 0\.145; Precision, 99\.852; Recall, 99\.855; F1, 99\.853\)\. The Overall Word\-Level Error Rate of 0\.446 indicates less than 1 in 200 words being syllabified incorrectly in the test set\. The second\-best performing algorithm was the CRF model, showing a 0\.129 higher word error rate than the deep learning model \(OWER%, 0\.575; OLER%, 0\.087; HER%, 0\.178; Precision, 99\.807; Recall, 99\.822; F1, 99\.814\)\. The Liang and Brandt Corstius algorithms scored worse than CRF and the deep learning model across all metrics\. For Overall Word\-Level Error Rate, Liang’s algorithm had a rate of 1\.460%, whereas Brandt Corstius scored above the 10% threshold for incorrectly syllabified words \(Overall Word\-Level Error Rate of 16\.819%, translating to 83\.181% of all dictionary words syllabified correctly\)\.

For the loanwords dataset \(n=1,135\), all algorithms scored worse in comparison with their performance on the dictionary words set\. The deep learning algorithm showed superior performance on all metrics except precision \(OWER%, 12\.916; OLER%, 2\.433; HER%, 4\.666; Precision, 93\.870; Recall, 95\.334; F1, 94\.596\)\. The Brandt Corstius algorithm showed the worst performance across all metrics \(with an OWER% of 20\.441 meaning less than 4 out of 5 loanwords were syllabified correctly\)\. Liang’s algorithm scored better than the Brandt Corstius algorithm, but worse than CRF and the deep learning algorithm \(OWER%, 16\.088; OLER%, 2\.571; HER%, 6\.576; Precision, 95\.258; Recall, 93\.424; F1, 94\.332\)\.

On the last word set, pseudowords \(n=99\), the performance of the algorithms followed a different trend in comparison to the first two datasets\. Whereas Brandt Corstius was least accurate when applied to the first two datasets \(dictionary and loanwords\), in the pseudowords condition it showed the lowest Overall Word\-Level Error Rate \(OWER% of 2\.02\)\. CRF showed a similar performance, scoring lower on Overall Word\-Level Error Rate but slightly higher on character\-level metrics in comparison with Brandt Corstius \(OWER%, 2\.626; OLER%, 0\.395; HER%, 0; Precision, 97\.418; Recall, 100\.000; F1, 98\.691\)\. Liang’s algorithm performed comparatively worse than any other algorithm \(OWER%, 9\.293; OLER%, 2\.094; HER%, 4\.694; Precision, 91\.041; Recall, 95\.306; F1, 93\.123\)\.

Dictionary WordsLoanwordsPseudowords05510101515202016\.8216\.8220\.4420\.442\.022\.021\.461\.4616\.0916\.099\.299\.290\.580\.5814\.0414\.042\.632\.630\.450\.4512\.9212\.923\.643\.64DatasetsWord Error Rate \(%\)Brandt CorstiusLiangCRFDeep learningFigure 1:Word accuracy rates \(OWER%\) for algorithms across datasets\.DatasetMetricDeep LearningCRFLiangBrandt Corstius\*CELEXOWER%0\.446 \(±0\.038\)0\.575 \(±0\.037\)1\.460 \(±0\.073\)16\.819 \(±0\.125\)OLER%0\.068 \(±0\.007\)0\.087 \(±0\.005\)0\.180 \(±0\.006\)3\.143 \(±0\.014\)HER%0\.145 \(±0\.017\)0\.178 \(±0\.016\)0\.438 \(±0\.011\)6\.818 \(±0\.023\)Precision99\.852 \(±0\.016\)99\.807 \(±0\.011\)99\.669 \(±0\.013\)93\.350 \(±0\.037\)Recall99\.855 \(±0\.017\)99\.822 \(±0\.016\)99\.562 \(±0\.011\)93\.182 \(±0\.023\)F199\.853 \(±0\.015\)99\.814 \(±0\.012\)99\.616 \(±0\.012\)93\.266 \(±0\.027\)LoanwordsOWER%12\.916 \(±0\.638\)14\.044 \(±0\.16\)16\.088 \(±0\.321\)20\.441OLER%2\.433 \(±0\.116\)2\.563 \(±0\.028\)2\.571 \(±0\.041\)4\.160HER%4\.666 \(±0\.289\)6\.840 \(±0\.079\)6\.576 \(±0\.072\)7\.815Precision93\.870 \(±0\.297\)95\.538 \(±0\.051\)95\.258 \(±0\.211\)89\.898Recall95\.334 \(±0\.289\)93\.160 \(±0\.079\)93\.424 \(±0\.072\)92\.185F194\.596 \(±0\.256\)94\.334 \(±0\.061\)94\.332 \(±0\.087\)91\.027PseudowordsOWER%3\.636 \(±1\.794\)2\.626 \(±0\.553\)9\.293 \(±1\.317\)2\.020OLER%0\.835 \(±0\.454\)0\.395 \(±0\.083\)2\.094 \(±0\.271\)0\.455HER%2\.041 \(±1\.273\)0\.000 \(±0\.000\)4\.694 \(±0\.559\)1\.020Precision96\.492 \(±1\.759\)97\.418 \(±0\.531\)91\.041 \(±1\.209\)97\.980Recall97\.959 \(±1\.273\)100\.000 \(±0\.000\)95\.306 \(±0\.559\)98\.980F197\.219 \(±1\.503\)98\.691 \(±0\.272\)93\.123 \(±0\.869\)98\.477
Table 3:Accuracy means and standard deviations for metrics for algorithms tested across three datasets\. Best performing algorithm for each metric is displayed in bold\.\(\* The Brandt Corstius algorithm was only applied to the pseudowords and loanwords set once due to requiring no training library, as such no standard deviations is listed for these two sets\.\)

#### 3\.1\.2Discussion

The results of the first experiment show that the algorithms achieved high accuracy \(fewer than 1 in 160 errors for the CRF and deep learning algorithms\) when syllabifying dictionary words, which is consistent with findings in the literature \(?,?\)\. All algorithms struggled more in the loanwords condition, which is expected since loanwords from other languages \(e\.g\., English, French\) often have syllable structures that differ from those of native Dutch words\.

One notable finding was that the knowledge\-based algorithm by?showed the worst performance on dictionary words and loanwords, but performed best at the word level when syllabifying pseudo\-words\. This may initially seem counterintuitive, given that knowledge\-based algorithms are explicitly designed to capture patterns in existing Dutch words and are not developed to generalize to unknown words\. However, qualitative analysis shows that the Brandt Corstius algorithm is adept at syllabifying Dutch pseudowords that follow strict Dutch language conventions\. The data\-driven models, by contrast, struggled in certain scenarios because they overfit to patterns in the training set\. For example, the pseudowords ‘jien’ and ‘leum’ were incorrectly syllabified as ‘ji\-en’ and ‘le\-um’ because the training set contained reference words with similar syllable breaks \(e\.g\., ‘o\-le\-um’, ‘ju\-bi\-le\-um’, ‘boei\-en’, ‘ski\-en’\)\. The linguistic rules embedded in the Brandt Corstius algorithm, however, allowed it to recognize that the middle vowel patterns ‘ie’ and ‘eu’ should not be split, resulting in the correct classification of these as one\-syllable words\.

In comparison to the best results in the literature for Dutch, the current deep learning solution shows slightly increased performance on the same dataset \(0\.45% word error rate instead of 0\.49% as reported by Trogkans and Elkan 2010\)\. Furthermore, the Liang algorithm tested here shows a word error rate of only 1\.46% versus the nearly 7% reported in the?study\. A possible explanation for this discrepancy is that the current implementation was explicitly aimed at syllable\-division instead of hyphenation\. The results of the CRF implementation of the current study show slightly decreased performance to the CRF results mentioned by?\(Trogkanis & Elkan, 0\.49 OWER%; current study, 0\.58 OWER%\), possibly owing to different software tools being used to implement the algorithm\. Of interest are the results for F1, Recall, and Precision, which show the deep learning model achieving high balance between Precision and Recall, contributing to its high overall performance in the loanwords and CELEX datasets\.

### 3\.2Experiment 2: combining phonetic and orthographic information

Model A: Orthographic \(Pre\-trained\)Model B: Phonetic \(Pre\-trained\)proteineprote’jin@Dropout Layer \(p=0\.5\)Dropout Layer \(p=0\.5\)Dot\-productAttentionBiLSTMSoftmaxpro\-te\-i\-neFigure 2:Architecture of model C, combining model A and B\.Given that the deep learning model was effective at Dutch syllabification, follow\-up research was conducted to combine phonetic and orthographic word information\. Using phonetic information as input requires access to phonetic word representations; fortunately, CELEX provides these for each word \(for example, CELEX lists ’prote’jin@’ for the orthographic notation ’proteine’\)\. The goal was to investigate whether adding phonetic information improved orthographic syllabification accuracy and, if so, how this improvement was achieved\.

Since phonetic notations were not available for the loanwords and pseudowords datasets, these were excluded from the current analysis\.888During development, an early version incorporated a grapheme\-to\-phoneme component that generated phonetic representations for the model\. While these setups performed well, the multi\-stage nature of the pipeline led to a decision to exclude them here for reasons of parsimony\. Future research could explore these and related approaches, such as automatic phoneme prediction during model training\.

#### 3\.2\.1Architecture

In building a model that combines orthographic with phonetic input, a number of setups were experimented with, including transformer\-based models\. Ultimately, the model that appeared to be most effective was one that relied on combining pre\-trained models\. First, two instances of the deep learning model were trained on the orthographic and phonetic word presentations separately\. Crucially, the orthographic model \(modelA\) and phonetic model \(modelB\) shared the same wordset, the only difference being that they were exposed to orthographic versus phonetic notations of the words\.

After pre\-training, bothAandBwere frozen and had their final BiLSTM and CRF layer removed\. A new model,C, was formed on top of the original two, by adding a BiLSTM layer and a new classification layer \(softmax\), see Figure[2](https://arxiv.org/html/2605.28834#S3.F2)for an overview of the model\. The orthographic output \(A\) connected directly with the new BiLSTM layer, with dot\-attention tying the output fromBtoA\. The attention mechanism was important, given that the orthographic and the phonetic notations of words often do not line up automatically \(for example, the orthographic notation ”proteine” is 8\-length, while the phonetic notation of the same word ”prote’jin@” is 10\-length\)\. As a last addition, adding a high dropout layer \(p=0\.5\) afterAandBwas found to be very effective in increasing performance\. This is likely due to modelCnot being stimulated to rely on new information fromBin the absence of dropout layers\.

#### 3\.2\.2Results

020204040606080801001001201201401401601601801800\.20\.20\.30\.30\.40\.40\.50\.50\.60\.60\.70\.70\.80\.8EpochWord Error Rate \(%\)Orthographic ModelPhonetic ModelCombined ModelFigure 3:Word\-level error rate after each epoch for the orthographic \(blue\), phonetic \(red\), and combined \(green\) models\. The combined model, which integrates information from both the pretrained orthographic and phonetic models, shows a lower error rate on the validation set than the individual models\.Figure[3](https://arxiv.org/html/2605.28834#S3.F3)displays the results for combined modelCas wellAandB, the models it was built on, charted across training duration\. The individual models both scored a respective 0\.46% \(phonetic model\) and 0\.45% \(orthographic model\) Overall Word\-Level Error Rate\. The combined model,C, showed a decreased Overall Word\-Level Error Rate, namely 0\.35% \(OLER% of 0\.05, HER% of 0\.12\)\. See Appendix[B](https://arxiv.org/html/2605.28834#S2a)for a sample of words that the combined modelCpredicted correctly that the individual orthographic model failed\.

#### 3\.2\.3Discussion

In the second experiment, the inclusion of phonetic information through a deep\-learning model was found to enhance syllabification performance\. Combining phonetic information with orthographic information resulted in a word accuracy rate of 99\.65%, an absolute 0\.14% improvement over the best reported in the literature \(Trogkanis & Elkan, 2010; 99\.51%\)\. Analysis of the words improved by the combined model shows that phonetic information can be particularly useful in providing additional context when orthographic information alone is ambiguous\. For example, in the case ofleptosoom, the orthographic model incorrectly produced the outputlep\-tos\-oom, misattributing the firstoas a short vowel\. In the phonetic representation, short and long vowels are coded differently, enabling the model to distinguish between these two vowel patterns and correctly producelep\-to\-soom\.

## 4Discussion and Conclusions

The goal of the current research was to evaluate the performance of existing Dutch syllabification algorithms across different datasets and to apply novel deep learning techniques to improve accuracy\. While previous research exclusively used CELEX dictionary words to test algorithm performance \(?,?,?\), the inclusion of loanword and pseudoword datasets here shows that algorithm performance may not be consistent across different datasets\. Although some algorithms achieve high accuracy under certain conditions, they may struggle when applied to other datasets\. Specifically, the knowledge\-based algorithm by Brandt Corstius, which performed worst on two datasets \(dictionary words and loanwords\), showed the highest word accuracy on the third \(pseudowords\)\. Additionally, metrics such as hyphen accuracy may not fully reflect overall performance at the word accuracy level\.

The second research question explored whether adding phonetic information could enhance performance\. The inclusion of phonetic information in a deep\-learning model improved Dutch syllabification accuracy, resulting in a word accuracy rate of 99\.65%, a 0\.10% increase compared to the orthographic\-only deep\-learning model\. Beyond improving accuracy, an analysis of the words where the combined model outperformed the orthographic model reveals how phonetic information contributes to accuracy\. For example, Appendix[B](https://arxiv.org/html/2605.28834#S2a)illustrates that Dutch contains several unique character combinations with context\-dependent pronunciations\. In particular, consonant sequences such asngcan be divided in different ways depending on context, and the combined model performed better than the orthographic\-only model whenngcorresponded to the phonetic notation ’N\.’ Similarly, phonetic notation that differentiates between short and long vowels was often a key factor in predicting correct syllable divisions through the combined model\.

Deep learning models were found to be effective at syllabifying Dutch\. The orthography\-based model achieved a 99\.55% word accuracy, representing a 0\.04% absolute improvement and an 8\.2% error reduction compared to the best performance reported in the literature for Dutch \(99\.51%, Trogkanis and Elkan 2010\)\. Similarly, a model combining orthographic and phonetic information achieved 99\.65% word accuracy, a 0\.14% absolute improvement and a 28\.6% error reduction compared to the best performance by?\. An interesting finding concerns how deep learning models process syllabification\. Internal analysis showed an error overlap of only 30% between the deep learning and CRF models at the word level\. This suggests that the deep learning model may be processing the input dataset in a different way, causing errors on different words\.

In modern deep\-learning architectures, transformer models have been shown to outperform BiLSTM\-based models on linguistic tasks \(?\)\. Regarding syllabification, early exploratory testing with different deep\-learning models in the current study showed that an approach using a BiLSTM setup was the most effective\. This aligns with previous research comparing the performance of BiLSTM/CNN/CRF and transformer structures on Romanian syllabification, which found that a BiLSTM/CRF setup outperformed a transformer model on the same task \(?\)\. There are several reasons why BiLSTM\-based models may be particularly effective for syllabification\. First, syllabification largely depends on local textual relationships to identify syllable boundaries\. Therefore, the connection between more distant characters in a word may provide limited additional advantage compared to more localized processing\. Similarly, word analysis typically involves a limited number of tokens \(a maximum word length of 34 letters was used here for Dutch\), which may benefit from being processed through a BiLSTM rather than a transformer\. Finally, the relatively small size of the training datasets used may be insufficient for a transformer model to fully capture the nuances needed to make complex deductions about patterns\.

Despite the potential of deep learning approaches, some limitations remain\. First, the pseudoword dataset used here is small because a larger official pseudoword dataset is not available for Dutch\. Second, the effectiveness of the combined models on the pseudoword and loanword datasets could not be tested due to the lack of available phonetic notations\. Third, some Dutch algorithms from the literature were excluded from the comparison because their source code or documentation was unavailable \(?,?\)\. Future research could explore modern deep learning approaches incorporating phonetic information for other orthographic processing tasks\. Additionally, the combined and orthographic deep learning models developed in this study could be applied to other languages, such as English and German\.

## References

## ASample Words

An overview of words contained within the three different datasets used\. The first column features a sample of words present within the CELEX Dictionary Words dataset, which served as a training and testing set\. The second dataset concerned a compilation of loanwords \(second column\)\. The third dataset was comprised of pseudowords \(third column\)\.

Dictionary WordsLoanwordsPseudowordsabonnerenmesjoggefrijkvignetinternetmillenketenvideoschermsjobelontleerciaozwietendieryakuzawachteniekbezorgdtelewerkensprieuwwelkomfreakeneemdevervoerencashenspekkeraaitijgerfitnessgrekadoptiekindlawntenniskneuremTable 4:Sample words from the three different datasets used\.
## BWords Combined Model Improved On

The following table features a subsample of the words on which the combined model improved\. The first two columns show the orthographic input and phonetic input the models used\. The third column shows the erroneous solution the orthographic\-only model output as a prediction\. The last column shows the correct prediction made by the combined model, which improved on the solution provided by the orthographic only model\.

In many cases, the combined model improved upon the orthographic model by relying on phonetic information that differentiated between pronunciations\. For example, ingeinlijn, the vowel combinationeiwas uniquely coded asKin the phonetic notation\. The orthographic\-only model incorrectly markedgeinas containing a syllable break, likely becausegeis a common prefix in many Dutch words \(e\.g\., inge\-in\-ves\-teerdorge\-ind\)\. Likewise, the phonetic notation allows for distinction between long and short vowels\. Inleptosoom, the phonetic model coded the firstocharacter as being a long vowel, allowing the combined model to leverage this information and correctly outputlep\-to\-soomover the incorrectlep\-tos\-oompredicted by the orthographic model \(the latter assumed the firstoto be a short vowel\)\.

InputModelTranslationOrthographicPhoneticOrthographic OnlyCombinedsuedesy’w\)d@sue\-desu\-e\-desuedeleptosoomlEpto’somlep\-tos\-oomlep\-to\-soomleptosomeaasgieren’asxir@aas\-gi\-e\-renaas\-gie\-renvultureshostesses’hOst@s@shos\-tes\-seshos\-tess\-eshostessescare’k\)rca\-recarecaregeinlijn’xKnlKnge\-in\-lijngein\-lijnprank call linelianeli’jan@li\-aneli\-a\-neliane \(plant\)anglofobieANGlofo’biang\-lo\-fo\-biean\-glo\-fo\-bieanglophobiarizoom’ri’zomriz\-oomri\-zoomrhizomeTable 5:Comparison between output from the orthographic model \(third column\) and the output from the combined model \(fourth column\) that predicted correct syllable\-boundaries through use of phonetic information \(second column\)\.