<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Evaluation of combined bi-directional branching entropy language models for morphological segmentation of isiXhosa</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>North-West University</institution>
          ,
          <addr-line>Potchefstroom, South Africa, lula</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>UNISA</institution>
          ,
          <addr-line>Pretoria</addr-line>
          ,
          <country country="ZA">South Africa</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>An evaluation of the IsiXhosa Branching Entropy Segmenter (XBES), an unsupervised morphological segmenter for isiXhosa, is presented. The segmenter contributes a combined bi-directional branching entropy language model with an option for modified Kneser-Ney (mKN) smoothing. XBES's boundary identification accuracy of 77.44 ± 0.32% is comparable to the benchmark Morfessor-Baseline's 77.2±0.10%. XBES's f1 score, of 58 ± 0.10%, is significantly better than Morfessor-Baseline's 48.9 ± 0.75%. The study shows that mKN smoothing degrades performance on branching entropy-based segmentation of isiXhosa, and suggests that better segmentation performance could be achieved in the unsupervised morphological segmentation of isiXhosa, given more data.</p>
      </abstract>
      <kwd-group>
        <kwd>Natural language processing</kwd>
        <kwd>Unsupervised machine learning</kwd>
        <kwd>Morphological segmentation</kwd>
        <kwd>Branching entropy</kwd>
        <kwd>isiXhosa</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Work on the unsupervised learning of isiXhosa text segmentation, the
IsiXhosa Branching Entropy Segmenter (XBES), was presented in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. This paper
presents the bi-directional branching entropy language model implemented in
XBES and evaluates the XBES against more metrics than just accuracy.
      </p>
      <p>
        Human language resources and applications currently available in South
Africa are still limited. According to [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] this can be attributed to the
dependence on Human Language Technology (HLT) expert knowledge, scarcity of data
resources, lack of market demand for African languages, and how the particular
language relates to other more resourced languages. Morphological analysis is
one of the basic tools in the natural language processing (NLP) of agglutinating
languages such as isiXhosa.
      </p>
      <p>
        IsiXhosa is one of the South African official languages belonging to the Bantu
language family, which are classified as “resource scarce languages”. IsiXhosa
is the second largest language in South Africa with 9.3 million mother-tongue
speakers (17% of the South African population), second only to isiZulu [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ].
Although there has been an increase in the tools for South African languages,
this increase is from a low baseline. Hence there is still a need for NLP tools [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>
        IsiXhosa is closely related to other Nguni languages such as isiZulu, Siswati
and isiNdebele and therefore work done in it could easily be bootstrapped to
these languages as has been shown in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Nguni languages account for 45.8% of
the South African mother tongue speaker population.
2
2.1
      </p>
    </sec>
    <sec id="sec-2">
      <title>Morphological segmentation for isiXhosa</title>
      <sec id="sec-2-1">
        <title>Morphological segmentation</title>
        <p>
          Morphological analysis is the task of splitting one token, a word, into its
constituent units [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], e.g. the segmentation of a word into morphemes, and
classification thereof. Morphemes are the smallest meaning bearing component of a
word [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. In languages with rich systems of inflection and derivation,
morphological analysis is needed in information retrieval, translation, etc.
        </p>
        <p>
          A differentiation is made by [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] between morphological segmentation, which
splits words into constituent morphemes, and morphological analysis, which also
classifies the identified morphemes. This differentiation originated in [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ]. The
task handled in this paper is morphological segmentation.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Morphological segmentation in isiXhosa</title>
        <p>
          IsiXhosa is an agglutinating and polysynthetic language in that it usually has
many morphemes per word [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. It is also fusional/inflectional because morpheme
boundaries are sometimes fused and difficult to distinguish, e.g ukwanda (to
grow) is linguistically segmented as u-ku-and-a. The w is a result of a fusion
between the u and a vowels.
        </p>
        <p>
          IsiXhosa words are composed of a root, prefixes, suffixes and circumfixes
that attach to the root. The root is the main meaning carrying constituent of the
word. A circumfix is the “simultaneous affixation of a prefix and suffix to a root or
a stem to express a single meaning” [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. An example of a circumfix in isiXhosa is
the combination “a. . . ang..” in isiXhosa negation, e.g. a-ka-hamb-ang-a (he/she
did not go). Each of the affixes (i.e. prefixes, suffixes or circumfixes) is made up
of one or more morphemes. Morphemes follow one another in an order prescribed
for each word type [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. In isiXhosa, most roots are however bound morphemes,
meaning that they never appear independently as words which are independently
meaningful [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. They at least appear as stems, which are word roots suffixed
with a termination vowel [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], e.g. and-a in ukwanda.
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Automated morphological segmentation of isiXhosa</title>
        <p>
          One of the earliest reports on automated morphological segmentation of South
African languages is that of [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ] on the automatic acquisition of a Directed
Acyclic Graph (DAG) to model the two-level rules for morphological analysers
and generators. The algorithm was tested on English adjectives, inflection of
isiXhosa noun locatives and Afrikaans noun plurals, with a 100% accuracy for
isiXhosa noun locatives inflection.
        </p>
        <p>
          An existing isiZulu morphological analyser [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] was bootstrapped by [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] to
other Nguni languages including isiXhosa. The study reported that 93.30% of
the words (181) were analysed.
        </p>
        <p>
          Work on the development of text resources for ten South African languages
was presented by [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], including a morphologically analysed corpus for isiXhosa.
That morphological segmentation corpus is used in this study as the test corpus.
The corpus is rated at an accuracy of 84.66%.
        </p>
        <p>
          The most recent work for isiXhosa segmentation is that of [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], which
introduced a lemmatiser for isiXhosa and [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] who presented the development of a
rule-based noun stemmer for isiXhosa. The isiXhosa lemmatiser was evaluated
at an accuracy of 83.19% and the noun stemmer showed an accuracy rate of
91%.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Unsupervised morphological segmentation</title>
      <p>
        The last works done for morphological segmentation for isiXhosa reported in
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] uses unsupervised machine learning in the morphological segmentation of
isiXhosa. This is attractive because it bypasses the need for expensive linguistic
experts or annotation of training data.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Supervision in Machine Learning</title>
        <p>
          There are three modes of training a machine learning model, i.e. supervised,
semi-supervised and unsupervised [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. In supervised learning, the training data
contains solution examples that the model must generalise from. Data in
unsupervised training is devoid of such, but only creates a model from raw data.
Semi-supervised systems use anything in between, from using limited supervised
data with large amounts of unannotated data to unannotated data with rules
built into the model.
        </p>
        <p>The segmenter evaluated in this paper, XBES, uses unsupervised learning in
the morphological segmentation of isiXhosa.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Unsupervised morphological segmentation works</title>
        <p>
          The earliest works in unsupervised morphological segmentation used a form of
accessor variety, where a morpheme boundary is identifiable by the possible
number of letters that may follow a sequence of letters [
          <xref ref-type="bibr" rid="ref12 ref9">9, 12</xref>
          ]. This evolved
to using mutual information [
          <xref ref-type="bibr" rid="ref39 ref42">39, 42</xref>
          ], and different forms of Branching Entropy
[
          <xref ref-type="bibr" rid="ref1 ref39">1, 39</xref>
          ].
        </p>
        <p>
          Minimum Description Length (MDL) [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] has seen extensive use in
unsupervised morphological segmentation, primarily as a measure of fit of the
training data to heuristic models and statistical models [
          <xref ref-type="bibr" rid="ref16 ref18">16, 18</xref>
          ]. The comparative
standard used in this study, Morfessor-Baseline [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], uses MDL and Maximum
likelihood estimation.
        </p>
        <p>
          Clustering and paradigmatic models is another popular approach. This
involves clustering related words into a paradigm using a similarity measure,
identifying the stem, and considering the rest as sequences of affixes [
          <xref ref-type="bibr" rid="ref13 ref5">5,13</xref>
          ]. A paradigm
is a grouping of words according to their form-meaning correspondence [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The
similarity measures used are Latent Semantic Analysis [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], Dice and Jaccard
coefficients [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], Ordered Weighted Aggregator operators [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and affixality
measurements [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. Word context is also another technique that is used to identify
similar words [
          <xref ref-type="bibr" rid="ref2 ref32">2, 32</xref>
          ].
        </p>
        <p>
          Non-parametric Bayesian techniques have also shown promise, including
Pitman-Yor process based models [
          <xref ref-type="bibr" rid="ref15 ref41">15, 41</xref>
          ] and adaptor grammars [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ]. These use
Markov Chain Monte Carlo (MCMC) simulation with Gibbs Sampling [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] for
inference. Contrastive Estimation [
          <xref ref-type="bibr" rid="ref27 ref35">27, 35</xref>
          ] is another non-parametric model that
is showing elegance and promising results.
        </p>
        <p>
          A number of studies have used a combination of the above techniques and
measures [
          <xref ref-type="bibr" rid="ref28 ref32">28, 32</xref>
          ].
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Choice of unsupervised segmenter for benchmarks</title>
        <p>
          To place this work amongst other segmenters, a standard in morphological
segmentation was chosen for comparison. The benchmark segmenter had to be
publicly available and had to have been used for highly agglutinative languages
like isiXhosa. The Morfessor-Baseline segmenter [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] was chosen because it has
been used as a benchmark extensively and is freely available.
        </p>
        <p>To establish a minimum performance baseline a random segmenter that
randomly decides whether a point in a word is a boundary of a segment or not was
implemented.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Character level language modelling</title>
      <p>To estimate the branching entropies, character level language modelling is
required. Instead of using two language models, one for each direction, XBES’s
implementation uses one model for both directions such that a dictionary
entry points to a vector of two values, the right branching and the left branching
values. This reduced the memory footprint.</p>
      <p>
        Both the un-smoothed and modified Kneser-Ney [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] smoothed language
models were implemented. The language model was also extended to include an
option for using all possible n-gram levels in one model instead of having a
maximum n-gram level limit, i.e., an infinite-gram.
      </p>
      <p>
        The calculation of the VBE and NVBEs are done as specified in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]
and stored in the model.
      </p>
      <p>The algorithms are briefly described below.</p>
      <sec id="sec-4-1">
        <title>Un-smoothed bi-directional Branching Entropy language model flow</title>
        <p>The input to the unsmoothed modelling is a list of one directional (left-to-right)
n-gram strings with frequency counts (n-gram, f) or a mapping of n-gram string
to frequency counts and the process returns a single Bi-directional Branching
Entropy Language Model (BELM) with branching entropy values for both
directions. Fig. 1 shows the process of the modelling.</p>
        <p>The sorting allows the process to do a single pass through the n-gram strings
frequency counts. This is important when dealing with large frequency counts
as in this case.</p>
        <p>
          The branching entropies are calculated according to [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ]. The probabilities
are discarded after use.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>The modified Kneser-Ney smoothed bi-directional Branch</title>
      </sec>
      <sec id="sec-4-3">
        <title>Entropy language model flow</title>
        <p>In this exercise, we also wanted to check if smoothing had any effect on the
performance of the branching entropy segmenter. Smoothing is necessary where
there is data sparsity, which is the case in higher order character n-grams, i.e
long n-gram strings.</p>
        <p>
          We implemented a bi-directional mKN smoothed BELM. Input to it is also
a list of one directional (left-to-right) n-gram strings with frequency counts
(ngram, f) or a mapping of n-gram string to frequency counts and the process
returns a single bi-directional Branching Entropy Language Model (BELM) with
branching entropies for both directions. The process is shown in Fig. 2. The
conditional probabilities are calculated according to [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and the branching entries
are according to [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ].
        </p>
        <p>The sorting by n-gram lengths and n-gram contexts ensured that lower level
n-grams are processed first as their results are required for the interpolation of
higher-level n-grams. This also ensured that discount values could be calculated
independently for each level. Lastly, this ensured that n-grams are clustered
by context, which is key in mKN smoothing. All this ensured only two passes
through the n-gram counts one for generating discount values and collection
interpolation statistics, and one for calculating the probabilities and updating
the BELM.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Evaluation</title>
      <p>This section details the evaluation that was done on XBES.
5.1</p>
      <p>
        Data sources 1
A raw unannotated isiXhosa corpus of 1.45 million isiXhosa words was compiled
from the isiXhosa version of the South African Constitution [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ], isiXhosa text
on the internet and the IsiXhosa Genre Classification Corpus [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. This text is
named the training corpus.
      </p>
      <p>For testing purposes the NCHLT IsiXhosa Text Corpus (29 511 tokens) was
used.
5.2</p>
      <sec id="sec-5-1">
        <title>Data splits</title>
        <p>For training purposes, ten-fold training was performed for different training set
sizes and language model n-gram lengths. The training set sizes chosen were
orders of ten (10) from one hundred (100) words to a million words and one and
a half million (1.5 million). The n-gram lengths were two (2) to five (5), odd
numbers to nineteen (19) and to the maximum n-gram length possible, i.e. the
infinite-gram.</p>
        <p>For testing purposes a subset of the NCHLT corpus was used. Because the
NCHLT corpus was generated with a rule based morphological analyser, the
solutions are not all surface segmentations, others include grammatic morphemes.
XBES is a surface segmenter and was not built to handle morpheme boundary
fusion. As an example the morphological segmentation of ukwanda is
u-ku-anda. A surface segmenter would segment ukwanda to u-kw-and-a. Excluding these
kinds of entries resulted in an evaluation testing corpus of 13441 tokens.
5.3</p>
      </sec>
      <sec id="sec-5-2">
        <title>Experiment setup</title>
        <p>Training was performed for two segmenters, i.e. XBES, and Morfessor-Baseline,
using the training corpus, and tested against the testing corpus. The random
segmenter does not require training. Both Morfessor-Baseline and XBES were
trained with different sizes. Because Morfessor-Baseline does not support
specifying n-gram size, only XBES was trained to different model n-gram lengths.</p>
        <p>1The IsiXhosa Genre Classification Corpus and NCHLT IsiXhosa Text Corpus are
available at the South African Language Resource Management Agency, (http://rma.
nwu.ac.za/index.php)</p>
        <p>
          XBES provides an option of using the minimum between the right branching
entropy and left branching entropies or the sum of the two. In addition this
study tests XBES on unsmoothed and a modified Kneser-Ney smoothed language
models [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] as detailed in Algorithms 1 and 2. In addition XBES was evaluated
for all the branching entropy modes specified in [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ].
        </p>
        <p>Evaluation of the segmentations was measured as boundary identification
accuracy and f1 score, where, in a word, a morpheme boundary location is tagged
1 and everything else 0. Accuracy measures how many boundaries and
nonboundaries the segmenter identified correctly. The f1 score focuses on the possible
boundary location and does not factor the non-boundary word locations.
5.4</p>
      </sec>
      <sec id="sec-5-3">
        <title>Results</title>
        <p>The overall results, including the best performance per XBES mode are shown
in Table 1. The results are shown with configuration information (i.e. smoothed
or not, the operator used to mix the directional branching entropies, the training
set size and the language model n-gram level that produced the results).</p>
        <p>The benchmark ten-fold validation average accuracy from Morfessor-Baseline
was measured at 77.2 ± 0.10%. The random segmenter presented an average
accuracy from ten (10) runs of 50.1 ± 0.16%. This implies that any segmenter
below this threshold would actively degrades segmentation.</p>
        <p>The Random Segmenter’s average f1 score was 35.7±0.16% whilst
MorfessorBaseline’s performance peaked at 10000 words with an average f1 score of 48.9 ±
0.75%.</p>
        <p>
          The best 10-fold average accuracy, 77.4 ± 0.32%, was achieved by the
zscore normalised branching entropy mode (NzVBE) of XBES at a training set
size of one and a half million (1.5 million) words using an unsmoothed 11-gram
language model and the sum operator. This accuracy, however, is only considered
comparable to Morfessor-baseline’s accuracy of 77.2 ± 0.10% as the Wilcoxon
Signed Rank test [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] p-value between the two was measured at 0.07446. This
configuration, however, does not reflect the best f1 score.
        </p>
        <p>The best f1 score, 58 ± 0.10%, was achieved by the un-normalised variation
of branching entropy mode (VBE) at a training set size of one and half million
(1.5 million) words using an unsmoothed 9-gram language model and the sum
operator. This score is statistically better than the rest of the scores with a
maximum pair-wise p-value of 0.0051.</p>
        <p>For Normalised Variation of Branching Entropy modes, the sum of the left
and right branching measures performed better than the minimum of the two,
implying that a smoothing effect is better, as the sum is a form of averaging the
two branching directions. Unsmoothed language models performed better than
modified Kneser-Ney smoothed language models. This suggests that character
level language modelling does not suffer from sparsity, which is prevalent in word
level language modelling.</p>
        <p>Fig. 3 shows the trend of the segmenters including Morfessor-Baseline and
the best performing XBES modes for accuracy and f1 score in relation to training
set size. Because the random segmenter was not trained, it is represented as a
flat line across the training set sizes.</p>
        <p>As can be seen from Fig. 3 Morfessor-Baseline’s accuracy and the best XBES
mode peak at around 77% with maximum training set size. The f1 score is
however a different matter.</p>
        <p>The f1 score of Morfessor-Baseline peaks at 10000 words and degrades whilst
XBES’s best mode continues to grow albeit marginally.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>
        In this paper, an unsupervised morphological segmenter for isiXhosa that uses
branching entropy is evaluated. The IsiXhosa Branching Entropy Segmenter
(XBES) uses an adaptation of branching entropy techniques detailed in [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]
applied to isiXhosa.
      </p>
      <p>The study contributes and summarises a single bi-directional branching
entropy language model with an option for smoothing with modified Kneser-Ney
smoothing.</p>
      <p>The morpheme boundary identification average accuracy of XBES, at 77.4 ±
0.32%, was evaluated to be comparable to Morfessor and it was achieved using
the z-score normalised variance of branching entropy mode with an unsmoothed
11-gram language model and the sum operator when trained on 1.5 million
words.</p>
      <p>The morpheme boundary identification f1 score of XBES, at 58 ± 0.10%,
performed better than the benchmark Morfessor-Baseline when using the
unnormalised variance of branching entropy (VBE) mode with an unsmoothed
9gram language model and the sum operator when trained on 1.5 million words.</p>
      <p>The results also show that XBES performance could still grow in both
accuracy and f1 score, however those gains could cost a lot of training data.</p>
      <p>The results also show that using the modified Kneser-Ney smoothing provides
no advantage when using branching entropy.</p>
      <p>Acknowledgment. The authors thank the South African Centre for Digital
Language Resources (SADiLaR) (https://www.sadilar.org) for providing a
central source of data and resources for South African Natural Language
Processing work. The authors also with to thank the two anonymous reviewers for
their careful reading of the paper and their many insightful comments and
suggestions. This has helped to improve and clarify this paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ando</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Mostly-Unsupervised Statistical Segmentation of Japanese: Applications to Kanji</article-title>
          . In:
          <article-title>Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference (</article-title>
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Belkin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldsmith</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Using eigenvectors of the bigram graph to infer morpheme identity</article-title>
          .
          <source>In: Proceedings of the ACL-02 workshop on Morphological and phonological learning</source>
          .
          <source>vol. 6</source>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>47</lpage>
          . Association for Computational Linguistics, Philadelphia, USA (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Booij</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>The grammar of words: an introduction to linguistic morphology</article-title>
          . Oxford University Press, third edit edn. (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bosch</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pretorius</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fleisch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Experimental Bootstrapping of Morphological Analysers for Nguni Languages</article-title>
          .
          <source>Nordic Journal of African Studies</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <fpage>66</fpage>
          -
          <lpage>88</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chavula</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suleman</surname>
          </string-name>
          , H.:
          <article-title>Morphological Cluster Induction of Bantu Words Using a Weighted Similarity Measure</article-title>
          .
          <source>In: Proceedings of SAICSIT '17</source>
          ,. p.
          <fpage>9</fpage>
          . No.
          <source>September 26-28</source>
          ,
          <string-name>
            <surname>Thaba</surname>
            <given-names>Nchu</given-names>
          </string-name>
          , South Africa (
          <year>2017</year>
          ). https://doi.org/10.1145/3129416.3129453, http://pubs.cs.uct.ac.za/archive/ 00001225/01/morphological
          <article-title>-cluster-induction-camera</article-title>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>S.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodman</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>An Empirical Study of Smoothing Techniques for Language Modeling</article-title>
          .
          <source>Tech. rep</source>
          ., Computer Science Group, Harvard University, Cambridge, Massachusetts (
          <year>1998</year>
          ), https://www.microsoft.com/en-us/ research/wp-content/uploads/2016/02/tr-10-98.pdf
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Creutz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagus</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Discovery of Morphemes</article-title>
          .
          <source>In: Procedings of the 6th Workshop of the ACL Special Interest Group in Computational Phonology</source>
          . pp.
          <fpage>21</fpage>
          -
          <lpage>30</lpage>
          . No.
          <string-name>
            <surname>July</surname>
          </string-name>
          , Philadelphia, USA (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Deerwester</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Furnas</surname>
            ,
            <given-names>G.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harshman</surname>
          </string-name>
          , R.:
          <article-title>Indexing by Latent Semantic Analysis</article-title>
          .
          <source>Journal of the American Society for Information Science Sep</source>
          <volume>41</volume>
          (
          <issue>6</issue>
          ),
          <fpage>391</fpage>
          -
          <lpage>407</lpage>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. D´ejean, H.:
          <article-title>Morphemes as Necessary Concept for Structures Discovery from Untagged Corpora</article-title>
          . In: D.M.W. Powers (ed.) NeMLaP3/CoNLL98 Workshop on Paradigms and
          <article-title>Grounding in Natural Language Learning</article-title>
          . pp.
          <fpage>295</fpage>
          -
          <lpage>299</lpage>
          . ACL,
          <string-name>
            <surname>Adelaide</surname>
          </string-name>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Demˇsar</surname>
          </string-name>
          , J.:
          <article-title>Statistical Comparisons of Classifiers over Multiple Data Sets</article-title>
          .
          <source>The Journal of Machine Learning Research 7</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>30</lpage>
          (
          <year>2006</year>
          ). https://doi.org/10.1016/j.jecp.
          <year>2010</year>
          .
          <volume>03</volume>
          .005
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Eiselen</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Puttkammer</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          :
          <article-title>Developing Text Resources for Ten South African Languages</article-title>
          . In: Calzolari,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Choukri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Declerck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Loftsso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Maegaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Mariani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Moreno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Odijk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Piperidis</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the Ninth International Conference on Language Resources and Evaluation (LREC'14)</source>
          . pp.
          <fpage>3698</fpage>
          -
          <lpage>3703</lpage>
          . European Language Resources Association (ELRA), Reykjavik, Iceland (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Feng</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kit</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Segmentation of Chinese Corpus Using Accessor Variety</article-title>
          .
          <source>In: International Conference on Natural Language Processing</source>
          . pp.
          <fpage>694</fpage>
          -
          <lpage>703</lpage>
          . No.
          <source>Mar 2</source>
          , Springer, Berlin, Heidelberg (
          <year>2004</year>
          ), https://pdfs.semanticscholar.org/6361/ 00aa5d12e96c13a82d626224721ef82410f7.pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Gaussier</surname>
          </string-name>
          , E.:
          <article-title>Unsupervised learning of derivational morphology from inflectional lexicons</article-title>
          .
          <source>In: Proceedings of ACL'99 Workshop: Unsupervised Learning in Natural Language Processing</source>
          . pp.
          <fpage>24</fpage>
          -
          <lpage>30</lpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Geman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Geman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images</article-title>
          .
          <source>IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE</source>
          <volume>6</volume>
          (
          <issue>6</issue>
          ) (
          <year>1984</year>
          ), https://pdfs. semanticscholar.org/62c3/4c8a8d8b82a9c466c35cda5e4837c17d9ccb.pdf
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Goldwater</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Griffiths</surname>
            ,
            <given-names>T.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
          </string-name>
          , M.:
          <article-title>Interpolating Between Types and Tokens by Estimating Power-Law Generators</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <fpage>459</fpage>
          -
          <lpage>466</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Gol´enia,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Spiegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Flach</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.A.</surname>
          </string-name>
          :
          <article-title>Unsupervised morpheme discovery with UNGRADE</article-title>
          .
          <source>In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          . vol.
          <volume>6241</volume>
          LNCS, pp.
          <fpage>633</fpage>
          -
          <lpage>640</lpage>
          . Springer, Berlin, Heidelberg (
          <year>2010</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          - 15754-776, http://www.cs.bris.ac.uk/Publications/Papers/2001221.pdf
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Hammarstr¨om, H.,
          <string-name>
            <surname>Borin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Unsupervised learning of morphology</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>37</volume>
          (
          <issue>2</issue>
          ),
          <fpage>309</fpage>
          -
          <lpage>350</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kit</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A Goodness Measure for Phrase Learning via Compression with the MDL Principle</article-title>
          . In: Ivana Kruijff-Korbayova (ed.)
          <source>Proceedings of the Third ESSLLI Student Session</source>
          . pp.
          <fpage>175</fpage>
          -
          <lpage>187</lpage>
          (
          <year>1998</year>
          ), https://pdfs.semanticscholar.org/120d/ b0372be64b0c2a52ff836932d98937582674.pdf
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Kosch</surname>
            ,
            <given-names>I.M.:</given-names>
          </string-name>
          <article-title>Topics in Morphology in the African Language Context</article-title>
          . Unisa Press, Pretoria (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Louw</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finlayson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Satyo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Xhosa Guide 3 for XHA100-</article-title>
          F. University of South Africa,
          <string-name>
            <surname>Pretoria</surname>
          </string-name>
          (
          <year>1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Lulamile</surname>
            <given-names>Mzamo</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Albert Helberg</surname>
          </string-name>
          , Sonja Bosch:
          <article-title>Towards an unsupervised morphological segmenter for isiXhosa</article-title>
          . In: Proceeding of 2019 SAUPEC/RobMech/PRASA Conference. pp.
          <fpage>166</fpage>
          -
          <lpage>170</lpage>
          . No.
          <source>January</source>
          <volume>28</volume>
          -30, Bloemfontein, South Africa (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Magistry</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sagot</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Unsupervized Word Segmentation: the case for Mandarin Chinese</article-title>
          .
          <source>In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics</source>
          . pp.
          <fpage>383</fpage>
          -
          <lpage>387</lpage>
          . Association for Computational Linguistics, Jeju, Republic of Korea (
          <year>2012</year>
          ), http://www.aclweb.org/anthology/P12-2075
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          , Schu¨tze, H.:
          <article-title>Foundations of Statistical Natural Language Processing</article-title>
          , , vol.
          <volume>26</volume>
          . MIT Press (
          <year>1999</year>
          ). https://doi.org/10.1162/coli.
          <year>2000</year>
          .
          <volume>26</volume>
          .2.
          <fpage>277</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. M´
          <article-title>endez-</article-title>
          <string-name>
            <surname>Cruz</surname>
            ,
            <given-names>C.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Medina-Urrea</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sierra</surname>
          </string-name>
          , G.:
          <article-title>Unsupervised morphological segmentation based on affixality measurements (</article-title>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Moors</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calteaux</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wilken</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gumede</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Human language technology audit 2018: Analysing the development trends in resource availability in all South African languages</article-title>
          .
          <source>In: SAICSIT 2018</source>
          . pp.
          <fpage>296</fpage>
          -
          <lpage>304</lpage>
          . No.
          <volume>26</volume>
          -
          <issue>28</issue>
          <year>September</year>
          ,
          <string-name>
            <given-names>ACM</given-names>
            ,
            <surname>Port</surname>
          </string-name>
          <string-name>
            <surname>Elizabeth</surname>
          </string-name>
          , South Africa (
          <year>2018</year>
          ). https://doi.org/10.1145/3278681.3278716
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Mzamo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Helberg</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bosch</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Introducing XGL-a lexicalised probabilistic graphical lemmatiser for isiXhosa</article-title>
          . In:
          <article-title>Pattern Recognition Association of South Africa and Robotics</article-title>
          and Mechatronics International Conference (PRASARobMech)
          <year>2015</year>
          . pp.
          <fpage>142</fpage>
          -
          <lpage>147</lpage>
          . IEEE,
          <string-name>
            <surname>Port</surname>
            <given-names>Elizabeth</given-names>
          </string-name>
          , South Africa (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Narasimhan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barzilay</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaakkola</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>An Unsupervised Method for Uncovering Morphological Chains</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>3</volume>
          ,
          <fpage>157</fpage>
          -
          <lpage>167</lpage>
          (
          <year>2015</year>
          ), https://github.com/
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Nogwina</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Development of a Stemmer for the IsiXhosa Language. M.sc</article-title>
          . dissertation, University of Fort Hare:
          <source>MSc. Dissertation</source>
          (
          <year>2016</year>
          ), http://libdspace.ufh.ac.za/bitstream/handle/20.500. 11837/221/MSc{%}28ComputerScience{%}
          <fpage>29</fpage>
          -NOGWINA{%}2CM.pdf?sequence= 1{&amp;}isAllowed=y
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Pahl</surname>
          </string-name>
          , H.: IsiXhosa. Educum Publishers,
          <source>King Williams Town</source>
          (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Pretorius</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bosch</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Finite-State Computational Morphology</surname>
          </string-name>
          :
          <article-title>An Analyzer Prototype For Zulu</article-title>
          .
          <source>Machine Translation</source>
          <volume>18</volume>
          (
          <issue>3</issue>
          ),
          <fpage>195</fpage>
          -
          <lpage>216</lpage>
          (jul
          <year>2005</year>
          ). https://doi.org/10.1007/s10590-004-2477-4
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Rissanen</surname>
          </string-name>
          , J.:
          <article-title>Modelling by the shortest data description</article-title>
          .
          <source>Automatica</source>
          <volume>14</volume>
          ,
          <fpage>465</fpage>
          -
          <lpage>471</lpage>
          (
          <year>1978</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Schone</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Knowledge-Free Induction of Morphology Using Latent Semantic Analysis</article-title>
          .
          <source>In: Proceedings of CoNLL-2000 and LLL-2000</source>
          . pp.
          <fpage>67</fpage>
          -
          <lpage>72</lpage>
          . Lisbon, Portugal (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <given-names>Sharma</given-names>
            <surname>Grover</surname>
          </string-name>
          , A., van Huyssteen,
          <string-name>
            <given-names>G.B.</given-names>
            ,
            <surname>Pretorius</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.W.</surname>
          </string-name>
          :
          <article-title>South African human language technologies audit</article-title>
          .
          <source>Language Resources and Evaluation</source>
          <volume>45</volume>
          (
          <issue>3</issue>
          ),
          <fpage>271</fpage>
          -
          <lpage>288</lpage>
          (jun
          <year>2011</year>
          ). https://doi.org/10.1007/s10579-011-9151-2, http://link.springer.
          <source>com/10.1007/s10579-011-9151-2</source>
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Sirts</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldwater</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Minimally-Supervised Morphological Segmentation using Adaptor Grammars</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>1</volume>
          ,
          <fpage>255</fpage>
          -
          <lpage>266</lpage>
          (
          <year>2013</year>
          ), http://www.aclweb.org/anthology/Q/Q13/Q13-1021.pdf
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eisner</surname>
          </string-name>
          , J.: Contrastive Estimation:
          <article-title>Training Log-Linear Models on Unlabeled Data</article-title>
          .
          <source>In: Proceedings of the 43rd Annual Meeting of the ACL</source>
          . pp.
          <fpage>354</fpage>
          -
          <lpage>362</lpage>
          . No. June, Ann Arbor, Michigan, USA (
          <year>2005</year>
          ), http://www.anthology. aclweb.org/P/P05/P05-1044.pdf
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Snyman</surname>
            , D., van Huyssteen,
            <given-names>G.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Automatic Genre Classification for Resource Scarce Languages</article-title>
          .
          <source>In: Proceedings of the 22nd Annual Symposium of the Pattern Recognition Association of South Africa</source>
          . pp.
          <fpage>132</fpage>
          -
          <lpage>137</lpage>
          (
          <year>2012</year>
          ), http: //www.clips.ua.ac.be/{~}walter/papers/2011/shd11.pdf
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37. South African Parliament:
          <article-title>UMgaqo-siseko weRiphablikhi yoMzantsi-</article-title>
          <string-name>
            <surname>Afrika</surname>
          </string-name>
          ka
          <article-title>-</article-title>
          <year>1996</year>
          (
          <year>1996</year>
          ), http://www.justice.gov.za/legislation/constitution/ SAConstitution-web-xho.pdf
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38. Statistics South Africa:
          <article-title>Community survey 2016 in Brief (</article-title>
          <year>2016</year>
          ), https://www. statssa.gov.za/publications/03-01-06/
          <fpage>03</fpage>
          -01-062016.pdf
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsou</surname>
            ,
            <given-names>B.K.</given-names>
          </string-name>
          :
          <article-title>Chinese Word Segmentation without Using Lexicon and Hand-crafted Training Data</article-title>
          .
          <source>In: Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics-Volume</source>
          <volume>2</volume>
          . pp.
          <fpage>1265</fpage>
          -
          <lpage>1271</lpage>
          . No.
          <year>August</year>
          10,
          <string-name>
            <surname>Association for Computational Linguistics</surname>
          </string-name>
          (
          <year>1998</year>
          ), https://aclanthology.info/pdf/C/C98/ C98-2201.pdf
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Theron</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cloete</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Automatic acquisition of two-level morphological rules</article-title>
          .
          <source>In: Proceedings of the fifth conference on Applied Natural Langauge Processing</source>
          . pp.
          <fpage>103</fpage>
          -
          <lpage>110</lpage>
          . Morgan Kaufmann Publishers, San Francisco, CA, Washington, DC (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Uchiumi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsukahara</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mochihashi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Inducing Word and Part-of-Speech with Pitman-Yor Hidden Semi-Markov Models</article-title>
          .
          <source>In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing</source>
          . pp.
          <fpage>1774</fpage>
          -
          <lpage>1782</lpage>
          . No.
          <source>July</source>
          <volume>26</volume>
          -31, Association for Computational Linguistics, Beijing, China (
          <year>2015</year>
          ), http://www. aclweb.org/anthology/P15-1171
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chow</surname>
            ,
            <given-names>K.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hui</surname>
            ,
            <given-names>L.C.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yiu</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          :
          <article-title>Unknown Chinese word extraction based on variety of overlapping strings</article-title>
          .
          <source>Information Processing and Management</source>
          <volume>49</volume>
          (
          <issue>2</issue>
          ),
          <fpage>497</fpage>
          -
          <lpage>512</lpage>
          (
          <year>2013</year>
          ). https://doi.org/10.1016/j.ipm.
          <year>2012</year>
          .
          <volume>09</volume>
          .004, http://dx.doi.org/10.1016/j.ipm.
          <year>2012</year>
          .
          <volume>09</volume>
          .004
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Zhikov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takamura</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Okumura</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL. Information and Media Technologies, (reprinted from:</article-title>
          <source>Transactions of the Japanese Society for Artificial Intelligence</source>
          ,
          <year>2013</year>
          ,
          <volume>28</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>347</fpage>
          -
          <lpage>360</lpage>
          )
          <issue>8</issue>
          (
          <issue>2</issue>
          ),
          <fpage>514</fpage>
          -
          <lpage>527</lpage>
          (
          <year>2013</year>
          ), http://www.lr.pi. titech.ac.
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Zwicky</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Entdecken, erfinden, forschen: im morphologischen Weltbild</article-title>
          .
          <source>Muenchen: Droemer</source>
          (
          <year>1966</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>