A Random Forests Text Transliteration System for Greek Digraphia - Artificial Intelligence Applications and Innovations - Part II
Conference Papers Year : 2011

A Random Forests Text Transliteration System for Greek Digraphia

Alexandros Panteli
  • Function : Author
  • PersonId : 1014229
Manolis Maragoudakis
  • Function : Author
  • PersonId : 992336

Abstract

Greeklish to Greek transcription does undeniably seem to be a challenging task since it cannot be accomplished by directly mapping each Greek character to a corresponding symbol of the Latin alphabet. The ambiguity in the human way of Greeklish writing, since Greeklish users do not follow a standardized way of transliteration makes the process of transcribing Greeklish back to Greek alphabet challenging. Even though a plethora of deterministic approaches for the task at hand exists, this paper presents a non-deterministic, vocabulary-free approach, which produces comparable and even better results, supports argot and other linguistic peculiarities, based on an ensemble classification methodology of Data Mining, namely Random Forests. Using data from real users from a conglomeration of resources such as Blogs, forums, email lists, etc., as well as artificial data from a robust stochastic Greek to Greeklish transcriber, the proposed approach depicts satisfactory outcomes in the range of 91.5%-98.5%, which is comparable to an alternative commercial approach.
Fichier principal
Vignette du fichier
978-3-642-23960-1_24_Chapter.pdf (404.03 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01571492 , version 1 (02-08-2017)

Licence

Identifiers

Cite

Alexandros Panteli, Manolis Maragoudakis. A Random Forests Text Transliteration System for Greek Digraphia. 12th Engineering Applications of Neural Networks (EANN 2011) and 7th Artificial Intelligence Applications and Innovations (AIAI), Sep 2011, Corfu, Greece. pp.196-201, ⟨10.1007/978-3-642-23960-1_24⟩. ⟨hal-01571492⟩
174 View
197 Download

Altmetric

Share

More