|Description||KALAS is a rule-based compound analyser for Afrikaans, to be used for the detection of word boundaries within compounds. It takes as input a string, and produces as output an analysed string, without any tags. For example, the string "hondehokdak" ('dog house roof') will be analysed as "hond _ e + hok + dak", where the plus sign indicates the beginning of an independent constituent, and the underscore the beginning of a dependent constituent (i.e. a valence morpheme). The algorithm is based on a basic longest-string matching algorithm, with certain restrictions build into it. It has been implemented in both C and Perl.|
|Contact name||Roald Eiselen|
|Publisher(s)||North-West University; Centre for Text Technology (CTexT)|
|Media category||Compound Analyser|
|Primary collection||Resource Index|
|Submit date||2018-02-05T07:33:08Z; 2018-03-05T14:58:07Z|
|Date available||2018-02-05T07:33:08Z; 2018-03-05T14:58:07Z|
Files in this item
There are no files associated with this item.
This item appears in the following Collection(s)
Resource Index 
A collection of language resource metadata mostly collected during the NHN funded technology audit of 2009, as well as the SADiLaR technology audit of 2018. Not all resources in this collection are available for download.