Catalog Home Page

An automatic indexing technique for Thai texts using frequent max substring

Chumwatana, T., Wong, K.W. and Xie, H. (2009) An automatic indexing technique for Thai texts using frequent max substring. In: 8th International Symposium on Natural Language Processing, SNLP '09, 20 - 22 Oct, Bangkok Thailand.

[img]
Preview
PDF - Published Version
Download (1154kB) | Preview
    Link to Published Version: http://dx.doi.org/10.1109/SNLP.2009.5340946
    *Subscription may be required

    Abstract

    Thai language is considered as a non-segmented language where words are a string of symbols without explicit word boundaries, and also the structure of written Thai language is highly ambiguous. This problem causes an indexing technique has become a main issue in Thai text retrieval. To construct an inverted index for Thai texts, an index terms extraction technique is usually required to segment texts into index term schemes. Although index terms can be specified manually by experts, this process is very time consuming and labor-intensive. Word segmentation is one of the many techniques that are used to automatically extract index terms from Thai texts. However, most of the word segmentation techniques require linguistic knowledge and the preparation of these approaches is time consuming. An n-gram based approach is another automatic index terms extraction method that is often used as indexing technique for Asian languages including Thai. This approach is language independent which does not require any linguistic knowledge or dictionary. Although the n-gram approach out performs many indexing techniques for Asian languages in term of retrieval effectiveness, the disadvantage of n-gram approach is it suffers from large storage space and long retrieval time. In this paper we present the frequent max substring mining to extract index terms from Thai texts. Our method is language-independent and it does not rely on any dictionary or language grammatical knowledge. Frequent max substring mining is based on text mining that describes a process of discovering useful information or knowledge from unstructured texts. This approach uses the analysis of frequent max substring sets to extract all long and frequently-occurred substrings. We aim to employ the frequent max substring mining algorithm to address the drawback of n-gram based approach by keeping only frequent max substrings to reduce disk space requirement for storing index terms and to reduce the retrieval time in order to deal with the rapid growth of Thai texts.

    Publication Type: Conference Paper
    Murdoch Affiliation: School of Information Technology
    Publisher: IEEE
    Copyright: © IEEE
    Notes: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
    URI: http://researchrepository.murdoch.edu.au/id/eprint/1399
    Item Control Page

    Downloads

    Downloads per month over past year