A New Exact Pattern Matching Algorithm (WEMA)

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 was applied to match the exact pattern within a text depending on preparing the text in an index matrix weight...

Full description

Saved in:
Bibliographic Details
Published inJournal of applied sciences (Asian Network for Scientific Information) Vol. 14; no. 2; pp. 193 - 196
Main Authors Hlayel, Abdallah A., Hnaif, Adnan A.
Format Journal Article
LanguageEnglish
Published 01.01.2014
Subjects
Algorithms
Computer simulation
Extreme values
Matching
Pattern analysis
Pattern recognition
String matching
Texts
Online AccessGet full text
ISSN1812-5654
1812-5662
1812-5662
DOI10.3923/jas.2014.193.196

Cover

More Information
Summary: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 was 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1812-5654
1812-5662
1812-5662
DOI:10.3923/jas.2014.193.196