Markov and fuzzy models for written language verification
Tran, Dat T., and Pham, Tuan D. (2005) Markov and fuzzy models for written language verification. WSEAS Transactions on Systems, 4 (4). pp. 268-272.
PDF (Published Version)
Restricted to Repository staff only
This paper presents a computational algorithm for machine classification of written languages using the Markov chain-based method for building language models and the fuzzy set theory-based normalization method to verify language. For a language document, each word is represented as a Markov chain of alphabetical letters. The initial probability and transition probabilities are calculated and the set of such probabilities obtained from the training data is referred to as the model of that language. Given an unknown text document and a claimed identity of a language, a similarity score based on fuzzy set theory is calculated and compared with a preset threshold. If the match is good enough, the identity claim is accepted. The proposed fuzzy normalization method is more effective for machine learning than the non-fuzzy normalization method, which has been widely used for speaker verification. Experimental results of verifying a set of seven closely roman-typed languages show the promising application of the proposed method.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||fuzzy normalisation method; Markov chain; written language verification|
No current JCU email address available.
|Date Deposited:||03 Dec 2010 03:00|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0899 Other Information and Computing Sciences > 089999 Information and Computing Sciences not elsewhere classified @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Citation Count from Scopus||