ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Introduction to information storage and retrieval systems
Information retrieval
Information retrieval
New indices for text: PAT Trees and PAT arrays
Information retrieval
Comparing words, stems, and roots as index terms in an Arabic Information Retrieval System
Journal of the American Society for Information Science
Arabic string searching in the context of character code standards and orthographic variations
Computer Standards & Interfaces
A fast string searching algorithm
Communications of the ACM
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
| Hi-index | 0.00 |
In this paper, a morphological matching approach based on the lexical structure of Arabic words is introduced. Given a root R, the principle underlying morphological matching is to search for R in a text T to find all its occurrences. An algorithm is presented and its empirical and running time performance is analyzed. The results of searching experiments show that morphological matching provides high precision and recall ratios. But, since morphological searching is probabilistic, the results of experiments involved a number of errors caused by weak verbs. The analysis of running time performance indicates that morphological searching can be as efficient as pattern matching, if the root is entered by the user.