Weighted Finite Automata encoding over Thai language
Korakot Prachumrak · 2009
This research proposes a new method to encode and decode Thai language text with Weighted Finite Automata (WFA). To create a WFA for a Thai text file, the encoding process looks for the relations of every alphabet. Then, the relations of the alphabets are used for the creation of the transitions. The nodes of the automata are from the alphabets in the sentences. The experimental results show that the compression ratios are good for the large text files.