Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
