JIPS (한국정보처리학회)
Current Result Document :
| 한글제목(Korean Title) |
Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence |
| 영문제목(English Title) |
Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence |
| 저자(Author) |
Makara Mao
Sony Peng
Yixuan Yang
Doo-Soon Park
|
| 원문수록처(Citation) |
VOL 18 NO. 04 PP. 0549 ~ 0561 (2022. 08) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words. |
| 키워드(Keyword) |
Bi-directional Maximal Matching
Khmer Language
Natural Language Processing
Word Corpus
Word Segmentation
|
| 파일첨부 |
PDF 다운로드
|
