Weighted Finite Automata encoding over Thai language

Authors:
Korakot Prachumrak
Affiliations:
King Mongkut's Institute of Technology, Ladkrabang, Bangkok, Thailand
Venue:
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Year:
2009

Citing 8
Cited 0

Image-data compression using edge-optimizing algorithm for WFA inference

Information Processing and Management: an International Journal - Special issue: data compression
An inference implementation based on extended weighted finite automata

ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Refining image compression with weighted finite automata

DCC '96 Proceedings of the Conference on Data Compression
Near-Lossless Image Compression Schemes based on Weighted Finite Automata Encoding and Adaptive Context Modelling

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
A binary partitioning approach to image compression using weighted finite automata for large images

Computers & Mathematics with Applications
Linear encoding scheme for weighted finite automata

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
An ω-automata approach to the representation of bilevel images

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Weighted finite automata for video compression

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.