title: Morpheme matching based text tokenization for a scarce resourced language.
abstract: Text tokenization is a fundamental pre-processing step for almost all the information processing applications. This task is nontrivial for the scarce resourced languages such as Urdu, as there is inconsistent use of space between words. In this paper a morpheme matching based approach has been proposed for Urdu text tokenization, along with some other algorithms to solve the additional issues of boundary detection of compound words, affixation, reduplication, names and abbreviations. This study resulted into 97.28% precision, 93.71% recall, and 95.46% F1-measure; while tokenizing a corpus of 57000 words by using a morpheme list with 6400 entries.
authors.affiliation: Department of Computer Science, COMSATS Institute of Information Technology, Abbottabad, Pakistan.
authors.forename: Zobia
authors.initials: Z
authors.lastname: Rehman
authors.forename: Waqas
authors.initials: W
authors.lastname: Anwar
authors.forename: Usama Ijaz
authors.initials: UI
authors.lastname: Bajwa
authors.forename: Wang
authors.initials: W
authors.lastname: Xuan
authors.forename: Zhou
authors.initials: Z
authors.lastname: Chaoying
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016247:Information Storage and Retrieval; D007802:Language; D016013:Likelihood Functions; D009275:Names; D011381:Programming Languages; D015203:Reproducibility of Results; D012984:Software