TY - GEN
T1 - Three-level morphological analyzer for arabic verbs and particles
AU - Al-Raisi, Fatima T.
AU - Al-Hafeedh, Anisa M.
AU - Al-Farsi, Salha M.
AU - Zidoum, Hamza Z.
PY - 2004
Y1 - 2004
N2 - This paper presents a Three-level Morphological Analyzer (MA). Our approach consists of mimicking morphology processing carried out by a human linguist expert. Hence, a great emphasis is put on the analysis and representation of Arabic linguistic rules. This step is very crucial in order to come up with a reliable MA. In the Three-level MA, surface words (tokens) undergo stemming to produce corresponding stems. Roots are then generated from resultant stems. A multi-affix approach is considered when stemming tokens. The stemming algorithm performs iterative light stemming which strips a part of the prefix/suffix. Indeed, from the linguistic point of view, a prefix/suffix is not just one string of characters. It is rather a combination of letters that may represent a number of distinct entities. Light stemming helps extracting information from each prefix/suffix by considering each separately. The root generating algorithm identifies the form of a stem, wherefrom, it extracts the root. The root generating algorithm manipulates deviated stems for unified treatment purposes. The MA is equipped with a comprehensive coverage lexicon to ensure correctness of results.
AB - This paper presents a Three-level Morphological Analyzer (MA). Our approach consists of mimicking morphology processing carried out by a human linguist expert. Hence, a great emphasis is put on the analysis and representation of Arabic linguistic rules. This step is very crucial in order to come up with a reliable MA. In the Three-level MA, surface words (tokens) undergo stemming to produce corresponding stems. Roots are then generated from resultant stems. A multi-affix approach is considered when stemming tokens. The stemming algorithm performs iterative light stemming which strips a part of the prefix/suffix. Indeed, from the linguistic point of view, a prefix/suffix is not just one string of characters. It is rather a combination of letters that may represent a number of distinct entities. Light stemming helps extracting information from each prefix/suffix by considering each separately. The root generating algorithm identifies the form of a stem, wherefrom, it extracts the root. The root generating algorithm manipulates deviated stems for unified treatment purposes. The MA is equipped with a comprehensive coverage lexicon to ensure correctness of results.
KW - Arabic processing
KW - Computational linguistics
KW - Morphological analysis
UR - http://www.scopus.com/inward/record.url?scp=10444256511&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=10444256511&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:10444256511
SN - 0889864586
T3 - Proceedings of the Eighth IASTED International Conference on Artificial Intelligence and Soft Computing
SP - 41
EP - 47
BT - Proceedings of the Eighth IASTED International Conference On Artificial Intelligence and Soft Computing
A2 - Pobil, A.P.
T2 - Proceedings of the Eighth IASTED International Conference on Atificial Intelligence and Soft Computing
Y2 - 1 September 2004 through 3 September 2004
ER -