Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new improved solution for schema matching problem. An improvement hybrid semantic schema matching algorithm which semi automatically finds matching between two data representation schemas is introduced. The algorithm finds mappings based on the hierarchical organization of the elements of a term WordNet dictionary. تفاصيل المقالة