KALAS
Please do not copy the URL from the browser for citation. The correct URL is 'https://hdl.handle.net/20.500.12185/148'
| dc.contact.email | Martin.Puttkammer@nwu.ac.za | |
| dc.contact.name | Martin Puttkammer | |
| dc.date.accessioned | 2018-02-05T07:33:08Z | |
| dc.date.accessioned | 2018-03-05T14:58:07Z | |
| dc.date.available | 2018-02-05T07:33:08Z | |
| dc.date.available | 2018-03-05T14:58:07Z | |
| dc.date.issued | 2015-01-30 | |
| dc.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. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12185/148 | |
| dc.language.iso | afr | |
| dc.languages | Afrikaans | |
| dc.media.category | Compound Analyser | |
| dc.media.type | Text | |
| dc.publisher | North-West University | |
| dc.publisher | Centre for Text Technology (CTexT) | |
| dc.title | KALAS | |
| dc.type | Modules | |
| dc.version | N/A | |
| local.collection.primary | Resource Index |