Progress in Machines and Systems Julio C. Rivera , Paul M. Di Gangi , James L. Worrell , Samuel C. Thompson , Allen C. Johnston 4 2 2015 http://www.dline.info/pms/fulltext/v4n2/v4n2_2.pdf Pattern matching actually is consisting of searching a pattern inside of a text. It is a fundamental challenge in the field of computer science. It is important to any string matching algorithm to be able to locate quickly some or all occurrences of a user-specified pattern in a text. Although There had been presented many algorithms in this field. Boyer More Algorithm (BM), among them, is one of the most efficient algorithms that has used in many applications. In this study, we had proposed a new pattern matching technique rely on utilizing Boyer More Algorithm, based on its second order. The proposed method uses matched partition in the previous step in order to avoid unnecessary comparisons. Afterwards, the proposed algorithm has been implemented and also has been compared with existing algorithms. The comparison results show that our proposed method has less time complexity than other existing techniques, especially than Boyer Moore algorithm.