Repository logoRepository logo
 

KALAS

Loading...
Thumbnail Image

Date

2015-01-30

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

North-West University
Centre for Text Technology (CTexT)

Abstract

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.

Keywords

Citation

License

Collections

Verification status

Level 0