CFP last date
20 December 2024
Reseach Article

Novel Approach for Arabic Spell-Checker: Based on Radix Search Tree

by Rasha Al-tarawneh, Hatem S. A. Hamatta, Hasan Muiadi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 95 - Number 7
Year of Publication: 2014
Authors: Rasha Al-tarawneh, Hatem S. A. Hamatta, Hasan Muiadi
10.5120/16603-6424

Rasha Al-tarawneh, Hatem S. A. Hamatta, Hasan Muiadi . Novel Approach for Arabic Spell-Checker: Based on Radix Search Tree. International Journal of Computer Applications. 95, 7 ( June 2014), 1-5. DOI=10.5120/16603-6424

@article{ 10.5120/16603-6424,
author = { Rasha Al-tarawneh, Hatem S. A. Hamatta, Hasan Muiadi },
title = { Novel Approach for Arabic Spell-Checker: Based on Radix Search Tree },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 95 },
number = { 7 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume95/number7/16603-6424/ },
doi = { 10.5120/16603-6424 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:18:46.665453+05:30
%A Rasha Al-tarawneh
%A Hatem S. A. Hamatta
%A Hasan Muiadi
%T Novel Approach for Arabic Spell-Checker: Based on Radix Search Tree
%J International Journal of Computer Applications
%@ 0975-8887
%V 95
%N 7
%P 1-5
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The main aim of this study is to develop a spell-checker system for Arabic language. This is done by investigating the viability of applying the radix search tree approach. Through this scientific research several shrubs that represent Arabic characters will be built through serialized tracking of characters word where it can be added to the dictionary and with a special mark in the node that contains the last characters from each word; on other side during searching process, every word can be tracked character by character according suitable path inside its shrub, Accordingly, correct word can be recognized if and only if searching process locates some leaves during the traverse of the shrub. Otherwise, the word will be considered incorrect.

References
  1. H Muaidi and R Al-Tarawneh. Towards Arabic spell-checker based on n-grams scores. International Journal of Computer Applications, 53(03):5, September 2012.
  2. Anna Feldman. Computational Linguistics: Models, Resources, Applications. ISBN, 2004.
  3. B. Haddad and M Yaseen. Detection and correction of non-words in arabic: A hybrid approach. International Journal of Computer Processing of Oriental Languages, 30, 2007.
  4. Mohammed kabbani. The arabic spell-checker dictionary from ayaspell project. Technical report, Prix special des troisiemes rencontres africaines du Logiciel Libre, 2008.
  5. S. K Kataria and Sons. The Design and Analysis of Algorithms. N. Upadhyay, 2008.
  6. Muaidi. Hasan. Extraction Of Arabic Word Roots: An Approach Based on Computational Model and Multi-Backpropagation Neural Networks PhD thesis, De Montfort University - UK, 2008.
  7. H Satori, M Harti, and N Chenfour. Arabic speech recognition system using cmu-sphinx4. CoRR 0704. 2201, 2007.
  8. Zeina Seikaly. The arabic language: The glue that binds the arab world. AMIDEAST, 2007.
  9. S. Khaled, A. Amin, and G. AbdAllah. Towards automatic spell checking for arabic. In Language Engineering, 2003.
  10. T. Zerrouki and A. Balla, Implementation of infixes and circumfixes in the spellcheckers. In Proceedings of the Second International Conference on Arabic Language Resources and Tools, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Spell-Checker Radix Search Tree Computational Linguistic