A Novel Rule-Based Root Extraction Algorithm for Arabic Language

Non-vocalized Arabic words are ambiguous words, because non-vocalized words may have different meanings. Therefore, these words may have more than one root. Many Arabic root extraction algorithms have been conducted to extract the roots of non-vocalized Arabic words. However, most of them return only one root and produce lower accuracy than reported when they are tested on different datasets. Arabic root extraction algorithm is an urgent need for applications like information retrieval systems, indexing, text mining, text classification, data compression, spell checking, text summarization, question answering systems and machine translation. In this work, a new rule-based Arabic root extraction algorithm is developed and focuses to overcome the limitation of previous works. The proposed algorithm is compared to the algorithm of Khoja, which is a well-known Arabic root extraction algorithm that produces high accuracy. The testing process was conducted on the corpus of Thalji, which is mainly built to test and compare Arabic roots extraction algorithms. It contains 720,000 word-root pairs from 12000 roots, 430 prefixes, 320 suffixes, and 4320 patterns. The experimental result shows that the algorithm of Khoja achieved 63%, meanwhile the proposed algorithm achieved 94% of accuracy.

@article{Thalji2018,
  title     = {A Novel Rule-Based Root Extraction Algorithm for Arabic Language},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {10},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Nisrean Thalji and Nik Adilah Hanin and Walid Bani Hani and Sohair Al-Hakeem and Zyad Thalji},
  doi       = {10.14569/IJACSA.2018.091015},
  url       = {https://doi.org/10.14569/IJACSA.2018.091015}
}