In pattern matching or recognition the match usually has to
be exact. This study, introduce a new general approach algorithm, called the
Weighted Exact Matching Algorithm (WEMA). The WEMA applied to match the exact
pattern within a text depending on preparing the text in an index matrix weight
with the locations of characters in alphabetical order to perform direct access
matching. Whereby, WEMA check the possibility of the pattern existence before
applying the matching process. The simulation result showed significant improvement
in the exact string matching and therefore extreme competence in the real applications.