A morphology-driven string matching approach to Arabic text searching

摘要

Given a root R, the MM approach searches for R in a test T to find all its occurrences. An algorithm is developed in this regard, and its empirical and running time performance is analyzed. The results indicate that MM provides high precision and recall ratios. However, MM being probabilistic, the results also involve a number of errors caused by weak verbs. The approach is still an efficient tool for pattern matching when entered by the user.