A comparison study of some Arabic root finding algorithms

  • Authors:

  • Emad Al-Shawakfa;Amer Al-Badarneh;Safwan Shatnawi;Khaleel Al-Rabab'ah;Basel Bani-Ismail

  • Affiliations:

  • Computer Information Systems Department, Yarmouk University, Irbid 211-63, Jordan;Computer Information Systems Department, Jordan University for Science and Technology, Irbid, Jordan;Applied Studies College, University of Bahrain, Sakhir, Bahrain;Applied Studies College, University of Bahrain, Sakhir, Bahrain;Applied Studies College, University of Bahrain, Sakhir, Bahrain

  • Venue:
  • Journal of the American Society for Information Science and Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Arabic has a complex structure, which makes it difficult to apply natural language processing (NLP). Much research on Arabic NLP (ANLP) does exist; however, it is not as mature as that of other languages. Finding Arabic roots is an important step toward conducting effective research on most of ANLP applications. The authors have studied and compared six root-finding algorithms with success rates of over 90%. All algorithms of this study did not use the same testing corpus and-or benchmarking measures. They unified the testing process by implementing their own algorithm descriptions and building a corpus out of 3823 triliteral roots, applying 73 triliteral patterns, and with 18 affixes, producing around 27.6 million words. They tested the algorithms with the generated corpus and have obtained interesting results; they offer to share the corpus freely for benchmarking and ANLP research. © 2010 Wiley Periodicals, Inc.