Abstract
This paper presents an Arabic morphological analyzer1 that is a component of an architecture which can process unrestricted text from Internet. The morphological analyzer uses an object-oriented model to represent the morphological rules for verbs and nouns, a matching algorithm to isolate the affixes and the root of a given word-form, and a linguistic knowledge base consisting in lists of words. The morphological rules fall into two categories: the regular morphological rules of the Arabic grammar and the exception rules that represent the language exceptions. The representation and the implementation of these rules and the matching algorithm are discussed in this paper.
| Original language | English |
|---|---|
| Pages (from-to) | 389-400 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2004 |
| DOIs | |
| Publication status | Published - 2001 |
Keywords
- Exception rule
- Matching algorithm
- Morphological analyzer
- Object-oriented model
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)